./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix006.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/mix006.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/mix006.opt.i ./goblint.2024-05-07_14-17-48.files/mutex-meet/mix006.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:12:21,044 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-12 11:12:21,108 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-05-12 11:12:21,112 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-12 11:12:21,113 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-12 11:12:21,137 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-12 11:12:21,137 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-12 11:12:21,138 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-12 11:12:21,138 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-05-12 11:12:21,141 INFO L153 SettingsManager]: * Use memory slicer=true [2024-05-12 11:12:21,142 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-12 11:12:21,142 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-12 11:12:21,143 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-12 11:12:21,144 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-12 11:12:21,144 INFO L153 SettingsManager]: * Use SBE=true [2024-05-12 11:12:21,144 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-12 11:12:21,144 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-12 11:12:21,145 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-12 11:12:21,145 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-12 11:12:21,145 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-12 11:12:21,145 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-12 11:12:21,146 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-12 11:12:21,146 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-12 11:12:21,146 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-12 11:12:21,146 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-05-12 11:12:21,146 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-12 11:12:21,147 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-12 11:12:21,147 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-12 11:12:21,147 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-12 11:12:21,148 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-12 11:12:21,148 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-05-12 11:12:21,148 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-12 11:12:21,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 11:12:21,149 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-12 11:12:21,149 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-12 11:12:21,149 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-12 11:12:21,149 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-12 11:12:21,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-12 11:12:21,150 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-12 11:12:21,150 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-05-12 11:12:21,150 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-12 11:12:21,151 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-05-12 11:12:21,151 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-05-12 11:12:21,151 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:12:21,336 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-12 11:12:21,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-12 11:12:21,363 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-12 11:12:21,363 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-12 11:12:21,364 INFO L274 PluginConnector]: CDTParser initialized [2024-05-12 11:12:21,365 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix006.opt.i [2024-05-12 11:12:22,508 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-12 11:12:22,706 INFO L384 CDTParser]: Found 1 translation units. [2024-05-12 11:12:22,706 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix006.opt.i [2024-05-12 11:12:22,718 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7493c5907/3bf44fe5580f49408cd7dcf546ddaa0a/FLAGc7d610665 [2024-05-12 11:12:22,728 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7493c5907/3bf44fe5580f49408cd7dcf546ddaa0a [2024-05-12 11:12:22,731 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-05-12 11:12:22,731 INFO L274 PluginConnector]: Witness Parser initialized [2024-05-12 11:12:22,732 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/mix006.opt.yml/witness.yml [2024-05-12 11:12:22,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-12 11:12:22,925 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-12 11:12:22,926 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-12 11:12:22,926 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-12 11:12:22,929 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-12 11:12:22,930 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 11:12:22" (1/2) ... [2024-05-12 11:12:22,930 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@164df1f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:12:22, skipping insertion in model container [2024-05-12 11:12:22,931 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 11:12:22" (1/2) ... [2024-05-12 11:12:22,932 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4df2d6d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:12:22, skipping insertion in model container [2024-05-12 11:12:22,932 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:12:22" (2/2) ... [2024-05-12 11:12:22,933 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@164df1f2 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:12:22, skipping insertion in model container [2024-05-12 11:12:22,933 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:12:22" (2/2) ... [2024-05-12 11:12:22,933 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-05-12 11:12:22,999 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-05-12 11:12:23,000 INFO L97 edCorrectnessWitness]: Location invariant before [L852-L852] ((((((((((((((((((((! multithreaded || y$r_buff1_thd1 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 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_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_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_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_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_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$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$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$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_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 )__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 )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )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_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_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_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )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_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_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 )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_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 )__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 )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_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 )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_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 )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_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 + (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_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$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_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$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_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_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_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_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_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_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_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_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$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$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$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_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$$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_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) && (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 )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 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 )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 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_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (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 )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_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 )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_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && 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) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && (z == 0 || z == 1)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || (0 <= __unbuffered_p1_EAX && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0) [2024-05-12 11:12:23,001 INFO L97 edCorrectnessWitness]: Location invariant before [L851-L851] ((((((((((((((((((((! multithreaded || y$r_buff1_thd1 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 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_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_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_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_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_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$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$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$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_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 )__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 )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )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_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_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_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )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_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_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 )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_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 )__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 )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_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 )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_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 )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_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 + (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_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$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_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$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_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_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_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_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_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_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_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_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$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$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$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_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$$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_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) && (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 )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 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 )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 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_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (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 )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_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 )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_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && 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) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && (z == 0 || z == 1)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || (0 <= __unbuffered_p1_EAX && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0) [2024-05-12 11:12:23,001 INFO L97 edCorrectnessWitness]: Location invariant before [L849-L849] ((((((((((((((((((((! multithreaded || y$r_buff1_thd1 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 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_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_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_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_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_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$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$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$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_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 )__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 )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )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_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_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_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )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_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_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 )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_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 )__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 )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_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 )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_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 )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_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 + (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_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$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_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$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_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_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_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_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_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_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_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_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$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$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$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_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$$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_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) && (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 )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 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 )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 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_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (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 )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_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 )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_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && 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) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && (z == 0 || z == 1)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || (0 <= __unbuffered_p1_EAX && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0) [2024-05-12 11:12:23,002 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-05-12 11:12:23,002 INFO L106 edCorrectnessWitness]: ghost_update [L847-L847] multithreaded = 1; [2024-05-12 11:12:23,037 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-12 11:12:23,147 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/mix006.opt.i[944,957] [2024-05-12 11:12:23,319 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 11:12:23,329 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-05-12 11:12:23,358 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/mix006.opt.i[944,957] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-05-12 11:12:23,624 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 11:12:23,655 INFO L206 MainTranslator]: Completed translation [2024-05-12 11:12:23,655 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:12:23 WrapperNode [2024-05-12 11:12:23,655 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-12 11:12:23,656 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-12 11:12:23,656 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-12 11:12:23,656 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-12 11:12:23,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:12:23" (1/1) ... [2024-05-12 11:12:23,703 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:12:23" (1/1) ... [2024-05-12 11:12:23,835 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 155 [2024-05-12 11:12:23,841 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-12 11:12:23,842 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-12 11:12:23,842 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-12 11:12:23,842 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-12 11:12:23,850 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:12:23" (1/1) ... [2024-05-12 11:12:23,851 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:12:23" (1/1) ... [2024-05-12 11:12:23,867 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:12:23" (1/1) ... [2024-05-12 11:12:23,917 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:12:23,917 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:12:23" (1/1) ... [2024-05-12 11:12:23,918 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:12:23" (1/1) ... [2024-05-12 11:12:23,955 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:12:23" (1/1) ... [2024-05-12 11:12:23,957 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:12:23" (1/1) ... [2024-05-12 11:12:23,976 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:12:23" (1/1) ... [2024-05-12 11:12:23,981 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:12:23" (1/1) ... [2024-05-12 11:12:24,010 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-12 11:12:24,012 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-12 11:12:24,012 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-12 11:12:24,012 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-12 11:12:24,012 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:12:23" (1/1) ... [2024-05-12 11:12:24,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 11:12:24,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 11:12:24,039 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:12:24,104 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:12:24,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-05-12 11:12:24,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-05-12 11:12:24,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-05-12 11:12:24,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-05-12 11:12:24,110 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-12 11:12:24,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-12 11:12:24,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-12 11:12:24,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-12 11:12:24,111 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-12 11:12:24,111 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-12 11:12:24,111 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-12 11:12:24,111 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-12 11:12:24,112 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-05-12 11:12:24,112 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-05-12 11:12:24,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-05-12 11:12:24,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-05-12 11:12:24,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-05-12 11:12:24,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-05-12 11:12:24,113 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-12 11:12:24,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-12 11:12:24,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-12 11:12:24,115 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:12:24,244 INFO L244 CfgBuilder]: Building ICFG [2024-05-12 11:12:24,246 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-12 11:12:25,331 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-05-12 11:12:25,332 INFO L293 CfgBuilder]: Performing block encoding [2024-05-12 11:12:25,605 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-12 11:12:25,606 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-12 11:12:25,607 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 11:12:25 BoogieIcfgContainer [2024-05-12 11:12:25,607 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-12 11:12:25,609 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-12 11:12:25,609 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-12 11:12:25,611 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-12 11:12:25,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 11:12:22" (1/4) ... [2024-05-12 11:12:25,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@703c6582 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 11:12:25, skipping insertion in model container [2024-05-12 11:12:25,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:12:22" (2/4) ... [2024-05-12 11:12:25,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@703c6582 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 11:12:25, skipping insertion in model container [2024-05-12 11:12:25,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:12:23" (3/4) ... [2024-05-12 11:12:25,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@703c6582 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 11:12:25, skipping insertion in model container [2024-05-12 11:12:25,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 11:12:25" (4/4) ... [2024-05-12 11:12:25,614 INFO L112 eAbstractionObserver]: Analyzing ICFG mix006.opt.i [2024-05-12 11:12:25,627 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-12 11:12:25,627 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-05-12 11:12:25,627 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-12 11:12:25,738 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-12 11:12:25,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 49 transitions, 110 flow [2024-05-12 11:12:25,828 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2024-05-12 11:12:25,828 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 11:12:25,832 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 81 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2024-05-12 11:12:25,833 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 49 transitions, 110 flow [2024-05-12 11:12:25,836 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 46 transitions, 101 flow [2024-05-12 11:12:25,861 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-12 11:12:25,869 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;@50630d77, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-12 11:12:25,869 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-05-12 11:12:25,876 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-05-12 11:12:25,876 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-05-12 11:12:25,877 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 11:12:25,877 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:12:25,877 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 11:12:25,878 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:12:25,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:12:25,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1508902457, now seen corresponding path program 1 times [2024-05-12 11:12:25,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:12:25,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505121447] [2024-05-12 11:12:25,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:12:25,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:12:26,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:12:31,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:12:31,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:12:31,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505121447] [2024-05-12 11:12:31,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505121447] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:12:31,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:12:31,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 11:12:31,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456378871] [2024-05-12 11:12:31,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:12:31,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 11:12:31,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:12:31,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 11:12:31,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 11:12:31,470 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-05-12 11:12:31,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 101 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:12:31,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:12:31,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-05-12 11:12:31,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:12:32,573 INFO L124 PetriNetUnfolderBase]: 3005/5068 cut-off events. [2024-05-12 11:12:32,573 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-05-12 11:12:32,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9485 conditions, 5068 events. 3005/5068 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 33463 event pairs, 2435 based on Foata normal form. 151/4800 useless extension candidates. Maximal degree in co-relation 9470. Up to 4336 conditions per place. [2024-05-12 11:12:32,602 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 42 selfloop transitions, 5 changer transitions 0/60 dead transitions. [2024-05-12 11:12:32,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 60 transitions, 229 flow [2024-05-12 11:12:32,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 11:12:32,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 11:12:32,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2024-05-12 11:12:32,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6802721088435374 [2024-05-12 11:12:32,613 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 101 flow. Second operand 3 states and 100 transitions. [2024-05-12 11:12:32,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 60 transitions, 229 flow [2024-05-12 11:12:32,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 60 transitions, 224 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-05-12 11:12:32,620 INFO L231 Difference]: Finished difference. Result has 55 places, 49 transitions, 133 flow [2024-05-12 11:12:32,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=55, PETRI_TRANSITIONS=49} [2024-05-12 11:12:32,624 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 0 predicate places. [2024-05-12 11:12:32,624 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 133 flow [2024-05-12 11:12:32,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:12:32,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:12:32,625 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:12:32,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-12 11:12:32,625 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:12:32,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:12:32,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1643715238, now seen corresponding path program 1 times [2024-05-12 11:12:32,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:12:32,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531093934] [2024-05-12 11:12:32,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:12:32,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:12:32,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:12:36,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:12:36,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:12:36,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531093934] [2024-05-12 11:12:36,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531093934] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:12:36,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:12:36,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 11:12:36,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454506846] [2024-05-12 11:12:36,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:12:36,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 11:12:36,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:12:36,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 11:12:36,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-05-12 11:12:36,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-05-12 11:12:36,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 133 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:12:36,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:12:36,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-05-12 11:12:36,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:12:37,644 INFO L124 PetriNetUnfolderBase]: 3428/5704 cut-off events. [2024-05-12 11:12:37,644 INFO L125 PetriNetUnfolderBase]: For 819/819 co-relation queries the response was YES. [2024-05-12 11:12:37,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11916 conditions, 5704 events. 3428/5704 cut-off events. For 819/819 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 37302 event pairs, 2437 based on Foata normal form. 3/5326 useless extension candidates. Maximal degree in co-relation 11901. Up to 4908 conditions per place. [2024-05-12 11:12:37,672 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 54 selfloop transitions, 9 changer transitions 0/75 dead transitions. [2024-05-12 11:12:37,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 75 transitions, 325 flow [2024-05-12 11:12:37,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 11:12:37,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 11:12:37,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2024-05-12 11:12:37,675 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2024-05-12 11:12:37,675 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 133 flow. Second operand 4 states and 126 transitions. [2024-05-12 11:12:37,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 75 transitions, 325 flow [2024-05-12 11:12:37,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 75 transitions, 320 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 11:12:37,677 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 179 flow [2024-05-12 11:12:37,677 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:12:37,678 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 3 predicate places. [2024-05-12 11:12:37,678 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 179 flow [2024-05-12 11:12:37,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:12:37,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:12:37,678 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:12:37,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-12 11:12:37,679 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:12:37,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:12:37,679 INFO L85 PathProgramCache]: Analyzing trace with hash -584434164, now seen corresponding path program 1 times [2024-05-12 11:12:37,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:12:37,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378842924] [2024-05-12 11:12:37,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:12:37,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:12:37,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:12:41,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:12:41,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:12:41,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378842924] [2024-05-12 11:12:41,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378842924] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:12:41,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:12:41,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 11:12:41,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873545633] [2024-05-12 11:12:41,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:12:41,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 11:12:41,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:12:41,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 11:12:41,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 11:12:41,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-05-12 11:12:41,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 179 flow. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:12:41,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:12:41,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-05-12 11:12:41,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:12:42,859 INFO L124 PetriNetUnfolderBase]: 4199/6170 cut-off events. [2024-05-12 11:12:42,859 INFO L125 PetriNetUnfolderBase]: For 2366/2366 co-relation queries the response was YES. [2024-05-12 11:12:42,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15018 conditions, 6170 events. 4199/6170 cut-off events. For 2366/2366 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 35340 event pairs, 1488 based on Foata normal form. 5/5950 useless extension candidates. Maximal degree in co-relation 15001. Up to 5877 conditions per place. [2024-05-12 11:12:42,890 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 72 selfloop transitions, 21 changer transitions 0/104 dead transitions. [2024-05-12 11:12:42,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 104 transitions, 527 flow [2024-05-12 11:12:42,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 11:12:42,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 11:12:42,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions. [2024-05-12 11:12:42,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6530612244897959 [2024-05-12 11:12:42,895 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 179 flow. Second operand 5 states and 160 transitions. [2024-05-12 11:12:42,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 104 transitions, 527 flow [2024-05-12 11:12:42,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 104 transitions, 508 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-05-12 11:12:42,901 INFO L231 Difference]: Finished difference. Result has 63 places, 67 transitions, 308 flow [2024-05-12 11:12:42,901 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=308, PETRI_PLACES=63, PETRI_TRANSITIONS=67} [2024-05-12 11:12:42,902 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 8 predicate places. [2024-05-12 11:12:42,902 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 67 transitions, 308 flow [2024-05-12 11:12:42,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:12:42,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:12:42,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:12:42,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-12 11:12:42,903 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:12:42,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:12:42,904 INFO L85 PathProgramCache]: Analyzing trace with hash 999517515, now seen corresponding path program 1 times [2024-05-12 11:12:42,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:12:42,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263554211] [2024-05-12 11:12:42,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:12:42,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:12:42,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:12:46,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:12:46,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:12:46,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263554211] [2024-05-12 11:12:46,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263554211] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:12:46,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:12:46,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 11:12:46,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851834694] [2024-05-12 11:12:46,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:12:46,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 11:12:46,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:12:46,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 11:12:46,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-05-12 11:12:47,095 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-05-12 11:12:47,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 67 transitions, 308 flow. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:12:47,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:12:47,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-05-12 11:12:47,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:12:48,585 INFO L124 PetriNetUnfolderBase]: 4243/6997 cut-off events. [2024-05-12 11:12:48,585 INFO L125 PetriNetUnfolderBase]: For 6426/6429 co-relation queries the response was YES. [2024-05-12 11:12:48,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18501 conditions, 6997 events. 4243/6997 cut-off events. For 6426/6429 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 46488 event pairs, 1874 based on Foata normal form. 12/6540 useless extension candidates. Maximal degree in co-relation 18481. Up to 5853 conditions per place. [2024-05-12 11:12:48,620 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 80 selfloop transitions, 25 changer transitions 0/116 dead transitions. [2024-05-12 11:12:48,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 116 transitions, 668 flow [2024-05-12 11:12:48,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:12:48,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:12:48,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 186 transitions. [2024-05-12 11:12:48,621 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6326530612244898 [2024-05-12 11:12:48,621 INFO L175 Difference]: Start difference. First operand has 63 places, 67 transitions, 308 flow. Second operand 6 states and 186 transitions. [2024-05-12 11:12:48,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 116 transitions, 668 flow [2024-05-12 11:12:48,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 116 transitions, 656 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-05-12 11:12:48,626 INFO L231 Difference]: Finished difference. Result has 68 places, 70 transitions, 383 flow [2024-05-12 11:12:48,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=383, PETRI_PLACES=68, PETRI_TRANSITIONS=70} [2024-05-12 11:12:48,627 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 13 predicate places. [2024-05-12 11:12:48,627 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 70 transitions, 383 flow [2024-05-12 11:12:48,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:12:48,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:12:48,628 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:12:48,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-12 11:12:48,628 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:12:48,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:12:48,628 INFO L85 PathProgramCache]: Analyzing trace with hash 507402380, now seen corresponding path program 1 times [2024-05-12 11:12:48,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:12:48,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997821421] [2024-05-12 11:12:48,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:12:48,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:12:48,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:12:57,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:12:57,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:12:57,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997821421] [2024-05-12 11:12:57,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997821421] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:12:57,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:12:57,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 11:12:57,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196638373] [2024-05-12 11:12:57,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:12:57,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 11:12:57,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:12:57,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 11:12:57,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-05-12 11:12:57,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-05-12 11:12:57,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 70 transitions, 383 flow. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:12:57,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:12:57,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-05-12 11:12:57,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:12:59,124 INFO L124 PetriNetUnfolderBase]: 4248/6376 cut-off events. [2024-05-12 11:12:59,124 INFO L125 PetriNetUnfolderBase]: For 8356/8356 co-relation queries the response was YES. [2024-05-12 11:12:59,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19453 conditions, 6376 events. 4248/6376 cut-off events. For 8356/8356 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 37200 event pairs, 1370 based on Foata normal form. 2/6097 useless extension candidates. Maximal degree in co-relation 19430. Up to 6056 conditions per place. [2024-05-12 11:12:59,156 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 70 selfloop transitions, 10 changer transitions 0/91 dead transitions. [2024-05-12 11:12:59,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 91 transitions, 591 flow [2024-05-12 11:12:59,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 11:12:59,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 11:12:59,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2024-05-12 11:12:59,158 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5469387755102041 [2024-05-12 11:12:59,158 INFO L175 Difference]: Start difference. First operand has 68 places, 70 transitions, 383 flow. Second operand 5 states and 134 transitions. [2024-05-12 11:12:59,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 91 transitions, 591 flow [2024-05-12 11:12:59,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 91 transitions, 522 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-05-12 11:12:59,165 INFO L231 Difference]: Finished difference. Result has 69 places, 70 transitions, 343 flow [2024-05-12 11:12:59,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=343, PETRI_PLACES=69, PETRI_TRANSITIONS=70} [2024-05-12 11:12:59,166 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 14 predicate places. [2024-05-12 11:12:59,166 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 70 transitions, 343 flow [2024-05-12 11:12:59,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:12:59,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:12:59,166 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:12:59,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-12 11:12:59,167 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:12:59,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:12:59,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1451835918, now seen corresponding path program 1 times [2024-05-12 11:12:59,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:12:59,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679878479] [2024-05-12 11:12:59,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:12:59,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:12:59,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:13:08,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:13:08,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:13:08,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679878479] [2024-05-12 11:13:08,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679878479] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:13:08,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:13:08,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:13:08,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000005255] [2024-05-12 11:13:08,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:13:08,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:13:08,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:13:08,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:13:08,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:13:08,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-05-12 11:13:08,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 70 transitions, 343 flow. Second operand has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:13:08,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:13:08,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-05-12 11:13:08,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:13:10,045 INFO L124 PetriNetUnfolderBase]: 4236/6395 cut-off events. [2024-05-12 11:13:10,045 INFO L125 PetriNetUnfolderBase]: For 8823/8823 co-relation queries the response was YES. [2024-05-12 11:13:10,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19145 conditions, 6395 events. 4236/6395 cut-off events. For 8823/8823 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 37084 event pairs, 1266 based on Foata normal form. 4/6132 useless extension candidates. Maximal degree in co-relation 19120. Up to 6002 conditions per place. [2024-05-12 11:13:10,077 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 80 selfloop transitions, 14 changer transitions 0/105 dead transitions. [2024-05-12 11:13:10,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 105 transitions, 629 flow [2024-05-12 11:13:10,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:13:10,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:13:10,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 162 transitions. [2024-05-12 11:13:10,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5510204081632653 [2024-05-12 11:13:10,079 INFO L175 Difference]: Start difference. First operand has 69 places, 70 transitions, 343 flow. Second operand 6 states and 162 transitions. [2024-05-12 11:13:10,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 105 transitions, 629 flow [2024-05-12 11:13:10,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 105 transitions, 600 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-05-12 11:13:10,087 INFO L231 Difference]: Finished difference. Result has 71 places, 74 transitions, 387 flow [2024-05-12 11:13:10,087 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=387, PETRI_PLACES=71, PETRI_TRANSITIONS=74} [2024-05-12 11:13:10,087 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 16 predicate places. [2024-05-12 11:13:10,087 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 74 transitions, 387 flow [2024-05-12 11:13:10,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:13:10,088 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:13:10,088 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:13:10,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-12 11:13:10,088 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:13:10,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:13:10,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1496118617, now seen corresponding path program 1 times [2024-05-12 11:13:10,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:13:10,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276139575] [2024-05-12 11:13:10,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:13:10,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:13:10,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:13:10,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:13:10,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:13:10,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276139575] [2024-05-12 11:13:10,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276139575] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:13:10,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:13:10,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 11:13:10,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850979286] [2024-05-12 11:13:10,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:13:10,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 11:13:10,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:13:10,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 11:13:10,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 11:13:10,295 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 49 [2024-05-12 11:13:10,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 74 transitions, 387 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:13:10,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:13:10,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 49 [2024-05-12 11:13:10,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:13:10,798 INFO L124 PetriNetUnfolderBase]: 1259/2533 cut-off events. [2024-05-12 11:13:10,798 INFO L125 PetriNetUnfolderBase]: For 3724/3989 co-relation queries the response was YES. [2024-05-12 11:13:10,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6305 conditions, 2533 events. 1259/2533 cut-off events. For 3724/3989 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 19024 event pairs, 225 based on Foata normal form. 7/2337 useless extension candidates. Maximal degree in co-relation 6280. Up to 1528 conditions per place. [2024-05-12 11:13:10,813 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 28 selfloop transitions, 9 changer transitions 0/74 dead transitions. [2024-05-12 11:13:10,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 74 transitions, 411 flow [2024-05-12 11:13:10,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 11:13:10,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 11:13:10,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2024-05-12 11:13:10,814 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7210884353741497 [2024-05-12 11:13:10,815 INFO L175 Difference]: Start difference. First operand has 71 places, 74 transitions, 387 flow. Second operand 3 states and 106 transitions. [2024-05-12 11:13:10,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 74 transitions, 411 flow [2024-05-12 11:13:10,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 74 transitions, 381 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-05-12 11:13:10,818 INFO L231 Difference]: Finished difference. Result has 68 places, 66 transitions, 309 flow [2024-05-12 11:13:10,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=309, PETRI_PLACES=68, PETRI_TRANSITIONS=66} [2024-05-12 11:13:10,819 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 13 predicate places. [2024-05-12 11:13:10,819 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 66 transitions, 309 flow [2024-05-12 11:13:10,819 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:13:10,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:13:10,819 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:13:10,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-12 11:13:10,820 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:13:10,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:13:10,820 INFO L85 PathProgramCache]: Analyzing trace with hash 28412011, now seen corresponding path program 1 times [2024-05-12 11:13:10,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:13:10,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958643238] [2024-05-12 11:13:10,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:13:10,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:13:10,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:13:18,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:13:18,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:13:18,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958643238] [2024-05-12 11:13:18,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958643238] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:13:18,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:13:18,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:13:18,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989479725] [2024-05-12 11:13:18,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:13:18,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:13:18,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:13:18,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:13:18,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:13:18,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:13:18,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 66 transitions, 309 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:13:18,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:13:18,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:13:18,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:13:20,243 INFO L124 PetriNetUnfolderBase]: 4404/6442 cut-off events. [2024-05-12 11:13:20,243 INFO L125 PetriNetUnfolderBase]: For 13817/13823 co-relation queries the response was YES. [2024-05-12 11:13:20,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20235 conditions, 6442 events. 4404/6442 cut-off events. For 13817/13823 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 35635 event pairs, 1320 based on Foata normal form. 8/6440 useless extension candidates. Maximal degree in co-relation 20211. Up to 6043 conditions per place. [2024-05-12 11:13:20,306 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 82 selfloop transitions, 30 changer transitions 5/127 dead transitions. [2024-05-12 11:13:20,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 127 transitions, 789 flow [2024-05-12 11:13:20,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:13:20,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:13:20,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 190 transitions. [2024-05-12 11:13:20,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5539358600583091 [2024-05-12 11:13:20,308 INFO L175 Difference]: Start difference. First operand has 68 places, 66 transitions, 309 flow. Second operand 7 states and 190 transitions. [2024-05-12 11:13:20,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 127 transitions, 789 flow [2024-05-12 11:13:20,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 127 transitions, 763 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 11:13:20,317 INFO L231 Difference]: Finished difference. Result has 75 places, 81 transitions, 482 flow [2024-05-12 11:13:20,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=482, PETRI_PLACES=75, PETRI_TRANSITIONS=81} [2024-05-12 11:13:20,317 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 20 predicate places. [2024-05-12 11:13:20,318 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 81 transitions, 482 flow [2024-05-12 11:13:20,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:13:20,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:13:20,318 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:13:20,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-12 11:13:20,318 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:13:20,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:13:20,319 INFO L85 PathProgramCache]: Analyzing trace with hash 874430089, now seen corresponding path program 2 times [2024-05-12 11:13:20,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:13:20,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961833535] [2024-05-12 11:13:20,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:13:20,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:13:20,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:13:29,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:13:29,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:13:29,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961833535] [2024-05-12 11:13:29,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961833535] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:13:29,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:13:29,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:13:29,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380190241] [2024-05-12 11:13:29,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:13:29,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:13:29,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:13:29,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:13:29,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:13:29,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:13:29,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 81 transitions, 482 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:13:29,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:13:29,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:13:29,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:13:31,306 INFO L124 PetriNetUnfolderBase]: 3886/5708 cut-off events. [2024-05-12 11:13:31,307 INFO L125 PetriNetUnfolderBase]: For 14126/14128 co-relation queries the response was YES. [2024-05-12 11:13:31,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19033 conditions, 5708 events. 3886/5708 cut-off events. For 14126/14128 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 31214 event pairs, 1190 based on Foata normal form. 6/5705 useless extension candidates. Maximal degree in co-relation 19005. Up to 5317 conditions per place. [2024-05-12 11:13:31,371 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 82 selfloop transitions, 35 changer transitions 0/127 dead transitions. [2024-05-12 11:13:31,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 127 transitions, 914 flow [2024-05-12 11:13:31,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:13:31,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:13:31,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 180 transitions. [2024-05-12 11:13:31,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5247813411078717 [2024-05-12 11:13:31,373 INFO L175 Difference]: Start difference. First operand has 75 places, 81 transitions, 482 flow. Second operand 7 states and 180 transitions. [2024-05-12 11:13:31,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 127 transitions, 914 flow [2024-05-12 11:13:31,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 127 transitions, 875 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-05-12 11:13:31,385 INFO L231 Difference]: Finished difference. Result has 78 places, 86 transitions, 584 flow [2024-05-12 11:13:31,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=584, PETRI_PLACES=78, PETRI_TRANSITIONS=86} [2024-05-12 11:13:31,386 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 23 predicate places. [2024-05-12 11:13:31,386 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 86 transitions, 584 flow [2024-05-12 11:13:31,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:13:31,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:13:31,387 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:13:31,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-12 11:13:31,388 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:13:31,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:13:31,389 INFO L85 PathProgramCache]: Analyzing trace with hash -2057247417, now seen corresponding path program 3 times [2024-05-12 11:13:31,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:13:31,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489672021] [2024-05-12 11:13:31,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:13:31,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:13:31,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:13:40,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:13:40,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:13:40,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489672021] [2024-05-12 11:13:40,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489672021] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:13:40,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:13:40,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:13:40,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815526098] [2024-05-12 11:13:40,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:13:40,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:13:40,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:13:40,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:13:40,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:13:40,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:13:40,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 86 transitions, 584 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:13:40,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:13:40,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:13:40,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:13:42,543 INFO L124 PetriNetUnfolderBase]: 3869/5678 cut-off events. [2024-05-12 11:13:42,544 INFO L125 PetriNetUnfolderBase]: For 16280/16282 co-relation queries the response was YES. [2024-05-12 11:13:42,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19309 conditions, 5678 events. 3869/5678 cut-off events. For 16280/16282 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 30977 event pairs, 1190 based on Foata normal form. 3/5672 useless extension candidates. Maximal degree in co-relation 19280. Up to 5296 conditions per place. [2024-05-12 11:13:42,573 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 80 selfloop transitions, 36 changer transitions 0/126 dead transitions. [2024-05-12 11:13:42,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 126 transitions, 940 flow [2024-05-12 11:13:42,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:13:42,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:13:42,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 179 transitions. [2024-05-12 11:13:42,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.521865889212828 [2024-05-12 11:13:42,578 INFO L175 Difference]: Start difference. First operand has 78 places, 86 transitions, 584 flow. Second operand 7 states and 179 transitions. [2024-05-12 11:13:42,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 126 transitions, 940 flow [2024-05-12 11:13:42,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 126 transitions, 885 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-05-12 11:13:42,607 INFO L231 Difference]: Finished difference. Result has 81 places, 86 transitions, 611 flow [2024-05-12 11:13:42,608 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=611, PETRI_PLACES=81, PETRI_TRANSITIONS=86} [2024-05-12 11:13:42,609 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 26 predicate places. [2024-05-12 11:13:42,609 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 86 transitions, 611 flow [2024-05-12 11:13:42,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:13:42,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:13:42,609 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:13:42,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-05-12 11:13:42,610 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:13:42,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:13:42,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1337529969, now seen corresponding path program 1 times [2024-05-12 11:13:42,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:13:42,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307641514] [2024-05-12 11:13:42,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:13:42,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:13:42,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:13:53,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:13:53,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:13:53,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307641514] [2024-05-12 11:13:53,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307641514] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:13:53,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:13:53,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:13:53,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349415267] [2024-05-12 11:13:53,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:13:53,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:13:53,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:13:53,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:13:53,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:13:53,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:13:53,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 86 transitions, 611 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:13:53,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:13:53,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:13:53,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:13:55,423 INFO L124 PetriNetUnfolderBase]: 3961/5815 cut-off events. [2024-05-12 11:13:55,424 INFO L125 PetriNetUnfolderBase]: For 17226/17228 co-relation queries the response was YES. [2024-05-12 11:13:55,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19833 conditions, 5815 events. 3961/5815 cut-off events. For 17226/17228 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 31839 event pairs, 970 based on Foata normal form. 8/5814 useless extension candidates. Maximal degree in co-relation 19803. Up to 5136 conditions per place. [2024-05-12 11:13:55,449 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 96 selfloop transitions, 40 changer transitions 0/146 dead transitions. [2024-05-12 11:13:55,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 146 transitions, 1115 flow [2024-05-12 11:13:55,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:13:55,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:13:55,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 210 transitions. [2024-05-12 11:13:55,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2024-05-12 11:13:55,451 INFO L175 Difference]: Start difference. First operand has 81 places, 86 transitions, 611 flow. Second operand 8 states and 210 transitions. [2024-05-12 11:13:55,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 146 transitions, 1115 flow [2024-05-12 11:13:55,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 146 transitions, 998 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-05-12 11:13:55,465 INFO L231 Difference]: Finished difference. Result has 82 places, 93 transitions, 639 flow [2024-05-12 11:13:55,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=639, PETRI_PLACES=82, PETRI_TRANSITIONS=93} [2024-05-12 11:13:55,465 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 27 predicate places. [2024-05-12 11:13:55,466 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 93 transitions, 639 flow [2024-05-12 11:13:55,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:13:55,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:13:55,466 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:13:55,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-05-12 11:13:55,466 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:13:55,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:13:55,467 INFO L85 PathProgramCache]: Analyzing trace with hash 650077649, now seen corresponding path program 2 times [2024-05-12 11:13:55,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:13:55,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751993311] [2024-05-12 11:13:55,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:13:55,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:13:55,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:14:04,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:14:04,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:14:04,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751993311] [2024-05-12 11:14:04,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751993311] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:14:04,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:14:04,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:14:04,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799614093] [2024-05-12 11:14:04,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:14:04,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:14:04,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:14:04,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:14:04,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:14:04,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:14:04,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 93 transitions, 639 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:14:04,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:14:04,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:14:04,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:14:06,664 INFO L124 PetriNetUnfolderBase]: 4007/5888 cut-off events. [2024-05-12 11:14:06,664 INFO L125 PetriNetUnfolderBase]: For 20699/20701 co-relation queries the response was YES. [2024-05-12 11:14:06,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21345 conditions, 5888 events. 4007/5888 cut-off events. For 20699/20701 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 32226 event pairs, 972 based on Foata normal form. 4/5883 useless extension candidates. Maximal degree in co-relation 21314. Up to 5157 conditions per place. [2024-05-12 11:14:06,699 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 110 selfloop transitions, 50 changer transitions 0/170 dead transitions. [2024-05-12 11:14:06,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 170 transitions, 1285 flow [2024-05-12 11:14:06,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:14:06,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:14:06,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 260 transitions. [2024-05-12 11:14:06,702 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5306122448979592 [2024-05-12 11:14:06,702 INFO L175 Difference]: Start difference. First operand has 82 places, 93 transitions, 639 flow. Second operand 10 states and 260 transitions. [2024-05-12 11:14:06,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 170 transitions, 1285 flow [2024-05-12 11:14:06,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 170 transitions, 1240 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-05-12 11:14:06,729 INFO L231 Difference]: Finished difference. Result has 88 places, 99 transitions, 760 flow [2024-05-12 11:14:06,729 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=760, PETRI_PLACES=88, PETRI_TRANSITIONS=99} [2024-05-12 11:14:06,730 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 33 predicate places. [2024-05-12 11:14:06,730 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 99 transitions, 760 flow [2024-05-12 11:14:06,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:14:06,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:14:06,731 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:14:06,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-05-12 11:14:06,731 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:14:06,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:14:06,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1514661489, now seen corresponding path program 3 times [2024-05-12 11:14:06,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:14:06,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873950281] [2024-05-12 11:14:06,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:14:06,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:14:06,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:14:14,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:14:14,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:14:14,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873950281] [2024-05-12 11:14:14,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873950281] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:14:14,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:14:14,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:14:14,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370839500] [2024-05-12 11:14:14,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:14:14,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:14:14,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:14:14,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:14:14,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:14:14,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:14:14,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 99 transitions, 760 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:14:14,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:14:14,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:14:14,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:14:16,878 INFO L124 PetriNetUnfolderBase]: 3997/5874 cut-off events. [2024-05-12 11:14:16,879 INFO L125 PetriNetUnfolderBase]: For 24240/24242 co-relation queries the response was YES. [2024-05-12 11:14:16,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22132 conditions, 5874 events. 3997/5874 cut-off events. For 24240/24242 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 32127 event pairs, 970 based on Foata normal form. 4/5869 useless extension candidates. Maximal degree in co-relation 22099. Up to 5153 conditions per place. [2024-05-12 11:14:16,912 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 107 selfloop transitions, 46 changer transitions 0/163 dead transitions. [2024-05-12 11:14:16,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 163 transitions, 1292 flow [2024-05-12 11:14:16,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:14:16,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:14:16,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 237 transitions. [2024-05-12 11:14:16,914 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5374149659863946 [2024-05-12 11:14:16,914 INFO L175 Difference]: Start difference. First operand has 88 places, 99 transitions, 760 flow. Second operand 9 states and 237 transitions. [2024-05-12 11:14:16,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 163 transitions, 1292 flow [2024-05-12 11:14:16,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 163 transitions, 1198 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-05-12 11:14:16,941 INFO L231 Difference]: Finished difference. Result has 91 places, 99 transitions, 767 flow [2024-05-12 11:14:16,941 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=767, PETRI_PLACES=91, PETRI_TRANSITIONS=99} [2024-05-12 11:14:16,942 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 36 predicate places. [2024-05-12 11:14:16,942 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 99 transitions, 767 flow [2024-05-12 11:14:16,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:14:16,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:14:16,942 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:14:16,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-05-12 11:14:16,943 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:14:16,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:14:16,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1042932733, now seen corresponding path program 1 times [2024-05-12 11:14:16,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:14:16,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847109042] [2024-05-12 11:14:16,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:14:16,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:14:16,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:14:26,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:14:26,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:14:26,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847109042] [2024-05-12 11:14:26,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847109042] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:14:26,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:14:26,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 11:14:26,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008626830] [2024-05-12 11:14:26,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:14:26,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 11:14:26,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:14:26,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 11:14:26,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-05-12 11:14:26,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-05-12 11:14:26,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 99 transitions, 767 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:14:26,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:14:26,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-05-12 11:14:26,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:14:28,430 INFO L124 PetriNetUnfolderBase]: 3253/5452 cut-off events. [2024-05-12 11:14:28,430 INFO L125 PetriNetUnfolderBase]: For 22864/22876 co-relation queries the response was YES. [2024-05-12 11:14:28,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19210 conditions, 5452 events. 3253/5452 cut-off events. For 22864/22876 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 35264 event pairs, 1248 based on Foata normal form. 3/5344 useless extension candidates. Maximal degree in co-relation 19176. Up to 4642 conditions per place. [2024-05-12 11:14:28,513 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 90 selfloop transitions, 9 changer transitions 0/120 dead transitions. [2024-05-12 11:14:28,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 120 transitions, 1058 flow [2024-05-12 11:14:28,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 11:14:28,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 11:14:28,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2024-05-12 11:14:28,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5183673469387755 [2024-05-12 11:14:28,515 INFO L175 Difference]: Start difference. First operand has 91 places, 99 transitions, 767 flow. Second operand 5 states and 127 transitions. [2024-05-12 11:14:28,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 120 transitions, 1058 flow [2024-05-12 11:14:28,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 120 transitions, 925 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-05-12 11:14:28,535 INFO L231 Difference]: Finished difference. Result has 88 places, 106 transitions, 730 flow [2024-05-12 11:14:28,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=641, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=730, PETRI_PLACES=88, PETRI_TRANSITIONS=106} [2024-05-12 11:14:28,537 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 33 predicate places. [2024-05-12 11:14:28,537 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 106 transitions, 730 flow [2024-05-12 11:14:28,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:14:28,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:14:28,537 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:14:28,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-05-12 11:14:28,537 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:14:28,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:14:28,538 INFO L85 PathProgramCache]: Analyzing trace with hash 702095127, now seen corresponding path program 1 times [2024-05-12 11:14:28,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:14:28,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235525513] [2024-05-12 11:14:28,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:14:28,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:14:28,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:14:39,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:14:39,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:14:39,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235525513] [2024-05-12 11:14:39,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235525513] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:14:39,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:14:39,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:14:39,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781321784] [2024-05-12 11:14:39,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:14:39,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:14:39,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:14:39,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:14:39,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:14:39,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:14:39,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 106 transitions, 730 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:14:39,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:14:39,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:14:39,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:14:41,537 INFO L124 PetriNetUnfolderBase]: 4045/6627 cut-off events. [2024-05-12 11:14:41,537 INFO L125 PetriNetUnfolderBase]: For 28253/28259 co-relation queries the response was YES. [2024-05-12 11:14:41,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23641 conditions, 6627 events. 4045/6627 cut-off events. For 28253/28259 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 41758 event pairs, 1172 based on Foata normal form. 10/6412 useless extension candidates. Maximal degree in co-relation 23605. Up to 5195 conditions per place. [2024-05-12 11:14:41,574 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 103 selfloop transitions, 51 changer transitions 0/164 dead transitions. [2024-05-12 11:14:41,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 164 transitions, 1281 flow [2024-05-12 11:14:41,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:14:41,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:14:41,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 214 transitions. [2024-05-12 11:14:41,576 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5459183673469388 [2024-05-12 11:14:41,576 INFO L175 Difference]: Start difference. First operand has 88 places, 106 transitions, 730 flow. Second operand 8 states and 214 transitions. [2024-05-12 11:14:41,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 164 transitions, 1281 flow [2024-05-12 11:14:41,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 164 transitions, 1258 flow, removed 7 selfloop flow, removed 2 redundant places. [2024-05-12 11:14:41,601 INFO L231 Difference]: Finished difference. Result has 94 places, 109 transitions, 847 flow [2024-05-12 11:14:41,601 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=847, PETRI_PLACES=94, PETRI_TRANSITIONS=109} [2024-05-12 11:14:41,601 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 39 predicate places. [2024-05-12 11:14:41,601 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 109 transitions, 847 flow [2024-05-12 11:14:41,602 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:14:41,602 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:14:41,602 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:14:41,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-05-12 11:14:41,602 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:14:41,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:14:41,603 INFO L85 PathProgramCache]: Analyzing trace with hash 702100707, now seen corresponding path program 2 times [2024-05-12 11:14:41,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:14:41,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728335582] [2024-05-12 11:14:41,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:14:41,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:14:41,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:14:52,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:14:52,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:14:52,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728335582] [2024-05-12 11:14:52,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728335582] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:14:52,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:14:52,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:14:52,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332342365] [2024-05-12 11:14:52,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:14:52,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:14:52,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:14:52,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:14:52,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:14:52,895 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:14:52,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 109 transitions, 847 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:14:52,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:14:52,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:14:52,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:14:55,103 INFO L124 PetriNetUnfolderBase]: 4091/6687 cut-off events. [2024-05-12 11:14:55,104 INFO L125 PetriNetUnfolderBase]: For 32392/32394 co-relation queries the response was YES. [2024-05-12 11:14:55,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24728 conditions, 6687 events. 4091/6687 cut-off events. For 32392/32394 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 42026 event pairs, 1186 based on Foata normal form. 4/6468 useless extension candidates. Maximal degree in co-relation 24690. Up to 5234 conditions per place. [2024-05-12 11:14:55,148 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 109 selfloop transitions, 53 changer transitions 0/172 dead transitions. [2024-05-12 11:14:55,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 172 transitions, 1436 flow [2024-05-12 11:14:55,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:14:55,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:14:55,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 235 transitions. [2024-05-12 11:14:55,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5328798185941043 [2024-05-12 11:14:55,150 INFO L175 Difference]: Start difference. First operand has 94 places, 109 transitions, 847 flow. Second operand 9 states and 235 transitions. [2024-05-12 11:14:55,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 172 transitions, 1436 flow [2024-05-12 11:14:55,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 172 transitions, 1313 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-05-12 11:14:55,187 INFO L231 Difference]: Finished difference. Result has 97 places, 112 transitions, 873 flow [2024-05-12 11:14:55,187 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=873, PETRI_PLACES=97, PETRI_TRANSITIONS=112} [2024-05-12 11:14:55,188 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 42 predicate places. [2024-05-12 11:14:55,188 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 112 transitions, 873 flow [2024-05-12 11:14:55,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:14:55,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:14:55,188 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:14:55,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-05-12 11:14:55,188 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:14:55,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:14:55,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1329780211, now seen corresponding path program 3 times [2024-05-12 11:14:55,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:14:55,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724204526] [2024-05-12 11:14:55,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:14:55,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:14:55,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:15:06,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:15:06,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:15:06,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724204526] [2024-05-12 11:15:06,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724204526] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:15:06,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:15:06,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:15:06,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532598838] [2024-05-12 11:15:06,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:15:06,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:15:06,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:15:06,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:15:06,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:15:06,183 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:15:06,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 112 transitions, 873 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:15:06,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:15:06,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:15:06,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:15:08,485 INFO L124 PetriNetUnfolderBase]: 4137/6255 cut-off events. [2024-05-12 11:15:08,485 INFO L125 PetriNetUnfolderBase]: For 35438/35440 co-relation queries the response was YES. [2024-05-12 11:15:08,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24746 conditions, 6255 events. 4137/6255 cut-off events. For 35438/35440 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 35882 event pairs, 1073 based on Foata normal form. 4/6186 useless extension candidates. Maximal degree in co-relation 24707. Up to 5273 conditions per place. [2024-05-12 11:15:08,522 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 103 selfloop transitions, 56 changer transitions 0/169 dead transitions. [2024-05-12 11:15:08,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 169 transitions, 1448 flow [2024-05-12 11:15:08,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:15:08,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:15:08,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 211 transitions. [2024-05-12 11:15:08,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5382653061224489 [2024-05-12 11:15:08,526 INFO L175 Difference]: Start difference. First operand has 97 places, 112 transitions, 873 flow. Second operand 8 states and 211 transitions. [2024-05-12 11:15:08,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 169 transitions, 1448 flow [2024-05-12 11:15:08,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 169 transitions, 1357 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-05-12 11:15:08,557 INFO L231 Difference]: Finished difference. Result has 99 places, 115 transitions, 937 flow [2024-05-12 11:15:08,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=785, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=937, PETRI_PLACES=99, PETRI_TRANSITIONS=115} [2024-05-12 11:15:08,563 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 44 predicate places. [2024-05-12 11:15:08,563 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 115 transitions, 937 flow [2024-05-12 11:15:08,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:15:08,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:15:08,563 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:15:08,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-05-12 11:15:08,564 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:15:08,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:15:08,564 INFO L85 PathProgramCache]: Analyzing trace with hash 124352869, now seen corresponding path program 4 times [2024-05-12 11:15:08,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:15:08,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622899730] [2024-05-12 11:15:08,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:15:08,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:15:08,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:15:19,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:15:19,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:15:19,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622899730] [2024-05-12 11:15:19,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622899730] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:15:19,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:15:19,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:15:19,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378351588] [2024-05-12 11:15:19,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:15:19,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:15:19,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:15:19,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:15:19,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:15:20,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:15:20,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 115 transitions, 937 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:15:20,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:15:20,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:15:20,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:15:22,362 INFO L124 PetriNetUnfolderBase]: 4127/6741 cut-off events. [2024-05-12 11:15:22,362 INFO L125 PetriNetUnfolderBase]: For 38682/38684 co-relation queries the response was YES. [2024-05-12 11:15:22,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25376 conditions, 6741 events. 4127/6741 cut-off events. For 38682/38684 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 42339 event pairs, 1167 based on Foata normal form. 4/6526 useless extension candidates. Maximal degree in co-relation 25336. Up to 5265 conditions per place. [2024-05-12 11:15:22,403 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 111 selfloop transitions, 61 changer transitions 0/182 dead transitions. [2024-05-12 11:15:22,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 182 transitions, 1483 flow [2024-05-12 11:15:22,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:15:22,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:15:22,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 259 transitions. [2024-05-12 11:15:22,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5285714285714286 [2024-05-12 11:15:22,413 INFO L175 Difference]: Start difference. First operand has 99 places, 115 transitions, 937 flow. Second operand 10 states and 259 transitions. [2024-05-12 11:15:22,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 182 transitions, 1483 flow [2024-05-12 11:15:22,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 182 transitions, 1380 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-05-12 11:15:22,451 INFO L231 Difference]: Finished difference. Result has 104 places, 115 transitions, 964 flow [2024-05-12 11:15:22,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=964, PETRI_PLACES=104, PETRI_TRANSITIONS=115} [2024-05-12 11:15:22,452 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 49 predicate places. [2024-05-12 11:15:22,452 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 115 transitions, 964 flow [2024-05-12 11:15:22,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:15:22,452 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:15:22,452 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:15:22,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-05-12 11:15:22,453 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:15:22,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:15:22,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1322151514, now seen corresponding path program 1 times [2024-05-12 11:15:22,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:15:22,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089464495] [2024-05-12 11:15:22,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:15:22,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:15:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:15:30,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:15:30,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:15:30,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089464495] [2024-05-12 11:15:30,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089464495] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:15:30,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:15:30,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:15:30,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947182851] [2024-05-12 11:15:30,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:15:30,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:15:30,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:15:30,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:15:30,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:15:31,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-05-12 11:15:31,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 115 transitions, 964 flow. Second operand has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:15:31,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:15:31,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-05-12 11:15:31,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:15:33,198 INFO L124 PetriNetUnfolderBase]: 3596/5925 cut-off events. [2024-05-12 11:15:33,199 INFO L125 PetriNetUnfolderBase]: For 37089/37091 co-relation queries the response was YES. [2024-05-12 11:15:33,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22757 conditions, 5925 events. 3596/5925 cut-off events. For 37089/37091 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 37638 event pairs, 1246 based on Foata normal form. 4/5813 useless extension candidates. Maximal degree in co-relation 22715. Up to 5076 conditions per place. [2024-05-12 11:15:33,229 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 133 selfloop transitions, 19 changer transitions 0/163 dead transitions. [2024-05-12 11:15:33,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 163 transitions, 1439 flow [2024-05-12 11:15:33,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:15:33,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:15:33,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 203 transitions. [2024-05-12 11:15:33,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5178571428571429 [2024-05-12 11:15:33,230 INFO L175 Difference]: Start difference. First operand has 104 places, 115 transitions, 964 flow. Second operand 8 states and 203 transitions. [2024-05-12 11:15:33,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 163 transitions, 1439 flow [2024-05-12 11:15:33,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 163 transitions, 1228 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-05-12 11:15:33,253 INFO L231 Difference]: Finished difference. Result has 102 places, 120 transitions, 851 flow [2024-05-12 11:15:33,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=851, PETRI_PLACES=102, PETRI_TRANSITIONS=120} [2024-05-12 11:15:33,254 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 47 predicate places. [2024-05-12 11:15:33,254 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 120 transitions, 851 flow [2024-05-12 11:15:33,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:15:33,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:15:33,254 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:15:33,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-05-12 11:15:33,255 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:15:33,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:15:33,255 INFO L85 PathProgramCache]: Analyzing trace with hash -2028821811, now seen corresponding path program 1 times [2024-05-12 11:15:33,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:15:33,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243131858] [2024-05-12 11:15:33,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:15:33,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:15:33,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:15:44,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:15:44,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:15:44,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243131858] [2024-05-12 11:15:44,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243131858] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:15:44,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:15:44,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:15:44,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649295525] [2024-05-12 11:15:44,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:15:44,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:15:44,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:15:44,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:15:44,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:15:44,458 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-05-12 11:15:44,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 120 transitions, 851 flow. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 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 11:15:44,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:15:44,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-05-12 11:15:44,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:15:46,140 INFO L124 PetriNetUnfolderBase]: 3372/5620 cut-off events. [2024-05-12 11:15:46,140 INFO L125 PetriNetUnfolderBase]: For 36885/36899 co-relation queries the response was YES. [2024-05-12 11:15:46,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21621 conditions, 5620 events. 3372/5620 cut-off events. For 36885/36899 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 36134 event pairs, 1224 based on Foata normal form. 6/5524 useless extension candidates. Maximal degree in co-relation 21578. Up to 4785 conditions per place. [2024-05-12 11:15:46,172 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 110 selfloop transitions, 12 changer transitions 0/143 dead transitions. [2024-05-12 11:15:46,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 143 transitions, 1179 flow [2024-05-12 11:15:46,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:15:46,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:15:46,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2024-05-12 11:15:46,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5136054421768708 [2024-05-12 11:15:46,174 INFO L175 Difference]: Start difference. First operand has 102 places, 120 transitions, 851 flow. Second operand 6 states and 151 transitions. [2024-05-12 11:15:46,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 143 transitions, 1179 flow [2024-05-12 11:15:46,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 143 transitions, 1126 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-05-12 11:15:46,204 INFO L231 Difference]: Finished difference. Result has 103 places, 123 transitions, 860 flow [2024-05-12 11:15:46,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=860, PETRI_PLACES=103, PETRI_TRANSITIONS=123} [2024-05-12 11:15:46,204 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 48 predicate places. [2024-05-12 11:15:46,205 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 123 transitions, 860 flow [2024-05-12 11:15:46,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 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 11:15:46,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:15:46,205 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:15:46,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-05-12 11:15:46,206 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:15:46,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:15:46,206 INFO L85 PathProgramCache]: Analyzing trace with hash -219544450, now seen corresponding path program 1 times [2024-05-12 11:15:46,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:15:46,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052920685] [2024-05-12 11:15:46,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:15:46,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:15:46,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:15:57,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:15:57,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:15:57,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052920685] [2024-05-12 11:15:57,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052920685] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:15:57,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:15:57,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:15:57,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46429869] [2024-05-12 11:15:57,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:15:57,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:15:57,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:15:57,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:15:57,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:15:57,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:15:57,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 123 transitions, 860 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:15:57,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:15:57,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:15:57,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:15:59,521 INFO L124 PetriNetUnfolderBase]: 4162/6609 cut-off events. [2024-05-12 11:15:59,521 INFO L125 PetriNetUnfolderBase]: For 48162/48164 co-relation queries the response was YES. [2024-05-12 11:15:59,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26352 conditions, 6609 events. 4162/6609 cut-off events. For 48162/48164 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 40580 event pairs, 903 based on Foata normal form. 4/6456 useless extension candidates. Maximal degree in co-relation 26308. Up to 5509 conditions per place. [2024-05-12 11:15:59,560 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 126 selfloop transitions, 39 changer transitions 0/175 dead transitions. [2024-05-12 11:15:59,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 175 transitions, 1442 flow [2024-05-12 11:15:59,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:15:59,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:15:59,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 204 transitions. [2024-05-12 11:15:59,564 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5204081632653061 [2024-05-12 11:15:59,564 INFO L175 Difference]: Start difference. First operand has 103 places, 123 transitions, 860 flow. Second operand 8 states and 204 transitions. [2024-05-12 11:15:59,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 175 transitions, 1442 flow [2024-05-12 11:15:59,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 175 transitions, 1402 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-05-12 11:15:59,605 INFO L231 Difference]: Finished difference. Result has 107 places, 127 transitions, 953 flow [2024-05-12 11:15:59,614 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=820, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=953, PETRI_PLACES=107, PETRI_TRANSITIONS=127} [2024-05-12 11:15:59,614 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 52 predicate places. [2024-05-12 11:15:59,614 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 127 transitions, 953 flow [2024-05-12 11:15:59,614 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:15:59,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:15:59,615 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:15:59,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-05-12 11:15:59,615 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:15:59,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:15:59,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1055635412, now seen corresponding path program 2 times [2024-05-12 11:15:59,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:15:59,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948645005] [2024-05-12 11:15:59,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:15:59,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:15:59,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:16:10,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:16:10,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:16:10,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948645005] [2024-05-12 11:16:10,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948645005] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:16:10,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:16:10,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:16:10,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794720137] [2024-05-12 11:16:10,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:16:10,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:16:10,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:16:10,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:16:10,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:16:10,984 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:16:10,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 127 transitions, 953 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:16:10,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:16:10,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:16:10,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:16:13,167 INFO L124 PetriNetUnfolderBase]: 4154/6596 cut-off events. [2024-05-12 11:16:13,167 INFO L125 PetriNetUnfolderBase]: For 52274/52276 co-relation queries the response was YES. [2024-05-12 11:16:13,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26910 conditions, 6596 events. 4154/6596 cut-off events. For 52274/52276 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 40466 event pairs, 1193 based on Foata normal form. 4/6441 useless extension candidates. Maximal degree in co-relation 26865. Up to 5645 conditions per place. [2024-05-12 11:16:13,207 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 124 selfloop transitions, 40 changer transitions 0/174 dead transitions. [2024-05-12 11:16:13,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 174 transitions, 1427 flow [2024-05-12 11:16:13,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:16:13,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:16:13,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 202 transitions. [2024-05-12 11:16:13,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5153061224489796 [2024-05-12 11:16:13,208 INFO L175 Difference]: Start difference. First operand has 107 places, 127 transitions, 953 flow. Second operand 8 states and 202 transitions. [2024-05-12 11:16:13,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 174 transitions, 1427 flow [2024-05-12 11:16:13,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 174 transitions, 1357 flow, removed 16 selfloop flow, removed 4 redundant places. [2024-05-12 11:16:13,254 INFO L231 Difference]: Finished difference. Result has 111 places, 127 transitions, 972 flow [2024-05-12 11:16:13,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=883, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=972, PETRI_PLACES=111, PETRI_TRANSITIONS=127} [2024-05-12 11:16:13,255 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 56 predicate places. [2024-05-12 11:16:13,255 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 127 transitions, 972 flow [2024-05-12 11:16:13,255 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:16:13,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:16:13,255 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:16:13,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-05-12 11:16:13,257 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:16:13,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:16:13,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1221869414, now seen corresponding path program 1 times [2024-05-12 11:16:13,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:16:13,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267941601] [2024-05-12 11:16:13,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:16:13,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:16:13,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:16:23,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:16:23,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:16:23,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267941601] [2024-05-12 11:16:23,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267941601] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:16:23,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:16:23,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:16:23,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68592752] [2024-05-12 11:16:23,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:16:23,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:16:23,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:16:23,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:16:23,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:16:23,450 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-05-12 11:16:23,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 127 transitions, 972 flow. Second operand has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:16:23,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:16:23,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-05-12 11:16:23,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:16:25,306 INFO L124 PetriNetUnfolderBase]: 3910/6341 cut-off events. [2024-05-12 11:16:25,306 INFO L125 PetriNetUnfolderBase]: For 55049/55059 co-relation queries the response was YES. [2024-05-12 11:16:25,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25938 conditions, 6341 events. 3910/6341 cut-off events. For 55049/55059 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 40204 event pairs, 1400 based on Foata normal form. 11/6228 useless extension candidates. Maximal degree in co-relation 25891. Up to 5530 conditions per place. [2024-05-12 11:16:25,347 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 124 selfloop transitions, 15 changer transitions 0/161 dead transitions. [2024-05-12 11:16:25,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 161 transitions, 1416 flow [2024-05-12 11:16:25,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:16:25,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:16:25,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions. [2024-05-12 11:16:25,349 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2024-05-12 11:16:25,349 INFO L175 Difference]: Start difference. First operand has 111 places, 127 transitions, 972 flow. Second operand 6 states and 150 transitions. [2024-05-12 11:16:25,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 161 transitions, 1416 flow [2024-05-12 11:16:25,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 161 transitions, 1319 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-05-12 11:16:25,395 INFO L231 Difference]: Finished difference. Result has 111 places, 136 transitions, 1019 flow [2024-05-12 11:16:25,395 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=883, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1019, PETRI_PLACES=111, PETRI_TRANSITIONS=136} [2024-05-12 11:16:25,395 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 56 predicate places. [2024-05-12 11:16:25,395 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 136 transitions, 1019 flow [2024-05-12 11:16:25,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:16:25,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:16:25,396 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:16:25,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-05-12 11:16:25,396 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:16:25,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:16:25,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1531019292, now seen corresponding path program 2 times [2024-05-12 11:16:25,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:16:25,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520665075] [2024-05-12 11:16:25,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:16:25,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:16:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:16:36,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:16:36,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:16:36,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520665075] [2024-05-12 11:16:36,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520665075] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:16:36,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:16:36,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:16:36,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830620755] [2024-05-12 11:16:36,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:16:36,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:16:36,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:16:36,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:16:36,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:16:36,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-05-12 11:16:36,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 136 transitions, 1019 flow. Second operand has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:16:36,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:16:36,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-05-12 11:16:36,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:16:38,241 INFO L124 PetriNetUnfolderBase]: 3912/6344 cut-off events. [2024-05-12 11:16:38,241 INFO L125 PetriNetUnfolderBase]: For 60193/60207 co-relation queries the response was YES. [2024-05-12 11:16:38,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26787 conditions, 6344 events. 3912/6344 cut-off events. For 60193/60207 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 40283 event pairs, 1398 based on Foata normal form. 15/6235 useless extension candidates. Maximal degree in co-relation 26738. Up to 5513 conditions per place. [2024-05-12 11:16:38,284 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 126 selfloop transitions, 21 changer transitions 0/169 dead transitions. [2024-05-12 11:16:38,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 169 transitions, 1447 flow [2024-05-12 11:16:38,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:16:38,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:16:38,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 173 transitions. [2024-05-12 11:16:38,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5043731778425656 [2024-05-12 11:16:38,286 INFO L175 Difference]: Start difference. First operand has 111 places, 136 transitions, 1019 flow. Second operand 7 states and 173 transitions. [2024-05-12 11:16:38,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 169 transitions, 1447 flow [2024-05-12 11:16:38,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 169 transitions, 1407 flow, removed 11 selfloop flow, removed 3 redundant places. [2024-05-12 11:16:38,334 INFO L231 Difference]: Finished difference. Result has 115 places, 139 transitions, 1065 flow [2024-05-12 11:16:38,334 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=979, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1065, PETRI_PLACES=115, PETRI_TRANSITIONS=139} [2024-05-12 11:16:38,334 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 60 predicate places. [2024-05-12 11:16:38,334 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 139 transitions, 1065 flow [2024-05-12 11:16:38,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:16:38,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:16:38,335 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:16:38,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-05-12 11:16:38,335 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:16:38,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:16:38,337 INFO L85 PathProgramCache]: Analyzing trace with hash -700607910, now seen corresponding path program 1 times [2024-05-12 11:16:38,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:16:38,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811450952] [2024-05-12 11:16:38,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:16:38,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:16:38,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:16:48,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:16:48,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:16:48,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811450952] [2024-05-12 11:16:48,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811450952] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:16:48,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:16:48,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:16:48,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400906103] [2024-05-12 11:16:48,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:16:48,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:16:48,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:16:48,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:16:48,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:16:48,557 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-05-12 11:16:48,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 139 transitions, 1065 flow. Second operand has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:16:48,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:16:48,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-05-12 11:16:48,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:16:50,314 INFO L124 PetriNetUnfolderBase]: 3665/5996 cut-off events. [2024-05-12 11:16:50,314 INFO L125 PetriNetUnfolderBase]: For 57245/57247 co-relation queries the response was YES. [2024-05-12 11:16:50,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26067 conditions, 5996 events. 3665/5996 cut-off events. For 57245/57247 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 37810 event pairs, 1225 based on Foata normal form. 1/5889 useless extension candidates. Maximal degree in co-relation 26017. Up to 5239 conditions per place. [2024-05-12 11:16:50,353 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 142 selfloop transitions, 13 changer transitions 0/166 dead transitions. [2024-05-12 11:16:50,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 166 transitions, 1501 flow [2024-05-12 11:16:50,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:16:50,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:16:50,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions. [2024-05-12 11:16:50,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-05-12 11:16:50,355 INFO L175 Difference]: Start difference. First operand has 115 places, 139 transitions, 1065 flow. Second operand 6 states and 147 transitions. [2024-05-12 11:16:50,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 166 transitions, 1501 flow [2024-05-12 11:16:50,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 166 transitions, 1437 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-05-12 11:16:50,404 INFO L231 Difference]: Finished difference. Result has 117 places, 146 transitions, 1116 flow [2024-05-12 11:16:50,404 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1001, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1116, PETRI_PLACES=117, PETRI_TRANSITIONS=146} [2024-05-12 11:16:50,404 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 62 predicate places. [2024-05-12 11:16:50,405 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 146 transitions, 1116 flow [2024-05-12 11:16:50,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:16:50,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:16:50,405 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:16:50,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-05-12 11:16:50,405 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:16:50,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:16:50,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1531025244, now seen corresponding path program 2 times [2024-05-12 11:16:50,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:16:50,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158710216] [2024-05-12 11:16:50,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:16:50,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:16:50,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:17:01,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:17:01,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:17:01,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158710216] [2024-05-12 11:17:01,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158710216] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:17:01,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:17:01,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:17:01,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457270138] [2024-05-12 11:17:01,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:17:01,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:17:01,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:17:01,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:17:01,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:17:01,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-05-12 11:17:01,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 146 transitions, 1116 flow. Second operand has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:17:01,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:17:01,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-05-12 11:17:01,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:17:03,276 INFO L124 PetriNetUnfolderBase]: 3667/6015 cut-off events. [2024-05-12 11:17:03,276 INFO L125 PetriNetUnfolderBase]: For 62418/62420 co-relation queries the response was YES. [2024-05-12 11:17:03,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26927 conditions, 6015 events. 3667/6015 cut-off events. For 62418/62420 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 38142 event pairs, 1215 based on Foata normal form. 1/5902 useless extension candidates. Maximal degree in co-relation 26875. Up to 5222 conditions per place. [2024-05-12 11:17:03,315 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 144 selfloop transitions, 19 changer transitions 0/174 dead transitions. [2024-05-12 11:17:03,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 174 transitions, 1560 flow [2024-05-12 11:17:03,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:17:03,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:17:03,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 170 transitions. [2024-05-12 11:17:03,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4956268221574344 [2024-05-12 11:17:03,317 INFO L175 Difference]: Start difference. First operand has 117 places, 146 transitions, 1116 flow. Second operand 7 states and 170 transitions. [2024-05-12 11:17:03,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 174 transitions, 1560 flow [2024-05-12 11:17:03,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 174 transitions, 1515 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-05-12 11:17:03,383 INFO L231 Difference]: Finished difference. Result has 121 places, 149 transitions, 1157 flow [2024-05-12 11:17:03,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1071, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1157, PETRI_PLACES=121, PETRI_TRANSITIONS=149} [2024-05-12 11:17:03,384 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 66 predicate places. [2024-05-12 11:17:03,384 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 149 transitions, 1157 flow [2024-05-12 11:17:03,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:17:03,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:17:03,385 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:17:03,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-05-12 11:17:03,385 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:17:03,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:17:03,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1784057628, now seen corresponding path program 1 times [2024-05-12 11:17:03,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:17:03,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702002053] [2024-05-12 11:17:03,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:17:03,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:17:03,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:17:14,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:17:14,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:17:14,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702002053] [2024-05-12 11:17:14,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702002053] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:17:14,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:17:14,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:17:14,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258957288] [2024-05-12 11:17:14,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:17:14,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:17:14,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:17:14,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:17:14,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:17:15,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:17:15,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 149 transitions, 1157 flow. Second operand has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:17:15,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:17:15,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:17:15,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:17:17,397 INFO L124 PetriNetUnfolderBase]: 4480/7281 cut-off events. [2024-05-12 11:17:17,397 INFO L125 PetriNetUnfolderBase]: For 91831/91833 co-relation queries the response was YES. [2024-05-12 11:17:17,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33507 conditions, 7281 events. 4480/7281 cut-off events. For 91831/91833 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 46472 event pairs, 923 based on Foata normal form. 16/7128 useless extension candidates. Maximal degree in co-relation 33454. Up to 4947 conditions per place. [2024-05-12 11:17:17,448 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 148 selfloop transitions, 59 changer transitions 0/217 dead transitions. [2024-05-12 11:17:17,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 217 transitions, 1923 flow [2024-05-12 11:17:17,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:17:17,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:17:17,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 239 transitions. [2024-05-12 11:17:17,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5419501133786848 [2024-05-12 11:17:17,450 INFO L175 Difference]: Start difference. First operand has 121 places, 149 transitions, 1157 flow. Second operand 9 states and 239 transitions. [2024-05-12 11:17:17,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 217 transitions, 1923 flow [2024-05-12 11:17:17,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 217 transitions, 1859 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-05-12 11:17:17,523 INFO L231 Difference]: Finished difference. Result has 125 places, 151 transitions, 1255 flow [2024-05-12 11:17:17,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1093, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1255, PETRI_PLACES=125, PETRI_TRANSITIONS=151} [2024-05-12 11:17:17,524 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 70 predicate places. [2024-05-12 11:17:17,524 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 151 transitions, 1255 flow [2024-05-12 11:17:17,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:17:17,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:17:17,524 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:17:17,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-05-12 11:17:17,525 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:17:17,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:17:17,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1244584706, now seen corresponding path program 2 times [2024-05-12 11:17:17,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:17:17,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634951753] [2024-05-12 11:17:17,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:17:17,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:17:17,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:17:28,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:17:28,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:17:28,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634951753] [2024-05-12 11:17:28,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634951753] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:17:28,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:17:28,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:17:28,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262243370] [2024-05-12 11:17:28,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:17:28,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:17:28,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:17:28,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:17:28,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:17:28,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:17:28,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 151 transitions, 1255 flow. Second operand has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:17:28,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:17:28,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:17:28,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:17:30,974 INFO L124 PetriNetUnfolderBase]: 4684/7533 cut-off events. [2024-05-12 11:17:30,974 INFO L125 PetriNetUnfolderBase]: For 103149/103151 co-relation queries the response was YES. [2024-05-12 11:17:31,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35827 conditions, 7533 events. 4684/7533 cut-off events. For 103149/103151 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 48255 event pairs, 1377 based on Foata normal form. 24/7404 useless extension candidates. Maximal degree in co-relation 35773. Up to 5859 conditions per place. [2024-05-12 11:17:31,032 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 138 selfloop transitions, 66 changer transitions 0/214 dead transitions. [2024-05-12 11:17:31,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 214 transitions, 1911 flow [2024-05-12 11:17:31,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:17:31,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:17:31,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 236 transitions. [2024-05-12 11:17:31,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5351473922902494 [2024-05-12 11:17:31,034 INFO L175 Difference]: Start difference. First operand has 125 places, 151 transitions, 1255 flow. Second operand 9 states and 236 transitions. [2024-05-12 11:17:31,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 214 transitions, 1911 flow [2024-05-12 11:17:31,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 214 transitions, 1835 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-05-12 11:17:31,106 INFO L231 Difference]: Finished difference. Result has 129 places, 153 transitions, 1355 flow [2024-05-12 11:17:31,106 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1179, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1355, PETRI_PLACES=129, PETRI_TRANSITIONS=153} [2024-05-12 11:17:31,107 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 74 predicate places. [2024-05-12 11:17:31,107 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 153 transitions, 1355 flow [2024-05-12 11:17:31,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:17:31,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:17:31,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 11:17:31,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-05-12 11:17:31,108 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:17:31,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:17:31,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1124371354, now seen corresponding path program 3 times [2024-05-12 11:17:31,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:17:31,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638317135] [2024-05-12 11:17:31,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:17:31,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:17:31,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:17:39,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:17:39,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:17:39,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638317135] [2024-05-12 11:17:39,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638317135] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:17:39,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:17:39,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:17:39,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115545033] [2024-05-12 11:17:39,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:17:39,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:17:39,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:17:39,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:17:39,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:17:39,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:17:39,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 153 transitions, 1355 flow. Second operand has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:17:39,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:17:39,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:17:39,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:17:41,945 INFO L124 PetriNetUnfolderBase]: 4814/7751 cut-off events. [2024-05-12 11:17:41,946 INFO L125 PetriNetUnfolderBase]: For 110867/110869 co-relation queries the response was YES. [2024-05-12 11:17:41,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37871 conditions, 7751 events. 4814/7751 cut-off events. For 110867/110869 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 49911 event pairs, 1379 based on Foata normal form. 16/7614 useless extension candidates. Maximal degree in co-relation 37815. Up to 5839 conditions per place. [2024-05-12 11:17:42,001 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 143 selfloop transitions, 66 changer transitions 0/219 dead transitions. [2024-05-12 11:17:42,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 219 transitions, 2025 flow [2024-05-12 11:17:42,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:17:42,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:17:42,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 239 transitions. [2024-05-12 11:17:42,003 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5419501133786848 [2024-05-12 11:17:42,003 INFO L175 Difference]: Start difference. First operand has 129 places, 153 transitions, 1355 flow. Second operand 9 states and 239 transitions. [2024-05-12 11:17:42,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 219 transitions, 2025 flow [2024-05-12 11:17:42,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 219 transitions, 1877 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-05-12 11:17:42,103 INFO L231 Difference]: Finished difference. Result has 131 places, 154 transitions, 1369 flow [2024-05-12 11:17:42,103 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1207, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1369, PETRI_PLACES=131, PETRI_TRANSITIONS=154} [2024-05-12 11:17:42,104 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 76 predicate places. [2024-05-12 11:17:42,104 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 154 transitions, 1369 flow [2024-05-12 11:17:42,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:17:42,104 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:17:42,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 11:17:42,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-05-12 11:17:42,105 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:17:42,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:17:42,105 INFO L85 PathProgramCache]: Analyzing trace with hash -168077544, now seen corresponding path program 1 times [2024-05-12 11:17:42,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:17:42,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515526839] [2024-05-12 11:17:42,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:17:42,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:17:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:17:52,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:17:52,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:17:52,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515526839] [2024-05-12 11:17:52,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515526839] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:17:52,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:17:52,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:17:52,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817411283] [2024-05-12 11:17:52,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:17:52,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:17:52,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:17:52,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:17:52,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:17:53,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:17:53,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 154 transitions, 1369 flow. Second operand has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:17:53,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:17:53,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:17:53,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:17:55,472 INFO L124 PetriNetUnfolderBase]: 4848/7846 cut-off events. [2024-05-12 11:17:55,473 INFO L125 PetriNetUnfolderBase]: For 112489/112505 co-relation queries the response was YES. [2024-05-12 11:17:55,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38143 conditions, 7846 events. 4848/7846 cut-off events. For 112489/112505 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 51178 event pairs, 1615 based on Foata normal form. 16/7699 useless extension candidates. Maximal degree in co-relation 38086. Up to 6789 conditions per place. [2024-05-12 11:17:55,534 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 164 selfloop transitions, 43 changer transitions 0/217 dead transitions. [2024-05-12 11:17:55,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 217 transitions, 2240 flow [2024-05-12 11:17:55,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:17:55,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:17:55,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 176 transitions. [2024-05-12 11:17:55,536 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5131195335276968 [2024-05-12 11:17:55,536 INFO L175 Difference]: Start difference. First operand has 131 places, 154 transitions, 1369 flow. Second operand 7 states and 176 transitions. [2024-05-12 11:17:55,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 217 transitions, 2240 flow [2024-05-12 11:17:55,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 217 transitions, 2064 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-05-12 11:17:55,637 INFO L231 Difference]: Finished difference. Result has 133 places, 184 transitions, 1730 flow [2024-05-12 11:17:55,637 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1225, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1730, PETRI_PLACES=133, PETRI_TRANSITIONS=184} [2024-05-12 11:17:55,638 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 78 predicate places. [2024-05-12 11:17:55,638 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 184 transitions, 1730 flow [2024-05-12 11:17:55,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:17:55,638 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:17:55,638 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:17:55,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-05-12 11:17:55,639 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:17:55,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:17:55,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1938986660, now seen corresponding path program 4 times [2024-05-12 11:17:55,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:17:55,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265646745] [2024-05-12 11:17:55,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:17:55,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:17:55,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:18:06,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:18:06,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:18:06,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265646745] [2024-05-12 11:18:06,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265646745] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:18:06,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:18:06,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:18:06,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887279546] [2024-05-12 11:18:06,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:18:06,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:18:06,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:18:06,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:18:06,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:18:06,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:18:06,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 184 transitions, 1730 flow. Second operand has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:18:06,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:18:06,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:18:06,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:18:09,154 INFO L124 PetriNetUnfolderBase]: 5091/8270 cut-off events. [2024-05-12 11:18:09,154 INFO L125 PetriNetUnfolderBase]: For 133197/133211 co-relation queries the response was YES. [2024-05-12 11:18:09,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41715 conditions, 8270 events. 5091/8270 cut-off events. For 133197/133211 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 54534 event pairs, 1165 based on Foata normal form. 30/8135 useless extension candidates. Maximal degree in co-relation 41655. Up to 6124 conditions per place. [2024-05-12 11:18:09,222 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 162 selfloop transitions, 84 changer transitions 0/256 dead transitions. [2024-05-12 11:18:09,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 256 transitions, 2636 flow [2024-05-12 11:18:09,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:18:09,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:18:09,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 244 transitions. [2024-05-12 11:18:09,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5532879818594104 [2024-05-12 11:18:09,225 INFO L175 Difference]: Start difference. First operand has 133 places, 184 transitions, 1730 flow. Second operand 9 states and 244 transitions. [2024-05-12 11:18:09,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 256 transitions, 2636 flow [2024-05-12 11:18:09,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 256 transitions, 2544 flow, removed 25 selfloop flow, removed 3 redundant places. [2024-05-12 11:18:09,337 INFO L231 Difference]: Finished difference. Result has 139 places, 186 transitions, 1862 flow [2024-05-12 11:18:09,338 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1638, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1862, PETRI_PLACES=139, PETRI_TRANSITIONS=186} [2024-05-12 11:18:09,338 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 84 predicate places. [2024-05-12 11:18:09,338 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 186 transitions, 1862 flow [2024-05-12 11:18:09,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:18:09,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:18:09,339 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:18:09,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-05-12 11:18:09,339 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:18:09,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:18:09,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1939134530, now seen corresponding path program 5 times [2024-05-12 11:18:09,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:18:09,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930590351] [2024-05-12 11:18:09,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:18:09,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:18:09,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:18:19,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:18:19,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:18:19,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930590351] [2024-05-12 11:18:19,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930590351] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:18:19,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:18:19,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:18:19,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168853266] [2024-05-12 11:18:19,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:18:19,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:18:19,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:18:19,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:18:19,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:18:19,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:18:19,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 186 transitions, 1862 flow. Second operand has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:18:19,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:18:19,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:18:19,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:18:22,630 INFO L124 PetriNetUnfolderBase]: 5258/8549 cut-off events. [2024-05-12 11:18:22,630 INFO L125 PetriNetUnfolderBase]: For 148298/148318 co-relation queries the response was YES. [2024-05-12 11:18:22,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43889 conditions, 8549 events. 5258/8549 cut-off events. For 148298/148318 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 56866 event pairs, 1557 based on Foata normal form. 35/8412 useless extension candidates. Maximal degree in co-relation 43828. Up to 6779 conditions per place. [2024-05-12 11:18:22,699 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 153 selfloop transitions, 82 changer transitions 0/245 dead transitions. [2024-05-12 11:18:22,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 245 transitions, 2592 flow [2024-05-12 11:18:22,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:18:22,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:18:22,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 216 transitions. [2024-05-12 11:18:22,702 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5510204081632653 [2024-05-12 11:18:22,702 INFO L175 Difference]: Start difference. First operand has 139 places, 186 transitions, 1862 flow. Second operand 8 states and 216 transitions. [2024-05-12 11:18:22,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 245 transitions, 2592 flow [2024-05-12 11:18:22,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 245 transitions, 2473 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-05-12 11:18:22,859 INFO L231 Difference]: Finished difference. Result has 142 places, 187 transitions, 1942 flow [2024-05-12 11:18:22,859 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1743, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1942, PETRI_PLACES=142, PETRI_TRANSITIONS=187} [2024-05-12 11:18:22,860 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 87 predicate places. [2024-05-12 11:18:22,861 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 187 transitions, 1942 flow [2024-05-12 11:18:22,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:18:22,861 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:18:22,861 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:18:22,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-05-12 11:18:22,861 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:18:22,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:18:22,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1157192612, now seen corresponding path program 6 times [2024-05-12 11:18:22,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:18:22,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865513141] [2024-05-12 11:18:22,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:18:22,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:18:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:18:34,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 11:18:34,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:18:34,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865513141] [2024-05-12 11:18:34,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865513141] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:18:34,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:18:34,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:18:34,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208629443] [2024-05-12 11:18:34,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:18:34,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:18:34,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:18:34,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:18:34,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:18:34,377 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:18:34,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 187 transitions, 1942 flow. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:18:34,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:18:34,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:18:34,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:18:37,563 INFO L124 PetriNetUnfolderBase]: 5425/8849 cut-off events. [2024-05-12 11:18:37,564 INFO L125 PetriNetUnfolderBase]: For 158640/158642 co-relation queries the response was YES. [2024-05-12 11:18:37,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45907 conditions, 8849 events. 5425/8849 cut-off events. For 158640/158642 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 59467 event pairs, 1597 based on Foata normal form. 20/8682 useless extension candidates. Maximal degree in co-relation 45844. Up to 7036 conditions per place. [2024-05-12 11:18:37,735 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 164 selfloop transitions, 84 changer transitions 0/258 dead transitions. [2024-05-12 11:18:37,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 258 transitions, 2734 flow [2024-05-12 11:18:37,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:18:37,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:18:37,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 260 transitions. [2024-05-12 11:18:37,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5306122448979592 [2024-05-12 11:18:37,737 INFO L175 Difference]: Start difference. First operand has 142 places, 187 transitions, 1942 flow. Second operand 10 states and 260 transitions. [2024-05-12 11:18:37,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 258 transitions, 2734 flow [2024-05-12 11:18:37,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 258 transitions, 2559 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-05-12 11:18:37,863 INFO L231 Difference]: Finished difference. Result has 146 places, 188 transitions, 1972 flow [2024-05-12 11:18:37,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1767, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1972, PETRI_PLACES=146, PETRI_TRANSITIONS=188} [2024-05-12 11:18:37,864 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 91 predicate places. [2024-05-12 11:18:37,864 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 188 transitions, 1972 flow [2024-05-12 11:18:37,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:18:37,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:18:37,865 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:18:37,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-05-12 11:18:37,865 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:18:37,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:18:37,865 INFO L85 PathProgramCache]: Analyzing trace with hash -167748324, now seen corresponding path program 2 times [2024-05-12 11:18:37,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:18:37,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236553888] [2024-05-12 11:18:37,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:18:37,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:18:37,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:18:48,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:18:48,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:18:48,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236553888] [2024-05-12 11:18:48,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236553888] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:18:48,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:18:48,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:18:48,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187923704] [2024-05-12 11:18:48,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:18:48,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:18:48,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:18:48,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:18:48,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:18:48,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:18:48,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 188 transitions, 1972 flow. Second operand has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:18:48,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:18:48,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:18:48,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:18:50,968 INFO L124 PetriNetUnfolderBase]: 5501/9010 cut-off events. [2024-05-12 11:18:50,968 INFO L125 PetriNetUnfolderBase]: For 159103/159111 co-relation queries the response was YES. [2024-05-12 11:18:51,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46650 conditions, 9010 events. 5501/9010 cut-off events. For 159103/159111 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 61044 event pairs, 1850 based on Foata normal form. 6/8819 useless extension candidates. Maximal degree in co-relation 46586. Up to 7689 conditions per place. [2024-05-12 11:18:51,055 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 168 selfloop transitions, 46 changer transitions 0/224 dead transitions. [2024-05-12 11:18:51,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 224 transitions, 2666 flow [2024-05-12 11:18:51,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:18:51,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:18:51,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 173 transitions. [2024-05-12 11:18:51,056 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5043731778425656 [2024-05-12 11:18:51,056 INFO L175 Difference]: Start difference. First operand has 146 places, 188 transitions, 1972 flow. Second operand 7 states and 173 transitions. [2024-05-12 11:18:51,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 224 transitions, 2666 flow [2024-05-12 11:18:51,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 224 transitions, 2485 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-05-12 11:18:51,318 INFO L231 Difference]: Finished difference. Result has 146 places, 196 transitions, 2026 flow [2024-05-12 11:18:51,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1791, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2026, PETRI_PLACES=146, PETRI_TRANSITIONS=196} [2024-05-12 11:18:51,318 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 91 predicate places. [2024-05-12 11:18:51,318 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 196 transitions, 2026 flow [2024-05-12 11:18:51,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:18:51,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:18:51,319 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:18:51,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-05-12 11:18:51,319 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 11:18:51,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:18:51,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1157007782, now seen corresponding path program 1 times [2024-05-12 11:18:51,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:18:51,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409296584] [2024-05-12 11:18:51,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:18:51,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:18:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:19:03,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:19:03,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:19:03,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409296584] [2024-05-12 11:19:03,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409296584] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:19:03,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:19:03,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:19:03,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586991258] [2024-05-12 11:19:03,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:19:03,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:19:03,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:19:03,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:19:03,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:19:03,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-05-12 11:19:03,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 196 transitions, 2026 flow. Second operand has 8 states, 8 states have (on average 15.875) internal successors, (127), 8 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:19:03,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:19:03,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-05-12 11:19:03,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:19:05,995 INFO L124 PetriNetUnfolderBase]: 5246/8734 cut-off events. [2024-05-12 11:19:05,996 INFO L125 PetriNetUnfolderBase]: For 162848/162870 co-relation queries the response was YES. [2024-05-12 11:19:06,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45472 conditions, 8734 events. 5246/8734 cut-off events. For 162848/162870 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 60430 event pairs, 1796 based on Foata normal form. 23/8521 useless extension candidates. Maximal degree in co-relation 45406. Up to 7491 conditions per place. [2024-05-12 11:19:06,089 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 176 selfloop transitions, 18 changer transitions 0/229 dead transitions. [2024-05-12 11:19:06,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 229 transitions, 2568 flow [2024-05-12 11:19:06,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:19:06,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:19:06,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 172 transitions. [2024-05-12 11:19:06,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5014577259475219 [2024-05-12 11:19:06,090 INFO L175 Difference]: Start difference. First operand has 146 places, 196 transitions, 2026 flow. Second operand 7 states and 172 transitions. [2024-05-12 11:19:06,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 229 transitions, 2568 flow [2024-05-12 11:19:06,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 229 transitions, 2474 flow, removed 29 selfloop flow, removed 3 redundant places. [2024-05-12 11:19:06,297 INFO L231 Difference]: Finished difference. Result has 150 places, 199 transitions, 2020 flow [2024-05-12 11:19:06,298 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1932, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2020, PETRI_PLACES=150, PETRI_TRANSITIONS=199} [2024-05-12 11:19:06,298 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 95 predicate places. [2024-05-12 11:19:06,298 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 199 transitions, 2020 flow [2024-05-12 11:19:06,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.875) internal successors, (127), 8 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:19:06,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:19:06,299 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:19:06,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-05-12 11:19:06,299 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:19:06,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:19:06,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1170196496, now seen corresponding path program 7 times [2024-05-12 11:19:06,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:19:06,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674049575] [2024-05-12 11:19:06,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:19:06,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:19:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:19:17,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:19:17,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:19:17,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674049575] [2024-05-12 11:19:17,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674049575] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:19:17,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:19:17,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:19:17,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327576220] [2024-05-12 11:19:17,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:19:17,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:19:17,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:19:17,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:19:17,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:19:17,856 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:19:17,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 199 transitions, 2020 flow. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:19:17,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:19:17,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:19:17,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:19:21,449 INFO L124 PetriNetUnfolderBase]: 5685/9289 cut-off events. [2024-05-12 11:19:21,449 INFO L125 PetriNetUnfolderBase]: For 188143/188145 co-relation queries the response was YES. [2024-05-12 11:19:21,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49890 conditions, 9289 events. 5685/9289 cut-off events. For 188143/188145 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 63014 event pairs, 1609 based on Foata normal form. 20/9113 useless extension candidates. Maximal degree in co-relation 49822. Up to 7419 conditions per place. [2024-05-12 11:19:21,563 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 177 selfloop transitions, 92 changer transitions 0/279 dead transitions. [2024-05-12 11:19:21,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 279 transitions, 2892 flow [2024-05-12 11:19:21,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:19:21,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:19:21,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 286 transitions. [2024-05-12 11:19:21,566 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5306122448979592 [2024-05-12 11:19:21,566 INFO L175 Difference]: Start difference. First operand has 150 places, 199 transitions, 2020 flow. Second operand 11 states and 286 transitions. [2024-05-12 11:19:21,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 279 transitions, 2892 flow [2024-05-12 11:19:21,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 279 transitions, 2826 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-05-12 11:19:21,793 INFO L231 Difference]: Finished difference. Result has 156 places, 200 transitions, 2177 flow [2024-05-12 11:19:21,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1954, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2177, PETRI_PLACES=156, PETRI_TRANSITIONS=200} [2024-05-12 11:19:21,794 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 101 predicate places. [2024-05-12 11:19:21,794 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 200 transitions, 2177 flow [2024-05-12 11:19:21,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:19:21,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:19:21,794 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:19:21,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-05-12 11:19:21,795 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 11:19:21,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:19:21,795 INFO L85 PathProgramCache]: Analyzing trace with hash 354802446, now seen corresponding path program 8 times [2024-05-12 11:19:21,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:19:21,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91327463] [2024-05-12 11:19:21,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:19:21,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:19:21,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:19:33,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:19:33,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:19:33,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91327463] [2024-05-12 11:19:33,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91327463] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:19:33,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:19:33,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:19:33,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310487628] [2024-05-12 11:19:33,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:19:33,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:19:33,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:19:33,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:19:33,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:19:33,577 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:19:33,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 200 transitions, 2177 flow. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:19:33,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:19:33,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:19:33,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:19:37,353 INFO L124 PetriNetUnfolderBase]: 5649/9241 cut-off events. [2024-05-12 11:19:37,353 INFO L125 PetriNetUnfolderBase]: For 189384/189386 co-relation queries the response was YES. [2024-05-12 11:19:37,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49926 conditions, 9241 events. 5649/9241 cut-off events. For 189384/189386 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 62771 event pairs, 1591 based on Foata normal form. 20/9061 useless extension candidates. Maximal degree in co-relation 49857. Up to 7363 conditions per place. [2024-05-12 11:19:37,452 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 179 selfloop transitions, 86 changer transitions 0/275 dead transitions. [2024-05-12 11:19:37,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 275 transitions, 3010 flow [2024-05-12 11:19:37,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:19:37,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:19:37,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 262 transitions. [2024-05-12 11:19:37,457 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5346938775510204 [2024-05-12 11:19:37,457 INFO L175 Difference]: Start difference. First operand has 156 places, 200 transitions, 2177 flow. Second operand 10 states and 262 transitions. [2024-05-12 11:19:37,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 275 transitions, 3010 flow [2024-05-12 11:19:37,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 275 transitions, 2801 flow, removed 14 selfloop flow, removed 9 redundant places. [2024-05-12 11:19:37,669 INFO L231 Difference]: Finished difference. Result has 157 places, 200 transitions, 2147 flow [2024-05-12 11:19:37,669 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1968, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2147, PETRI_PLACES=157, PETRI_TRANSITIONS=200} [2024-05-12 11:19:37,670 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 102 predicate places. [2024-05-12 11:19:37,670 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 200 transitions, 2147 flow [2024-05-12 11:19:37,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:19:37,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:19:37,670 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:19:37,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-05-12 11:19:37,671 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 11:19:37,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:19:37,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1169981015, now seen corresponding path program 1 times [2024-05-12 11:19:37,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:19:37,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951663561] [2024-05-12 11:19:37,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:19:37,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:19:37,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:19:46,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:19:46,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:19:46,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951663561] [2024-05-12 11:19:46,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951663561] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:19:46,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:19:46,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:19:46,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805170015] [2024-05-12 11:19:46,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:19:46,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:19:46,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:19:46,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:19:46,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:19:46,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:19:47,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 200 transitions, 2147 flow. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:19:47,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:19:47,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:19:47,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:19:50,290 INFO L124 PetriNetUnfolderBase]: 5709/9339 cut-off events. [2024-05-12 11:19:50,290 INFO L125 PetriNetUnfolderBase]: For 182774/182776 co-relation queries the response was YES. [2024-05-12 11:19:50,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49949 conditions, 9339 events. 5709/9339 cut-off events. For 182774/182776 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 63548 event pairs, 1668 based on Foata normal form. 4/9117 useless extension candidates. Maximal degree in co-relation 49879. Up to 7623 conditions per place. [2024-05-12 11:19:50,366 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 156 selfloop transitions, 95 changer transitions 0/261 dead transitions. [2024-05-12 11:19:50,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 261 transitions, 2937 flow [2024-05-12 11:19:50,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:19:50,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:19:50,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 231 transitions. [2024-05-12 11:19:50,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2024-05-12 11:19:50,368 INFO L175 Difference]: Start difference. First operand has 157 places, 200 transitions, 2147 flow. Second operand 9 states and 231 transitions. [2024-05-12 11:19:50,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 261 transitions, 2937 flow [2024-05-12 11:19:50,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 261 transitions, 2733 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-05-12 11:19:50,556 INFO L231 Difference]: Finished difference. Result has 158 places, 206 transitions, 2228 flow [2024-05-12 11:19:50,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1949, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2228, PETRI_PLACES=158, PETRI_TRANSITIONS=206} [2024-05-12 11:19:50,557 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 103 predicate places. [2024-05-12 11:19:50,557 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 206 transitions, 2228 flow [2024-05-12 11:19:50,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:19:50,557 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:19:50,558 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:19:50,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-05-12 11:19:50,558 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 11:19:50,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:19:50,558 INFO L85 PathProgramCache]: Analyzing trace with hash 355017927, now seen corresponding path program 2 times [2024-05-12 11:19:50,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:19:50,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589675700] [2024-05-12 11:19:50,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:19:50,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:19:50,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:20:00,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:20:00,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:20:00,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589675700] [2024-05-12 11:20:00,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589675700] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:20:00,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:20:00,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:20:00,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875479466] [2024-05-12 11:20:00,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:20:00,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:20:00,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:20:00,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:20:00,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:20:00,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:20:00,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 206 transitions, 2228 flow. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:20:00,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:20:00,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:20:00,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:20:04,137 INFO L124 PetriNetUnfolderBase]: 5746/9408 cut-off events. [2024-05-12 11:20:04,137 INFO L125 PetriNetUnfolderBase]: For 191791/191793 co-relation queries the response was YES. [2024-05-12 11:20:04,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51057 conditions, 9408 events. 5746/9408 cut-off events. For 191791/191793 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 64172 event pairs, 1670 based on Foata normal form. 4/9187 useless extension candidates. Maximal degree in co-relation 50985. Up to 7678 conditions per place. [2024-05-12 11:20:04,216 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 169 selfloop transitions, 91 changer transitions 0/270 dead transitions. [2024-05-12 11:20:04,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 270 transitions, 3067 flow [2024-05-12 11:20:04,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:20:04,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:20:04,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 231 transitions. [2024-05-12 11:20:04,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2024-05-12 11:20:04,226 INFO L175 Difference]: Start difference. First operand has 158 places, 206 transitions, 2228 flow. Second operand 9 states and 231 transitions. [2024-05-12 11:20:04,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 270 transitions, 3067 flow [2024-05-12 11:20:04,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 270 transitions, 2838 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-05-12 11:20:04,412 INFO L231 Difference]: Finished difference. Result has 162 places, 211 transitions, 2273 flow [2024-05-12 11:20:04,412 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2003, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2273, PETRI_PLACES=162, PETRI_TRANSITIONS=211} [2024-05-12 11:20:04,413 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 107 predicate places. [2024-05-12 11:20:04,413 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 211 transitions, 2273 flow [2024-05-12 11:20:04,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:20:04,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:20:04,413 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:20:04,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-05-12 11:20:04,413 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 11:20:04,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:20:04,414 INFO L85 PathProgramCache]: Analyzing trace with hash -913480505, now seen corresponding path program 3 times [2024-05-12 11:20:04,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:20:04,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91387090] [2024-05-12 11:20:04,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:20:04,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:20:04,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:20:13,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:20:13,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:20:13,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91387090] [2024-05-12 11:20:13,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91387090] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:20:13,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:20:13,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:20:13,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920878336] [2024-05-12 11:20:13,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:20:13,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:20:13,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:20:13,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:20:13,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:20:13,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:20:13,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 211 transitions, 2273 flow. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:20:13,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:20:13,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:20:13,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:20:16,654 INFO L124 PetriNetUnfolderBase]: 5738/9400 cut-off events. [2024-05-12 11:20:16,655 INFO L125 PetriNetUnfolderBase]: For 199699/199701 co-relation queries the response was YES. [2024-05-12 11:20:16,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51541 conditions, 9400 events. 5738/9400 cut-off events. For 199699/199701 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 64199 event pairs, 1663 based on Foata normal form. 4/9175 useless extension candidates. Maximal degree in co-relation 51467. Up to 7666 conditions per place. [2024-05-12 11:20:16,746 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 159 selfloop transitions, 104 changer transitions 0/273 dead transitions. [2024-05-12 11:20:16,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 273 transitions, 3121 flow [2024-05-12 11:20:16,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:20:16,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:20:16,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 231 transitions. [2024-05-12 11:20:16,762 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2024-05-12 11:20:16,762 INFO L175 Difference]: Start difference. First operand has 162 places, 211 transitions, 2273 flow. Second operand 9 states and 231 transitions. [2024-05-12 11:20:16,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 273 transitions, 3121 flow [2024-05-12 11:20:16,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 273 transitions, 2888 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-05-12 11:20:16,972 INFO L231 Difference]: Finished difference. Result has 166 places, 219 transitions, 2395 flow [2024-05-12 11:20:16,972 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2050, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2395, PETRI_PLACES=166, PETRI_TRANSITIONS=219} [2024-05-12 11:20:16,975 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 111 predicate places. [2024-05-12 11:20:16,975 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 219 transitions, 2395 flow [2024-05-12 11:20:16,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:20:16,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:20:16,975 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:20:16,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-05-12 11:20:16,976 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 11:20:16,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:20:16,976 INFO L85 PathProgramCache]: Analyzing trace with hash 722738309, now seen corresponding path program 4 times [2024-05-12 11:20:16,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:20:16,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689016718] [2024-05-12 11:20:16,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:20:16,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:20:17,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:20:26,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:20:26,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:20:26,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689016718] [2024-05-12 11:20:26,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689016718] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:20:26,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:20:26,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:20:26,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322482383] [2024-05-12 11:20:26,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:20:26,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:20:26,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:20:26,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:20:26,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:20:26,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:20:26,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 219 transitions, 2395 flow. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:20:26,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:20:26,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:20:26,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:20:30,241 INFO L124 PetriNetUnfolderBase]: 5823/9572 cut-off events. [2024-05-12 11:20:30,241 INFO L125 PetriNetUnfolderBase]: For 208322/208324 co-relation queries the response was YES. [2024-05-12 11:20:30,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52741 conditions, 9572 events. 5823/9572 cut-off events. For 208322/208324 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 65674 event pairs, 1453 based on Foata normal form. 4/9343 useless extension candidates. Maximal degree in co-relation 52665. Up to 7450 conditions per place. [2024-05-12 11:20:30,330 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 157 selfloop transitions, 113 changer transitions 0/280 dead transitions. [2024-05-12 11:20:30,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 280 transitions, 3225 flow [2024-05-12 11:20:30,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:20:30,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:20:30,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 235 transitions. [2024-05-12 11:20:30,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5328798185941043 [2024-05-12 11:20:30,331 INFO L175 Difference]: Start difference. First operand has 166 places, 219 transitions, 2395 flow. Second operand 9 states and 235 transitions. [2024-05-12 11:20:30,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 280 transitions, 3225 flow [2024-05-12 11:20:30,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 280 transitions, 3011 flow, removed 27 selfloop flow, removed 4 redundant places. [2024-05-12 11:20:30,569 INFO L231 Difference]: Finished difference. Result has 172 places, 222 transitions, 2496 flow [2024-05-12 11:20:30,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2185, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2496, PETRI_PLACES=172, PETRI_TRANSITIONS=222} [2024-05-12 11:20:30,570 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 117 predicate places. [2024-05-12 11:20:30,570 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 222 transitions, 2496 flow [2024-05-12 11:20:30,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:20:30,571 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:20:30,571 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:20:30,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-05-12 11:20:30,571 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:20:30,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:20:30,571 INFO L85 PathProgramCache]: Analyzing trace with hash 217434860, now seen corresponding path program 2 times [2024-05-12 11:20:30,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:20:30,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632011460] [2024-05-12 11:20:30,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:20:30,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:20:30,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:20:43,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:20:43,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:20:43,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632011460] [2024-05-12 11:20:43,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632011460] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:20:43,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:20:43,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:20:43,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676722851] [2024-05-12 11:20:43,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:20:43,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:20:43,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:20:43,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:20:43,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:20:43,439 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-05-12 11:20:43,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 222 transitions, 2496 flow. Second operand has 8 states, 8 states have (on average 15.875) internal successors, (127), 8 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:20:43,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:20:43,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-05-12 11:20:43,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:20:46,335 INFO L124 PetriNetUnfolderBase]: 5568/9498 cut-off events. [2024-05-12 11:20:46,336 INFO L125 PetriNetUnfolderBase]: For 210716/210762 co-relation queries the response was YES. [2024-05-12 11:20:46,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50996 conditions, 9498 events. 5568/9498 cut-off events. For 210716/210762 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 68372 event pairs, 1679 based on Foata normal form. 33/9225 useless extension candidates. Maximal degree in co-relation 50918. Up to 7933 conditions per place. [2024-05-12 11:20:46,430 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 193 selfloop transitions, 30 changer transitions 0/258 dead transitions. [2024-05-12 11:20:46,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 258 transitions, 3250 flow [2024-05-12 11:20:46,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:20:46,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:20:46,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2024-05-12 11:20:46,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49854227405247814 [2024-05-12 11:20:46,432 INFO L175 Difference]: Start difference. First operand has 172 places, 222 transitions, 2496 flow. Second operand 7 states and 171 transitions. [2024-05-12 11:20:46,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 258 transitions, 3250 flow [2024-05-12 11:20:46,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 258 transitions, 3003 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-05-12 11:20:46,657 INFO L231 Difference]: Finished difference. Result has 174 places, 230 transitions, 2452 flow [2024-05-12 11:20:46,657 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2249, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2452, PETRI_PLACES=174, PETRI_TRANSITIONS=230} [2024-05-12 11:20:46,658 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 119 predicate places. [2024-05-12 11:20:46,658 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 230 transitions, 2452 flow [2024-05-12 11:20:46,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.875) internal successors, (127), 8 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:20:46,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:20:46,658 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:20:46,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-05-12 11:20:46,659 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 11:20:46,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:20:46,659 INFO L85 PathProgramCache]: Analyzing trace with hash 216959196, now seen corresponding path program 3 times [2024-05-12 11:20:46,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:20:46,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346025652] [2024-05-12 11:20:46,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:20:46,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:20:46,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:20:57,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:20:57,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:20:57,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346025652] [2024-05-12 11:20:57,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346025652] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:20:57,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:20:57,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:20:57,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692533633] [2024-05-12 11:20:57,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:20:57,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:20:57,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:20:57,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:20:57,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:20:57,749 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:20:57,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 230 transitions, 2452 flow. Second operand has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:20:57,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:20:57,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:20:57,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:21:00,820 INFO L124 PetriNetUnfolderBase]: 5876/9823 cut-off events. [2024-05-12 11:21:00,820 INFO L125 PetriNetUnfolderBase]: For 224685/224727 co-relation queries the response was YES. [2024-05-12 11:21:00,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53357 conditions, 9823 events. 5876/9823 cut-off events. For 224685/224727 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 68898 event pairs, 1714 based on Foata normal form. 30/9597 useless extension candidates. Maximal degree in co-relation 53277. Up to 8152 conditions per place. [2024-05-12 11:21:00,906 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 202 selfloop transitions, 63 changer transitions 0/275 dead transitions. [2024-05-12 11:21:00,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 275 transitions, 3420 flow [2024-05-12 11:21:00,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:21:00,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:21:00,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 199 transitions. [2024-05-12 11:21:00,908 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5076530612244898 [2024-05-12 11:21:00,908 INFO L175 Difference]: Start difference. First operand has 174 places, 230 transitions, 2452 flow. Second operand 8 states and 199 transitions. [2024-05-12 11:21:00,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 275 transitions, 3420 flow [2024-05-12 11:21:01,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 275 transitions, 3345 flow, removed 26 selfloop flow, removed 3 redundant places. [2024-05-12 11:21:01,184 INFO L231 Difference]: Finished difference. Result has 180 places, 238 transitions, 2669 flow [2024-05-12 11:21:01,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2377, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2669, PETRI_PLACES=180, PETRI_TRANSITIONS=238} [2024-05-12 11:21:01,185 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 125 predicate places. [2024-05-12 11:21:01,185 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 238 transitions, 2669 flow [2024-05-12 11:21:01,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:21:01,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:21:01,186 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:21:01,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-05-12 11:21:01,186 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:21:01,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:21:01,186 INFO L85 PathProgramCache]: Analyzing trace with hash 216959630, now seen corresponding path program 3 times [2024-05-12 11:21:01,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:21:01,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420911621] [2024-05-12 11:21:01,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:21:01,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:21:01,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:21:12,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:21:12,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:21:12,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420911621] [2024-05-12 11:21:12,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420911621] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:21:12,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:21:12,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:21:12,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501970184] [2024-05-12 11:21:12,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:21:12,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:21:12,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:21:12,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:21:12,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:21:13,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-05-12 11:21:13,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 238 transitions, 2669 flow. Second operand has 8 states, 8 states have (on average 15.875) internal successors, (127), 8 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:21:13,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:21:13,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-05-12 11:21:13,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:21:16,011 INFO L124 PetriNetUnfolderBase]: 5595/9576 cut-off events. [2024-05-12 11:21:16,011 INFO L125 PetriNetUnfolderBase]: For 234833/234879 co-relation queries the response was YES. [2024-05-12 11:21:16,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52747 conditions, 9576 events. 5595/9576 cut-off events. For 234833/234879 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 69246 event pairs, 1702 based on Foata normal form. 33/9299 useless extension candidates. Maximal degree in co-relation 52664. Up to 7995 conditions per place. [2024-05-12 11:21:16,107 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 206 selfloop transitions, 23 changer transitions 0/266 dead transitions. [2024-05-12 11:21:16,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 266 transitions, 3246 flow [2024-05-12 11:21:16,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:21:16,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:21:16,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 169 transitions. [2024-05-12 11:21:16,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49271137026239065 [2024-05-12 11:21:16,109 INFO L175 Difference]: Start difference. First operand has 180 places, 238 transitions, 2669 flow. Second operand 7 states and 169 transitions. [2024-05-12 11:21:16,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 266 transitions, 3246 flow [2024-05-12 11:21:16,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 266 transitions, 3052 flow, removed 61 selfloop flow, removed 4 redundant places. [2024-05-12 11:21:16,330 INFO L231 Difference]: Finished difference. Result has 183 places, 239 transitions, 2536 flow [2024-05-12 11:21:16,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2475, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2536, PETRI_PLACES=183, PETRI_TRANSITIONS=239} [2024-05-12 11:21:16,331 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 128 predicate places. [2024-05-12 11:21:16,331 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 239 transitions, 2536 flow [2024-05-12 11:21:16,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.875) internal successors, (127), 8 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:21:16,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:21:16,332 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:21:16,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-05-12 11:21:16,332 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:21:16,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:21:16,333 INFO L85 PathProgramCache]: Analyzing trace with hash 9417234, now seen corresponding path program 1 times [2024-05-12 11:21:16,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:21:16,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021621767] [2024-05-12 11:21:16,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:21:16,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:21:16,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:21:27,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:21:27,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:21:27,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021621767] [2024-05-12 11:21:27,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021621767] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:21:27,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:21:27,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:21:27,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170801520] [2024-05-12 11:21:27,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:21:27,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:21:27,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:21:27,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:21:27,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:21:27,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-05-12 11:21:27,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 239 transitions, 2536 flow. Second operand has 9 states, 9 states have (on average 15.666666666666666) internal successors, (141), 9 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:21:27,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:21:27,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-05-12 11:21:27,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:21:30,414 INFO L124 PetriNetUnfolderBase]: 5598/9408 cut-off events. [2024-05-12 11:21:30,414 INFO L125 PetriNetUnfolderBase]: For 243816/243842 co-relation queries the response was YES. [2024-05-12 11:21:30,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52595 conditions, 9408 events. 5598/9408 cut-off events. For 243816/243842 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 66356 event pairs, 1636 based on Foata normal form. 2/9188 useless extension candidates. Maximal degree in co-relation 52511. Up to 8065 conditions per place. [2024-05-12 11:21:30,511 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 241 selfloop transitions, 17 changer transitions 0/273 dead transitions. [2024-05-12 11:21:30,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 273 transitions, 3223 flow [2024-05-12 11:21:30,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:21:30,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:21:30,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 172 transitions. [2024-05-12 11:21:30,512 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5014577259475219 [2024-05-12 11:21:30,513 INFO L175 Difference]: Start difference. First operand has 183 places, 239 transitions, 2536 flow. Second operand 7 states and 172 transitions. [2024-05-12 11:21:30,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 273 transitions, 3223 flow [2024-05-12 11:21:30,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 273 transitions, 3173 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-05-12 11:21:30,788 INFO L231 Difference]: Finished difference. Result has 186 places, 246 transitions, 2624 flow [2024-05-12 11:21:30,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2486, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2624, PETRI_PLACES=186, PETRI_TRANSITIONS=246} [2024-05-12 11:21:30,789 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 131 predicate places. [2024-05-12 11:21:30,789 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 246 transitions, 2624 flow [2024-05-12 11:21:30,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.666666666666666) internal successors, (141), 9 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:21:30,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:21:30,789 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:21:30,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-05-12 11:21:30,790 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:21:30,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:21:30,790 INFO L85 PathProgramCache]: Analyzing trace with hash -244006896, now seen corresponding path program 1 times [2024-05-12 11:21:30,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:21:30,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81632484] [2024-05-12 11:21:30,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:21:30,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:21:30,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:21:43,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:21:43,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:21:43,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81632484] [2024-05-12 11:21:43,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81632484] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:21:43,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:21:43,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:21:43,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806585823] [2024-05-12 11:21:43,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:21:43,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:21:43,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:21:43,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:21:43,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:21:43,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-05-12 11:21:43,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 246 transitions, 2624 flow. Second operand has 8 states, 8 states have (on average 15.875) internal successors, (127), 8 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:21:43,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:21:43,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-05-12 11:21:43,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:21:46,881 INFO L124 PetriNetUnfolderBase]: 5592/9402 cut-off events. [2024-05-12 11:21:46,881 INFO L125 PetriNetUnfolderBase]: For 255709/255735 co-relation queries the response was YES. [2024-05-12 11:21:46,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53801 conditions, 9402 events. 5592/9402 cut-off events. For 255709/255735 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 66187 event pairs, 1627 based on Foata normal form. 2/9182 useless extension candidates. Maximal degree in co-relation 53715. Up to 8068 conditions per place. [2024-05-12 11:21:46,981 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 243 selfloop transitions, 16 changer transitions 0/274 dead transitions. [2024-05-12 11:21:46,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 274 transitions, 3274 flow [2024-05-12 11:21:46,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:21:46,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:21:46,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 169 transitions. [2024-05-12 11:21:46,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49271137026239065 [2024-05-12 11:21:46,982 INFO L175 Difference]: Start difference. First operand has 186 places, 246 transitions, 2624 flow. Second operand 7 states and 169 transitions. [2024-05-12 11:21:46,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 274 transitions, 3274 flow [2024-05-12 11:21:47,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 274 transitions, 3205 flow, removed 22 selfloop flow, removed 4 redundant places. [2024-05-12 11:21:47,311 INFO L231 Difference]: Finished difference. Result has 189 places, 249 transitions, 2637 flow [2024-05-12 11:21:47,311 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2555, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2637, PETRI_PLACES=189, PETRI_TRANSITIONS=249} [2024-05-12 11:21:47,312 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 134 predicate places. [2024-05-12 11:21:47,312 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 249 transitions, 2637 flow [2024-05-12 11:21:47,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.875) internal successors, (127), 8 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:21:47,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:21:47,312 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:21:47,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-05-12 11:21:47,313 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:21:47,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:21:47,313 INFO L85 PathProgramCache]: Analyzing trace with hash 9567894, now seen corresponding path program 2 times [2024-05-12 11:21:47,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:21:47,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458376387] [2024-05-12 11:21:47,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:21:47,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:21:47,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:21:58,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:21:58,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:21:58,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458376387] [2024-05-12 11:21:58,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458376387] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:21:58,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:21:58,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:21:58,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534818986] [2024-05-12 11:21:58,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:21:58,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:21:58,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:21:58,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:21:58,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:21:58,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-05-12 11:21:58,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 249 transitions, 2637 flow. Second operand has 9 states, 9 states have (on average 15.666666666666666) internal successors, (141), 9 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:21:58,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:21:58,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-05-12 11:21:58,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:22:01,470 INFO L124 PetriNetUnfolderBase]: 5626/9459 cut-off events. [2024-05-12 11:22:01,470 INFO L125 PetriNetUnfolderBase]: For 265530/265556 co-relation queries the response was YES. [2024-05-12 11:22:01,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54763 conditions, 9459 events. 5626/9459 cut-off events. For 265530/265556 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 66673 event pairs, 1628 based on Foata normal form. 2/9237 useless extension candidates. Maximal degree in co-relation 54676. Up to 8070 conditions per place. [2024-05-12 11:22:01,569 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 242 selfloop transitions, 22 changer transitions 0/279 dead transitions. [2024-05-12 11:22:01,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 279 transitions, 3319 flow [2024-05-12 11:22:01,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:22:01,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:22:01,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 173 transitions. [2024-05-12 11:22:01,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5043731778425656 [2024-05-12 11:22:01,571 INFO L175 Difference]: Start difference. First operand has 189 places, 249 transitions, 2637 flow. Second operand 7 states and 173 transitions. [2024-05-12 11:22:01,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 279 transitions, 3319 flow [2024-05-12 11:22:02,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 279 transitions, 3259 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-05-12 11:22:02,035 INFO L231 Difference]: Finished difference. Result has 191 places, 252 transitions, 2681 flow [2024-05-12 11:22:02,035 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2577, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2681, PETRI_PLACES=191, PETRI_TRANSITIONS=252} [2024-05-12 11:22:02,035 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 136 predicate places. [2024-05-12 11:22:02,035 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 252 transitions, 2681 flow [2024-05-12 11:22:02,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.666666666666666) internal successors, (141), 9 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:22:02,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:22:02,036 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:22:02,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-05-12 11:22:02,036 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:22:02,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:22:02,037 INFO L85 PathProgramCache]: Analyzing trace with hash 217440812, now seen corresponding path program 2 times [2024-05-12 11:22:02,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:22:02,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186680594] [2024-05-12 11:22:02,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:22:02,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:22:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:22:14,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:22:14,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:22:14,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186680594] [2024-05-12 11:22:14,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186680594] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:22:14,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:22:14,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:22:14,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115287475] [2024-05-12 11:22:14,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:22:14,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:22:14,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:22:14,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:22:14,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:22:14,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-05-12 11:22:14,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 252 transitions, 2681 flow. Second operand has 8 states, 8 states have (on average 15.875) internal successors, (127), 8 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:22:14,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:22:14,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-05-12 11:22:14,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:22:17,715 INFO L124 PetriNetUnfolderBase]: 5724/9964 cut-off events. [2024-05-12 11:22:17,715 INFO L125 PetriNetUnfolderBase]: For 280669/280712 co-relation queries the response was YES. [2024-05-12 11:22:17,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56777 conditions, 9964 events. 5724/9964 cut-off events. For 280669/280712 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 72766 event pairs, 1640 based on Foata normal form. 9/9649 useless extension candidates. Maximal degree in co-relation 56689. Up to 8146 conditions per place. [2024-05-12 11:22:17,811 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 240 selfloop transitions, 30 changer transitions 0/285 dead transitions. [2024-05-12 11:22:17,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 285 transitions, 3513 flow [2024-05-12 11:22:17,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:22:17,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:22:17,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 173 transitions. [2024-05-12 11:22:17,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5043731778425656 [2024-05-12 11:22:17,812 INFO L175 Difference]: Start difference. First operand has 191 places, 252 transitions, 2681 flow. Second operand 7 states and 173 transitions. [2024-05-12 11:22:17,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 285 transitions, 3513 flow [2024-05-12 11:22:18,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 285 transitions, 3431 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-05-12 11:22:18,091 INFO L231 Difference]: Finished difference. Result has 193 places, 258 transitions, 2764 flow [2024-05-12 11:22:18,092 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2599, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2764, PETRI_PLACES=193, PETRI_TRANSITIONS=258} [2024-05-12 11:22:18,092 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 138 predicate places. [2024-05-12 11:22:18,092 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 258 transitions, 2764 flow [2024-05-12 11:22:18,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.875) internal successors, (127), 8 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:22:18,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:22:18,093 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:22:18,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-05-12 11:22:18,093 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:22:18,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:22:18,093 INFO L85 PathProgramCache]: Analyzing trace with hash 217143894, now seen corresponding path program 3 times [2024-05-12 11:22:18,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:22:18,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754082851] [2024-05-12 11:22:18,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:22:18,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:22:18,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:22:28,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:22:28,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:22:28,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754082851] [2024-05-12 11:22:28,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754082851] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:22:28,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:22:28,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:22:28,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419106011] [2024-05-12 11:22:28,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:22:28,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:22:28,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:22:28,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:22:28,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:22:28,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-05-12 11:22:28,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 258 transitions, 2764 flow. Second operand has 9 states, 9 states have (on average 15.666666666666666) internal successors, (141), 9 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:22:28,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:22:28,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-05-12 11:22:28,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:22:31,873 INFO L124 PetriNetUnfolderBase]: 5722/9740 cut-off events. [2024-05-12 11:22:31,874 INFO L125 PetriNetUnfolderBase]: For 289531/289557 co-relation queries the response was YES. [2024-05-12 11:22:31,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57403 conditions, 9740 events. 5722/9740 cut-off events. For 289531/289557 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 69850 event pairs, 1625 based on Foata normal form. 2/9479 useless extension candidates. Maximal degree in co-relation 57314. Up to 8154 conditions per place. [2024-05-12 11:22:31,977 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 248 selfloop transitions, 30 changer transitions 0/293 dead transitions. [2024-05-12 11:22:31,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 293 transitions, 3506 flow [2024-05-12 11:22:31,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:22:31,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:22:31,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 196 transitions. [2024-05-12 11:22:31,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-05-12 11:22:31,978 INFO L175 Difference]: Start difference. First operand has 193 places, 258 transitions, 2764 flow. Second operand 8 states and 196 transitions. [2024-05-12 11:22:31,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 293 transitions, 3506 flow [2024-05-12 11:22:32,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 293 transitions, 3442 flow, removed 22 selfloop flow, removed 3 redundant places. [2024-05-12 11:22:32,315 INFO L231 Difference]: Finished difference. Result has 198 places, 261 transitions, 2828 flow [2024-05-12 11:22:32,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2700, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2828, PETRI_PLACES=198, PETRI_TRANSITIONS=261} [2024-05-12 11:22:32,316 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 143 predicate places. [2024-05-12 11:22:32,316 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 261 transitions, 2828 flow [2024-05-12 11:22:32,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.666666666666666) internal successors, (141), 9 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:22:32,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:22:32,317 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:22:32,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-05-12 11:22:32,317 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:22:32,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:22:32,317 INFO L85 PathProgramCache]: Analyzing trace with hash 217144142, now seen corresponding path program 3 times [2024-05-12 11:22:32,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:22:32,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072167837] [2024-05-12 11:22:32,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:22:32,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:22:32,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:22:44,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:22:44,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:22:44,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072167837] [2024-05-12 11:22:44,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072167837] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:22:44,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:22:44,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:22:44,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515904465] [2024-05-12 11:22:44,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:22:44,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:22:44,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:22:44,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:22:44,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:22:44,250 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-05-12 11:22:44,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 261 transitions, 2828 flow. Second operand has 8 states, 8 states have (on average 15.875) internal successors, (127), 8 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:22:44,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:22:44,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-05-12 11:22:44,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:22:47,356 INFO L124 PetriNetUnfolderBase]: 5727/9772 cut-off events. [2024-05-12 11:22:47,357 INFO L125 PetriNetUnfolderBase]: For 298393/298428 co-relation queries the response was YES. [2024-05-12 11:22:47,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58108 conditions, 9772 events. 5727/9772 cut-off events. For 298393/298428 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 70406 event pairs, 1637 based on Foata normal form. 8/9508 useless extension candidates. Maximal degree in co-relation 58017. Up to 8228 conditions per place. [2024-05-12 11:22:47,463 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 252 selfloop transitions, 21 changer transitions 0/288 dead transitions. [2024-05-12 11:22:47,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 288 transitions, 3516 flow [2024-05-12 11:22:47,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:22:47,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:22:47,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 169 transitions. [2024-05-12 11:22:47,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49271137026239065 [2024-05-12 11:22:47,464 INFO L175 Difference]: Start difference. First operand has 198 places, 261 transitions, 2828 flow. Second operand 7 states and 169 transitions. [2024-05-12 11:22:47,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 288 transitions, 3516 flow [2024-05-12 11:22:47,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 288 transitions, 3410 flow, removed 25 selfloop flow, removed 6 redundant places. [2024-05-12 11:22:47,826 INFO L231 Difference]: Finished difference. Result has 199 places, 264 transitions, 2818 flow [2024-05-12 11:22:47,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2722, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2818, PETRI_PLACES=199, PETRI_TRANSITIONS=264} [2024-05-12 11:22:47,827 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 144 predicate places. [2024-05-12 11:22:47,827 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 264 transitions, 2818 flow [2024-05-12 11:22:47,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.875) internal successors, (127), 8 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:22:47,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:22:47,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:22:47,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-05-12 11:22:47,828 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 11:22:47,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:22:47,828 INFO L85 PathProgramCache]: Analyzing trace with hash -915434734, now seen corresponding path program 1 times [2024-05-12 11:22:47,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:22:47,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201946988] [2024-05-12 11:22:47,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:22:47,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:22:47,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:22:59,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:22:59,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:22:59,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201946988] [2024-05-12 11:22:59,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201946988] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:22:59,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:22:59,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:22:59,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849051110] [2024-05-12 11:22:59,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:22:59,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:22:59,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:22:59,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:22:59,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:22:59,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:22:59,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 264 transitions, 2818 flow. Second operand has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:22:59,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:22:59,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:22:59,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:23:02,936 INFO L124 PetriNetUnfolderBase]: 6088/10071 cut-off events. [2024-05-12 11:23:02,937 INFO L125 PetriNetUnfolderBase]: For 306328/306351 co-relation queries the response was YES. [2024-05-12 11:23:03,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60173 conditions, 10071 events. 6088/10071 cut-off events. For 306328/306351 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 70280 event pairs, 1788 based on Foata normal form. 22/9858 useless extension candidates. Maximal degree in co-relation 60081. Up to 8615 conditions per place. [2024-05-12 11:23:03,056 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 249 selfloop transitions, 47 changer transitions 0/306 dead transitions. [2024-05-12 11:23:03,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 306 transitions, 3616 flow [2024-05-12 11:23:03,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:23:03,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:23:03,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 198 transitions. [2024-05-12 11:23:03,057 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5051020408163265 [2024-05-12 11:23:03,057 INFO L175 Difference]: Start difference. First operand has 199 places, 264 transitions, 2818 flow. Second operand 8 states and 198 transitions. [2024-05-12 11:23:03,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 306 transitions, 3616 flow [2024-05-12 11:23:03,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 306 transitions, 3546 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-05-12 11:23:03,433 INFO L231 Difference]: Finished difference. Result has 202 places, 268 transitions, 2921 flow [2024-05-12 11:23:03,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2748, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2921, PETRI_PLACES=202, PETRI_TRANSITIONS=268} [2024-05-12 11:23:03,433 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 147 predicate places. [2024-05-12 11:23:03,433 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 268 transitions, 2921 flow [2024-05-12 11:23:03,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:23:03,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:23:03,434 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:23:03,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-05-12 11:23:03,434 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 11:23:03,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:23:03,434 INFO L85 PathProgramCache]: Analyzing trace with hash -905492259, now seen corresponding path program 1 times [2024-05-12 11:23:03,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:23:03,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012099035] [2024-05-12 11:23:03,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:23:03,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:23:03,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:23:14,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:23:14,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:23:14,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012099035] [2024-05-12 11:23:14,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012099035] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:23:14,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:23:14,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:23:14,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299752011] [2024-05-12 11:23:14,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:23:14,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:23:14,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:23:14,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:23:14,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:23:14,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:23:14,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 268 transitions, 2921 flow. Second operand has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:23:14,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:23:14,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:23:14,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:23:17,700 INFO L124 PetriNetUnfolderBase]: 6122/10120 cut-off events. [2024-05-12 11:23:17,700 INFO L125 PetriNetUnfolderBase]: For 318746/318748 co-relation queries the response was YES. [2024-05-12 11:23:17,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61730 conditions, 10120 events. 6122/10120 cut-off events. For 318746/318748 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 70591 event pairs, 1785 based on Foata normal form. 2/9884 useless extension candidates. Maximal degree in co-relation 61637. Up to 8675 conditions per place. [2024-05-12 11:23:17,803 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 254 selfloop transitions, 45 changer transitions 0/309 dead transitions. [2024-05-12 11:23:17,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 309 transitions, 3704 flow [2024-05-12 11:23:17,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:23:17,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:23:17,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 195 transitions. [2024-05-12 11:23:17,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49744897959183676 [2024-05-12 11:23:17,804 INFO L175 Difference]: Start difference. First operand has 202 places, 268 transitions, 2921 flow. Second operand 8 states and 195 transitions. [2024-05-12 11:23:17,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 309 transitions, 3704 flow [2024-05-12 11:23:18,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 309 transitions, 3557 flow, removed 28 selfloop flow, removed 6 redundant places. [2024-05-12 11:23:18,202 INFO L231 Difference]: Finished difference. Result has 204 places, 273 transitions, 2942 flow [2024-05-12 11:23:18,202 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2776, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2942, PETRI_PLACES=204, PETRI_TRANSITIONS=273} [2024-05-12 11:23:18,202 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 149 predicate places. [2024-05-12 11:23:18,203 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 273 transitions, 2942 flow [2024-05-12 11:23:18,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:23:18,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:23:18,203 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:23:18,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-05-12 11:23:18,204 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 11:23:18,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:23:18,204 INFO L85 PathProgramCache]: Analyzing trace with hash -905225349, now seen corresponding path program 2 times [2024-05-12 11:23:18,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:23:18,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976317838] [2024-05-12 11:23:18,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:23:18,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:23:18,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:23:29,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:23:29,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:23:29,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976317838] [2024-05-12 11:23:29,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976317838] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:23:29,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:23:29,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:23:29,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536429487] [2024-05-12 11:23:29,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:23:29,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:23:29,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:23:29,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:23:29,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:23:29,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:23:29,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 273 transitions, 2942 flow. Second operand has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:23:29,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:23:29,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:23:29,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:23:33,053 INFO L124 PetriNetUnfolderBase]: 6136/10124 cut-off events. [2024-05-12 11:23:33,053 INFO L125 PetriNetUnfolderBase]: For 326274/326276 co-relation queries the response was YES. [2024-05-12 11:23:33,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61859 conditions, 10124 events. 6136/10124 cut-off events. For 326274/326276 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 70436 event pairs, 1790 based on Foata normal form. 2/9889 useless extension candidates. Maximal degree in co-relation 61765. Up to 8578 conditions per place. [2024-05-12 11:23:33,173 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 246 selfloop transitions, 54 changer transitions 0/310 dead transitions. [2024-05-12 11:23:33,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 310 transitions, 3814 flow [2024-05-12 11:23:33,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:23:33,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:23:33,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 195 transitions. [2024-05-12 11:23:33,174 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49744897959183676 [2024-05-12 11:23:33,174 INFO L175 Difference]: Start difference. First operand has 204 places, 273 transitions, 2942 flow. Second operand 8 states and 195 transitions. [2024-05-12 11:23:33,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 310 transitions, 3814 flow [2024-05-12 11:23:33,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 310 transitions, 3738 flow, removed 16 selfloop flow, removed 4 redundant places. [2024-05-12 11:23:33,658 INFO L231 Difference]: Finished difference. Result has 208 places, 276 transitions, 3037 flow [2024-05-12 11:23:33,659 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2866, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3037, PETRI_PLACES=208, PETRI_TRANSITIONS=276} [2024-05-12 11:23:33,659 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 153 predicate places. [2024-05-12 11:23:33,659 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 276 transitions, 3037 flow [2024-05-12 11:23:33,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:23:33,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:23:33,660 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:23:33,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-05-12 11:23:33,660 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:23:33,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:23:33,660 INFO L85 PathProgramCache]: Analyzing trace with hash -451244391, now seen corresponding path program 1 times [2024-05-12 11:23:33,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:23:33,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065647788] [2024-05-12 11:23:33,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:23:33,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:23:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:23:43,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:23:43,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:23:43,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065647788] [2024-05-12 11:23:43,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065647788] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:23:43,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:23:43,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:23:43,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174207928] [2024-05-12 11:23:43,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:23:43,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:23:43,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:23:43,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:23:43,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:23:43,532 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:23:43,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 276 transitions, 3037 flow. Second operand has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:23:43,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:23:43,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:23:43,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:23:47,658 INFO L124 PetriNetUnfolderBase]: 6322/10463 cut-off events. [2024-05-12 11:23:47,659 INFO L125 PetriNetUnfolderBase]: For 350824/350835 co-relation queries the response was YES. [2024-05-12 11:23:47,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63790 conditions, 10463 events. 6322/10463 cut-off events. For 350824/350835 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 73377 event pairs, 1695 based on Foata normal form. 14/10232 useless extension candidates. Maximal degree in co-relation 63695. Up to 8048 conditions per place. [2024-05-12 11:23:47,774 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 259 selfloop transitions, 98 changer transitions 0/367 dead transitions. [2024-05-12 11:23:47,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 367 transitions, 4189 flow [2024-05-12 11:23:47,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 11:23:47,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 11:23:47,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 309 transitions. [2024-05-12 11:23:47,776 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5255102040816326 [2024-05-12 11:23:47,776 INFO L175 Difference]: Start difference. First operand has 208 places, 276 transitions, 3037 flow. Second operand 12 states and 309 transitions. [2024-05-12 11:23:47,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 367 transitions, 4189 flow [2024-05-12 11:23:48,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 367 transitions, 4073 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-05-12 11:23:48,160 INFO L231 Difference]: Finished difference. Result has 217 places, 281 transitions, 3208 flow [2024-05-12 11:23:48,160 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2921, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3208, PETRI_PLACES=217, PETRI_TRANSITIONS=281} [2024-05-12 11:23:48,161 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 162 predicate places. [2024-05-12 11:23:48,161 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 281 transitions, 3208 flow [2024-05-12 11:23:48,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:23:48,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:23:48,161 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:23:48,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-05-12 11:23:48,162 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:23:48,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:23:48,162 INFO L85 PathProgramCache]: Analyzing trace with hash -905228914, now seen corresponding path program 2 times [2024-05-12 11:23:48,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:23:48,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469070834] [2024-05-12 11:23:48,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:23:48,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:23:48,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:24:00,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:24:00,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:24:00,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469070834] [2024-05-12 11:24:00,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469070834] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:24:00,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:24:00,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:24:00,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161986097] [2024-05-12 11:24:00,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:24:00,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:24:00,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:24:00,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:24:00,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:24:00,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:24:00,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 281 transitions, 3208 flow. Second operand has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:24:00,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:24:00,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:24:00,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:24:04,530 INFO L124 PetriNetUnfolderBase]: 6358/10571 cut-off events. [2024-05-12 11:24:04,530 INFO L125 PetriNetUnfolderBase]: For 356446/356457 co-relation queries the response was YES. [2024-05-12 11:24:04,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65393 conditions, 10571 events. 6358/10571 cut-off events. For 356446/356457 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 74743 event pairs, 1874 based on Foata normal form. 8/10327 useless extension candidates. Maximal degree in co-relation 65295. Up to 8898 conditions per place. [2024-05-12 11:24:04,638 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 250 selfloop transitions, 58 changer transitions 0/318 dead transitions. [2024-05-12 11:24:04,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 318 transitions, 4126 flow [2024-05-12 11:24:04,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:24:04,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:24:04,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 195 transitions. [2024-05-12 11:24:04,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49744897959183676 [2024-05-12 11:24:04,639 INFO L175 Difference]: Start difference. First operand has 217 places, 281 transitions, 3208 flow. Second operand 8 states and 195 transitions. [2024-05-12 11:24:04,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 318 transitions, 4126 flow [2024-05-12 11:24:05,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 318 transitions, 3876 flow, removed 17 selfloop flow, removed 10 redundant places. [2024-05-12 11:24:05,069 INFO L231 Difference]: Finished difference. Result has 215 places, 285 transitions, 3161 flow [2024-05-12 11:24:05,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2958, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3161, PETRI_PLACES=215, PETRI_TRANSITIONS=285} [2024-05-12 11:24:05,070 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 160 predicate places. [2024-05-12 11:24:05,070 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 285 transitions, 3161 flow [2024-05-12 11:24:05,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:24:05,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:24:05,070 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:24:05,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-05-12 11:24:05,070 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:24:05,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:24:05,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1507501474, now seen corresponding path program 3 times [2024-05-12 11:24:05,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:24:05,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807952218] [2024-05-12 11:24:05,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:24:05,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:24:05,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:24:18,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:24:18,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:24:18,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807952218] [2024-05-12 11:24:18,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807952218] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:24:18,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:24:18,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:24:18,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740085260] [2024-05-12 11:24:18,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:24:18,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:24:18,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:24:18,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:24:18,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:24:18,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:24:18,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 285 transitions, 3161 flow. Second operand has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:24:18,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:24:18,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:24:18,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:24:22,107 INFO L124 PetriNetUnfolderBase]: 6434/10671 cut-off events. [2024-05-12 11:24:22,107 INFO L125 PetriNetUnfolderBase]: For 369642/369653 co-relation queries the response was YES. [2024-05-12 11:24:22,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66672 conditions, 10671 events. 6434/10671 cut-off events. For 369642/369653 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 75279 event pairs, 1871 based on Foata normal form. 8/10432 useless extension candidates. Maximal degree in co-relation 66575. Up to 8878 conditions per place. [2024-05-12 11:24:22,220 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 252 selfloop transitions, 65 changer transitions 0/327 dead transitions. [2024-05-12 11:24:22,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 327 transitions, 4293 flow [2024-05-12 11:24:22,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:24:22,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:24:22,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 197 transitions. [2024-05-12 11:24:22,222 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5025510204081632 [2024-05-12 11:24:22,222 INFO L175 Difference]: Start difference. First operand has 215 places, 285 transitions, 3161 flow. Second operand 8 states and 197 transitions. [2024-05-12 11:24:22,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 327 transitions, 4293 flow [2024-05-12 11:24:22,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 327 transitions, 4118 flow, removed 32 selfloop flow, removed 6 redundant places. [2024-05-12 11:24:22,662 INFO L231 Difference]: Finished difference. Result has 218 places, 293 transitions, 3311 flow [2024-05-12 11:24:22,662 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2986, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3311, PETRI_PLACES=218, PETRI_TRANSITIONS=293} [2024-05-12 11:24:22,662 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 163 predicate places. [2024-05-12 11:24:22,663 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 293 transitions, 3311 flow [2024-05-12 11:24:22,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:24:22,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:24:22,663 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:24:22,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-05-12 11:24:22,663 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:24:22,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:24:22,664 INFO L85 PathProgramCache]: Analyzing trace with hash -905215429, now seen corresponding path program 1 times [2024-05-12 11:24:22,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:24:22,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336813218] [2024-05-12 11:24:22,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:24:22,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:24:22,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:24:34,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:24:34,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:24:34,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336813218] [2024-05-12 11:24:34,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336813218] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:24:34,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:24:34,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:24:34,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404979306] [2024-05-12 11:24:34,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:24:34,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:24:34,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:24:34,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:24:34,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:24:34,343 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-05-12 11:24:34,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 293 transitions, 3311 flow. Second operand has 9 states, 9 states have (on average 15.777777777777779) internal successors, (142), 9 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:24:34,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:24:34,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-05-12 11:24:34,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:24:38,135 INFO L124 PetriNetUnfolderBase]: 6234/10441 cut-off events. [2024-05-12 11:24:38,135 INFO L125 PetriNetUnfolderBase]: For 381424/381450 co-relation queries the response was YES. [2024-05-12 11:24:38,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66460 conditions, 10441 events. 6234/10441 cut-off events. For 381424/381450 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 74582 event pairs, 1821 based on Foata normal form. 27/10184 useless extension candidates. Maximal degree in co-relation 66361. Up to 8735 conditions per place. [2024-05-12 11:24:38,242 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 263 selfloop transitions, 21 changer transitions 0/331 dead transitions. [2024-05-12 11:24:38,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 331 transitions, 4093 flow [2024-05-12 11:24:38,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:24:38,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:24:38,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 194 transitions. [2024-05-12 11:24:38,243 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49489795918367346 [2024-05-12 11:24:38,243 INFO L175 Difference]: Start difference. First operand has 218 places, 293 transitions, 3311 flow. Second operand 8 states and 194 transitions. [2024-05-12 11:24:38,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 331 transitions, 4093 flow [2024-05-12 11:24:38,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 331 transitions, 3940 flow, removed 46 selfloop flow, removed 4 redundant places. [2024-05-12 11:24:38,786 INFO L231 Difference]: Finished difference. Result has 222 places, 296 transitions, 3284 flow [2024-05-12 11:24:38,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3158, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3284, PETRI_PLACES=222, PETRI_TRANSITIONS=296} [2024-05-12 11:24:38,787 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 167 predicate places. [2024-05-12 11:24:38,787 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 296 transitions, 3284 flow [2024-05-12 11:24:38,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.777777777777779) internal successors, (142), 9 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:24:38,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:24:38,787 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:24:38,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-05-12 11:24:38,787 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:24:38,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:24:38,788 INFO L85 PathProgramCache]: Analyzing trace with hash 284188475, now seen corresponding path program 3 times [2024-05-12 11:24:38,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:24:38,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4448343] [2024-05-12 11:24:38,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:24:38,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:24:38,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:24:49,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:24:49,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:24:49,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4448343] [2024-05-12 11:24:49,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4448343] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:24:49,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:24:49,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:24:49,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625024111] [2024-05-12 11:24:49,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:24:49,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:24:49,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:24:49,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:24:49,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:24:49,450 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:24:49,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 296 transitions, 3284 flow. Second operand has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:24:49,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:24:49,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:24:49,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:24:53,184 INFO L124 PetriNetUnfolderBase]: 6444/10692 cut-off events. [2024-05-12 11:24:53,184 INFO L125 PetriNetUnfolderBase]: For 393739/393741 co-relation queries the response was YES. [2024-05-12 11:24:53,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68670 conditions, 10692 events. 6444/10692 cut-off events. For 393739/393741 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 75464 event pairs, 1880 based on Foata normal form. 1/10443 useless extension candidates. Maximal degree in co-relation 68569. Up to 9174 conditions per place. [2024-05-12 11:24:53,311 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 284 selfloop transitions, 45 changer transitions 0/339 dead transitions. [2024-05-12 11:24:53,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 339 transitions, 4092 flow [2024-05-12 11:24:53,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:24:53,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:24:53,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 217 transitions. [2024-05-12 11:24:53,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49206349206349204 [2024-05-12 11:24:53,339 INFO L175 Difference]: Start difference. First operand has 222 places, 296 transitions, 3284 flow. Second operand 9 states and 217 transitions. [2024-05-12 11:24:53,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 339 transitions, 4092 flow [2024-05-12 11:24:53,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 339 transitions, 3966 flow, removed 44 selfloop flow, removed 6 redundant places. [2024-05-12 11:24:53,816 INFO L231 Difference]: Finished difference. Result has 225 places, 296 transitions, 3255 flow [2024-05-12 11:24:53,816 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3158, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3255, PETRI_PLACES=225, PETRI_TRANSITIONS=296} [2024-05-12 11:24:53,817 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 170 predicate places. [2024-05-12 11:24:53,817 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 296 transitions, 3255 flow [2024-05-12 11:24:53,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:24:53,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:24:53,817 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:24:53,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-05-12 11:24:53,817 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:24:53,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:24:53,820 INFO L85 PathProgramCache]: Analyzing trace with hash 296598395, now seen corresponding path program 4 times [2024-05-12 11:24:53,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:24:53,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143939696] [2024-05-12 11:24:53,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:24:53,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:24:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:25:04,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:25:04,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:25:04,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143939696] [2024-05-12 11:25:04,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143939696] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:25:04,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:25:04,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:25:04,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36585509] [2024-05-12 11:25:04,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:25:04,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:25:04,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:25:04,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:25:04,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:25:05,067 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:25:05,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 296 transitions, 3255 flow. Second operand has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:25:05,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:25:05,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:25:05,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:25:08,788 INFO L124 PetriNetUnfolderBase]: 6461/10715 cut-off events. [2024-05-12 11:25:08,788 INFO L125 PetriNetUnfolderBase]: For 403252/403254 co-relation queries the response was YES. [2024-05-12 11:25:08,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69014 conditions, 10715 events. 6461/10715 cut-off events. For 403252/403254 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 75615 event pairs, 1868 based on Foata normal form. 1/10466 useless extension candidates. Maximal degree in co-relation 68912. Up to 9143 conditions per place. [2024-05-12 11:25:08,898 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 270 selfloop transitions, 54 changer transitions 0/334 dead transitions. [2024-05-12 11:25:08,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 334 transitions, 4091 flow [2024-05-12 11:25:08,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:25:08,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:25:08,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 195 transitions. [2024-05-12 11:25:08,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49744897959183676 [2024-05-12 11:25:08,900 INFO L175 Difference]: Start difference. First operand has 225 places, 296 transitions, 3255 flow. Second operand 8 states and 195 transitions. [2024-05-12 11:25:08,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 334 transitions, 4091 flow [2024-05-12 11:25:09,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 334 transitions, 3868 flow, removed 8 selfloop flow, removed 11 redundant places. [2024-05-12 11:25:09,425 INFO L231 Difference]: Finished difference. Result has 222 places, 299 transitions, 3210 flow [2024-05-12 11:25:09,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3032, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3210, PETRI_PLACES=222, PETRI_TRANSITIONS=299} [2024-05-12 11:25:09,426 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 167 predicate places. [2024-05-12 11:25:09,426 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 299 transitions, 3210 flow [2024-05-12 11:25:09,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:25:09,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:25:09,427 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:25:09,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-05-12 11:25:09,427 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:25:09,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:25:09,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1864194117, now seen corresponding path program 5 times [2024-05-12 11:25:09,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:25:09,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384652532] [2024-05-12 11:25:09,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:25:09,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:25:09,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:25:20,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:25:20,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:25:20,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384652532] [2024-05-12 11:25:20,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384652532] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:25:20,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:25:20,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:25:20,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795337587] [2024-05-12 11:25:20,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:25:20,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:25:20,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:25:20,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:25:20,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:25:21,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:25:21,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 299 transitions, 3210 flow. Second operand has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:25:21,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:25:21,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:25:21,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:25:24,579 INFO L124 PetriNetUnfolderBase]: 6475/10822 cut-off events. [2024-05-12 11:25:24,579 INFO L125 PetriNetUnfolderBase]: For 412616/412618 co-relation queries the response was YES. [2024-05-12 11:25:24,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69290 conditions, 10822 events. 6475/10822 cut-off events. For 412616/412618 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 77088 event pairs, 1824 based on Foata normal form. 2/10545 useless extension candidates. Maximal degree in co-relation 69187. Up to 8961 conditions per place. [2024-05-12 11:25:24,720 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 254 selfloop transitions, 71 changer transitions 0/335 dead transitions. [2024-05-12 11:25:24,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 335 transitions, 4164 flow [2024-05-12 11:25:24,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:25:24,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:25:24,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 197 transitions. [2024-05-12 11:25:24,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5025510204081632 [2024-05-12 11:25:24,722 INFO L175 Difference]: Start difference. First operand has 222 places, 299 transitions, 3210 flow. Second operand 8 states and 197 transitions. [2024-05-12 11:25:24,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 335 transitions, 4164 flow [2024-05-12 11:25:25,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 335 transitions, 4018 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-05-12 11:25:25,419 INFO L231 Difference]: Finished difference. Result has 224 places, 302 transitions, 3280 flow [2024-05-12 11:25:25,419 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3064, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3280, PETRI_PLACES=224, PETRI_TRANSITIONS=302} [2024-05-12 11:25:25,420 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 169 predicate places. [2024-05-12 11:25:25,421 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 302 transitions, 3280 flow [2024-05-12 11:25:25,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:25:25,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:25:25,421 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:25:25,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-05-12 11:25:25,421 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:25:25,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:25:25,422 INFO L85 PathProgramCache]: Analyzing trace with hash 578401583, now seen corresponding path program 6 times [2024-05-12 11:25:25,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:25:25,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169646888] [2024-05-12 11:25:25,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:25:25,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:25:25,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:25:37,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:25:37,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:25:37,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169646888] [2024-05-12 11:25:37,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169646888] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:25:37,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:25:37,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:25:37,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966206447] [2024-05-12 11:25:37,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:25:37,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:25:37,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:25:37,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:25:37,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:25:37,654 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:25:37,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 302 transitions, 3280 flow. Second operand has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:25:37,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:25:37,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:25:37,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:25:41,317 INFO L124 PetriNetUnfolderBase]: 6470/10814 cut-off events. [2024-05-12 11:25:41,317 INFO L125 PetriNetUnfolderBase]: For 419374/419376 co-relation queries the response was YES. [2024-05-12 11:25:41,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69431 conditions, 10814 events. 6470/10814 cut-off events. For 419374/419376 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 77021 event pairs, 1826 based on Foata normal form. 1/10536 useless extension candidates. Maximal degree in co-relation 69327. Up to 8956 conditions per place. [2024-05-12 11:25:41,459 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 249 selfloop transitions, 75 changer transitions 0/334 dead transitions. [2024-05-12 11:25:41,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 334 transitions, 4052 flow [2024-05-12 11:25:41,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:25:41,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:25:41,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 195 transitions. [2024-05-12 11:25:41,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49744897959183676 [2024-05-12 11:25:41,464 INFO L175 Difference]: Start difference. First operand has 224 places, 302 transitions, 3280 flow. Second operand 8 states and 195 transitions. [2024-05-12 11:25:41,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 334 transitions, 4052 flow [2024-05-12 11:25:42,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 334 transitions, 3844 flow, removed 43 selfloop flow, removed 5 redundant places. [2024-05-12 11:25:42,167 INFO L231 Difference]: Finished difference. Result has 227 places, 302 transitions, 3228 flow [2024-05-12 11:25:42,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3072, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3228, PETRI_PLACES=227, PETRI_TRANSITIONS=302} [2024-05-12 11:25:42,168 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 172 predicate places. [2024-05-12 11:25:42,169 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 302 transitions, 3228 flow [2024-05-12 11:25:42,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:25:42,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:25:42,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:25:42,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-05-12 11:25:42,169 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:25:42,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:25:42,170 INFO L85 PathProgramCache]: Analyzing trace with hash 919932569, now seen corresponding path program 2 times [2024-05-12 11:25:42,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:25:42,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490047256] [2024-05-12 11:25:42,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:25:42,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:25:42,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:25:51,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:25:51,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:25:51,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490047256] [2024-05-12 11:25:51,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490047256] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:25:51,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:25:51,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:25:51,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827861822] [2024-05-12 11:25:51,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:25:51,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:25:51,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:25:51,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:25:51,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:25:51,545 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:25:51,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 302 transitions, 3228 flow. Second operand has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:25:51,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:25:51,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:25:51,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:25:55,882 INFO L124 PetriNetUnfolderBase]: 6716/11117 cut-off events. [2024-05-12 11:25:55,882 INFO L125 PetriNetUnfolderBase]: For 445981/445983 co-relation queries the response was YES. [2024-05-12 11:25:55,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71521 conditions, 11117 events. 6716/11117 cut-off events. For 445981/445983 co-relation queries the response was YES. Maximal size of possible extension queue 502. Compared 78698 event pairs, 1807 based on Foata normal form. 12/10866 useless extension candidates. Maximal degree in co-relation 71416. Up to 8793 conditions per place. [2024-05-12 11:25:56,038 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 275 selfloop transitions, 119 changer transitions 0/404 dead transitions. [2024-05-12 11:25:56,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 404 transitions, 4539 flow [2024-05-12 11:25:56,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-12 11:25:56,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-05-12 11:25:56,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 331 transitions. [2024-05-12 11:25:56,040 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5196232339089482 [2024-05-12 11:25:56,040 INFO L175 Difference]: Start difference. First operand has 227 places, 302 transitions, 3228 flow. Second operand 13 states and 331 transitions. [2024-05-12 11:25:56,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 404 transitions, 4539 flow [2024-05-12 11:25:56,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 404 transitions, 4349 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-05-12 11:25:56,577 INFO L231 Difference]: Finished difference. Result has 234 places, 312 transitions, 3420 flow [2024-05-12 11:25:56,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3038, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3420, PETRI_PLACES=234, PETRI_TRANSITIONS=312} [2024-05-12 11:25:56,577 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 179 predicate places. [2024-05-12 11:25:56,577 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 312 transitions, 3420 flow [2024-05-12 11:25:56,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:25:56,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:25:56,578 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:25:56,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-05-12 11:25:56,578 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:25:56,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:25:56,578 INFO L85 PathProgramCache]: Analyzing trace with hash 930051899, now seen corresponding path program 3 times [2024-05-12 11:25:56,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:25:56,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786778203] [2024-05-12 11:25:56,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:25:56,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:25:56,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:26:06,187 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:26:06,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:26:06,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786778203] [2024-05-12 11:26:06,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786778203] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:26:06,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:26:06,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:26:06,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162006844] [2024-05-12 11:26:06,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:26:06,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:26:06,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:26:06,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:26:06,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:26:06,439 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:26:06,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 312 transitions, 3420 flow. Second operand has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:26:06,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:26:06,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:26:06,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:26:10,744 INFO L124 PetriNetUnfolderBase]: 6882/11291 cut-off events. [2024-05-12 11:26:10,745 INFO L125 PetriNetUnfolderBase]: For 448704/448706 co-relation queries the response was YES. [2024-05-12 11:26:10,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73222 conditions, 11291 events. 6882/11291 cut-off events. For 448704/448706 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 79300 event pairs, 1630 based on Foata normal form. 12/11071 useless extension candidates. Maximal degree in co-relation 73114. Up to 7757 conditions per place. [2024-05-12 11:26:10,872 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 260 selfloop transitions, 130 changer transitions 0/400 dead transitions. [2024-05-12 11:26:10,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 400 transitions, 4728 flow [2024-05-12 11:26:10,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 11:26:10,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 11:26:10,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 309 transitions. [2024-05-12 11:26:10,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5255102040816326 [2024-05-12 11:26:10,874 INFO L175 Difference]: Start difference. First operand has 234 places, 312 transitions, 3420 flow. Second operand 12 states and 309 transitions. [2024-05-12 11:26:10,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 400 transitions, 4728 flow [2024-05-12 11:26:11,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 400 transitions, 4493 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-05-12 11:26:11,552 INFO L231 Difference]: Finished difference. Result has 240 places, 314 transitions, 3512 flow [2024-05-12 11:26:11,552 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3187, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3512, PETRI_PLACES=240, PETRI_TRANSITIONS=314} [2024-05-12 11:26:11,556 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 185 predicate places. [2024-05-12 11:26:11,557 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 314 transitions, 3512 flow [2024-05-12 11:26:11,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:26:11,557 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:26:11,557 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:26:11,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-05-12 11:26:11,557 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:26:11,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:26:11,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1273251481, now seen corresponding path program 4 times [2024-05-12 11:26:11,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:26:11,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551068907] [2024-05-12 11:26:11,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:26:11,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:26:11,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:26:20,701 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:26:20,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:26:20,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551068907] [2024-05-12 11:26:20,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551068907] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:26:20,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:26:20,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 11:26:20,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528449270] [2024-05-12 11:26:20,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:26:20,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:26:20,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:26:20,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:26:20,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:26:20,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:26:20,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 314 transitions, 3512 flow. Second operand has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:26:20,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:26:20,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:26:20,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15