./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix009.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix009.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cde23df1 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/mix009.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix009.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-cde23df-m [2024-06-14 14:32:26,696 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 14:32:26,770 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 14:32:26,779 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 14:32:26,779 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 14:32:26,818 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 14:32:26,819 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 14:32:26,819 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 14:32:26,820 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 14:32:26,824 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 14:32:26,824 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 14:32:26,824 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 14:32:26,826 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 14:32:26,827 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 14:32:26,827 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 14:32:26,827 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 14:32:26,828 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 14:32:26,828 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 14:32:26,828 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 14:32:26,829 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 14:32:26,830 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 14:32:26,837 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 14:32:26,837 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 14:32:26,837 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 14:32:26,838 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 14:32:26,838 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 14:32:26,838 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 14:32:26,838 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 14:32:26,839 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 14:32:26,840 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 14:32:26,840 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 14:32:26,841 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 14:32:26,841 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 14:32:26,841 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 14:32:26,841 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 14:32:26,842 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 14:32:26,842 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 14:32:26,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 14:32:26,842 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 14:32:26,843 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 14:32:26,843 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 14:32:26,843 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 14:32:26,843 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 14:32:26,844 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-14 14:32:27,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 14:32:27,131 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 14:32:27,134 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 14:32:27,135 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 14:32:27,135 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 14:32:27,137 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix009.opt.i [2024-06-14 14:32:28,345 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 14:32:28,625 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 14:32:28,625 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix009.opt.i [2024-06-14 14:32:28,640 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f31bfdce2/fd37182387864f82bf47dbc14d30af94/FLAGad21db013 [2024-06-14 14:32:28,654 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f31bfdce2/fd37182387864f82bf47dbc14d30af94 [2024-06-14 14:32:28,656 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 14:32:28,657 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 14:32:28,658 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/mutex-meet/mix009.opt.yml/witness.yml [2024-06-14 14:32:28,818 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 14:32:28,819 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 14:32:28,820 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 14:32:28,820 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 14:32:28,825 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 14:32:28,826 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 02:32:28" (1/2) ... [2024-06-14 14:32:28,827 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4249364 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:32:28, skipping insertion in model container [2024-06-14 14:32:28,827 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 02:32:28" (1/2) ... [2024-06-14 14:32:28,829 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@114cd4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:32:28, skipping insertion in model container [2024-06-14 14:32:28,830 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:32:28" (2/2) ... [2024-06-14 14:32:28,832 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4249364 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:32:28, skipping insertion in model container [2024-06-14 14:32:28,832 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:32:28" (2/2) ... [2024-06-14 14:32:28,832 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 14:32:28,916 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 14:32:28,918 INFO L97 edCorrectnessWitness]: Location invariant before [L834-L834] ((((((((((((((((((! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p1_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_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$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_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$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_buff1_thd0) + (long long )y$r_buff1_thd1 >= 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$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$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_p0_EAX) + (long long )__unbuffered_p0_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p1_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )x) + (long long )y >= 0LL) && (1LL - (long long )x) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )x) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 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 )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_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_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_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 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 )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_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd1 >= 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 )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_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 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_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 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_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 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_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 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_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 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_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$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_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$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_buff1_thd0 + (long long )y$r_buff1_thd1 >= 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$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$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_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 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_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 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_p0_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 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_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd1) - (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 )x >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x >= 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_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$read_delayed >= 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$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$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) - (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_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )x) - (long long )z >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )x >= 0LL) && (2LL - (long long )weak$$choice0) - (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_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (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_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 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_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_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_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 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_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 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_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 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_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 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_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 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_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$read_delayed >= 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$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$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (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_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 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_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 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_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 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)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! 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 || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || y$read_delayed == (_Bool)0) [2024-06-14 14:32:28,918 INFO L97 edCorrectnessWitness]: Location invariant before [L835-L835] ((((((((((((((((((! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p1_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_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$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_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$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_buff1_thd0) + (long long )y$r_buff1_thd1 >= 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$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$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_p0_EAX) + (long long )__unbuffered_p0_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p1_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )x) + (long long )y >= 0LL) && (1LL - (long long )x) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )x) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 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 )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_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_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_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 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 )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_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd1 >= 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 )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_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 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_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 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_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 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_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 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_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 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_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$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_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$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_buff1_thd0 + (long long )y$r_buff1_thd1 >= 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$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$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_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 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_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 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_p0_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 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_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd1) - (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 )x >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x >= 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_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$read_delayed >= 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$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$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) - (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_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )x) - (long long )z >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )x >= 0LL) && (2LL - (long long )weak$$choice0) - (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_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (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_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 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_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_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_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 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_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 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_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 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_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 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_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 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_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$read_delayed >= 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$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$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (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_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 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_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 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_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 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)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! 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 || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || y$read_delayed == (_Bool)0) [2024-06-14 14:32:28,919 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 14:32:28,919 INFO L106 edCorrectnessWitness]: ghost_update [L832-L832] multithreaded = 1; [2024-06-14 14:32:28,967 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 14:32:29,368 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 14:32:29,386 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-14 14:32:29,748 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 14:32:29,793 INFO L206 MainTranslator]: Completed translation [2024-06-14 14:32:29,794 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:32:29 WrapperNode [2024-06-14 14:32:29,794 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 14:32:29,795 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 14:32:29,795 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 14:32:29,795 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 14:32:29,802 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 14.06 02:32:29" (1/1) ... [2024-06-14 14:32:29,848 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 14.06 02:32:29" (1/1) ... [2024-06-14 14:32:29,957 INFO L138 Inliner]: procedures = 174, calls = 40, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 138 [2024-06-14 14:32:29,958 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 14:32:29,959 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 14:32:29,959 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 14:32:29,960 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 14:32:29,970 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:32:29" (1/1) ... [2024-06-14 14:32:29,971 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:32:29" (1/1) ... [2024-06-14 14:32:29,989 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:32:29" (1/1) ... [2024-06-14 14:32:30,041 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-14 14:32:30,041 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:32:29" (1/1) ... [2024-06-14 14:32:30,042 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:32:29" (1/1) ... [2024-06-14 14:32:30,073 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:32:29" (1/1) ... [2024-06-14 14:32:30,075 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:32:29" (1/1) ... [2024-06-14 14:32:30,087 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:32:29" (1/1) ... [2024-06-14 14:32:30,092 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:32:29" (1/1) ... [2024-06-14 14:32:30,108 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 14:32:30,110 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 14:32:30,110 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 14:32:30,110 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 14:32:30,111 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:32:29" (1/1) ... [2024-06-14 14:32:30,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 14:32:30,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 14:32:30,141 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-14 14:32:30,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-14 14:32:30,191 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-14 14:32:30,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 14:32:30,192 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-14 14:32:30,192 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-14 14:32:30,192 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-14 14:32:30,193 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-14 14:32:30,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 14:32:30,193 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-14 14:32:30,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 14:32:30,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 14:32:30,194 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-14 14:32:30,339 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 14:32:30,341 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 14:32:31,432 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 14:32:31,432 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 14:32:31,695 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 14:32:31,696 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-14 14:32:31,701 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 02:32:31 BoogieIcfgContainer [2024-06-14 14:32:31,702 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 14:32:31,704 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 14:32:31,704 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 14:32:31,707 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 14:32:31,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 02:32:28" (1/4) ... [2024-06-14 14:32:31,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@534848b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 02:32:31, skipping insertion in model container [2024-06-14 14:32:31,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:32:28" (2/4) ... [2024-06-14 14:32:31,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@534848b5 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 02:32:31, skipping insertion in model container [2024-06-14 14:32:31,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:32:29" (3/4) ... [2024-06-14 14:32:31,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@534848b5 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 02:32:31, skipping insertion in model container [2024-06-14 14:32:31,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 02:32:31" (4/4) ... [2024-06-14 14:32:31,711 INFO L112 eAbstractionObserver]: Analyzing ICFG mix009.opt.i [2024-06-14 14:32:31,727 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 14:32:31,728 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-14 14:32:31,728 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 14:32:31,835 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-14 14:32:31,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 33 transitions, 74 flow [2024-06-14 14:32:31,933 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2024-06-14 14:32:31,933 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 14:32:31,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 31 events. 0/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-14 14:32:31,936 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 33 transitions, 74 flow [2024-06-14 14:32:31,939 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 25 transitions, 56 flow [2024-06-14 14:32:31,952 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 14:32:31,960 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;@4c906b3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 14:32:31,960 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-14 14:32:31,970 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 14:32:31,970 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-06-14 14:32:31,970 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 14:32:31,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:32:31,971 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-14 14:32:31,972 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:32:31,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:32:31,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1580010432, now seen corresponding path program 1 times [2024-06-14 14:32:31,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:32:31,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472088720] [2024-06-14 14:32:31,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:32:31,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:32:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:32:38,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:32:38,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:32:38,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472088720] [2024-06-14 14:32:38,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472088720] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:32:38,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:32:38,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 14:32:38,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829089427] [2024-06-14 14:32:38,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:32:38,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 14:32:38,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:32:38,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 14:32:38,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 14:32:38,968 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-06-14 14:32:38,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:32:38,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:32:38,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-06-14 14:32:38,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:32:39,272 INFO L124 PetriNetUnfolderBase]: 162/317 cut-off events. [2024-06-14 14:32:39,272 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-14 14:32:39,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 630 conditions, 317 events. 162/317 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1277 event pairs, 97 based on Foata normal form. 1/304 useless extension candidates. Maximal degree in co-relation 616. Up to 288 conditions per place. [2024-06-14 14:32:39,277 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 23 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2024-06-14 14:32:39,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 31 transitions, 123 flow [2024-06-14 14:32:39,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 14:32:39,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 14:32:39,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2024-06-14 14:32:39,288 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5858585858585859 [2024-06-14 14:32:39,289 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 56 flow. Second operand 3 states and 58 transitions. [2024-06-14 14:32:39,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 31 transitions, 123 flow [2024-06-14 14:32:39,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 31 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-14 14:32:39,293 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 75 flow [2024-06-14 14:32:39,295 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2024-06-14 14:32:39,298 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2024-06-14 14:32:39,298 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 75 flow [2024-06-14 14:32:39,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:32:39,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:32:39,299 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:32:39,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 14:32:39,299 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:32:39,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:32:39,300 INFO L85 PathProgramCache]: Analyzing trace with hash 2028483035, now seen corresponding path program 1 times [2024-06-14 14:32:39,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:32:39,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499784726] [2024-06-14 14:32:39,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:32:39,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:32:39,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:32:44,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:32:44,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:32:44,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499784726] [2024-06-14 14:32:44,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499784726] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:32:44,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:32:44,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 14:32:44,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962097005] [2024-06-14 14:32:44,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:32:44,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 14:32:44,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:32:44,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 14:32:44,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-14 14:32:44,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-14 14:32:44,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:32:44,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:32:44,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-14 14:32:44,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:32:44,577 INFO L124 PetriNetUnfolderBase]: 186/347 cut-off events. [2024-06-14 14:32:44,577 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2024-06-14 14:32:44,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 791 conditions, 347 events. 186/347 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1360 event pairs, 94 based on Foata normal form. 2/346 useless extension candidates. Maximal degree in co-relation 776. Up to 319 conditions per place. [2024-06-14 14:32:44,584 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 28 selfloop transitions, 5 changer transitions 0/37 dead transitions. [2024-06-14 14:32:44,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 37 transitions, 167 flow [2024-06-14 14:32:44,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 14:32:44,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 14:32:44,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2024-06-14 14:32:44,589 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5378787878787878 [2024-06-14 14:32:44,589 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 75 flow. Second operand 4 states and 71 transitions. [2024-06-14 14:32:44,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 37 transitions, 167 flow [2024-06-14 14:32:44,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 37 transitions, 164 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 14:32:44,594 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 99 flow [2024-06-14 14:32:44,595 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=99, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2024-06-14 14:32:44,595 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2024-06-14 14:32:44,596 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 99 flow [2024-06-14 14:32:44,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:32:44,596 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:32:44,596 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:32:44,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-14 14:32:44,597 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:32:44,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:32:44,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1543321887, now seen corresponding path program 1 times [2024-06-14 14:32:44,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:32:44,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272837751] [2024-06-14 14:32:44,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:32:44,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:32:44,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:32:49,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:32:49,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:32:49,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272837751] [2024-06-14 14:32:49,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272837751] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:32:49,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:32:49,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 14:32:49,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066627098] [2024-06-14 14:32:49,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:32:49,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 14:32:49,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:32:49,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 14:32:49,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 14:32:49,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 14:32:49,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 99 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:32:49,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:32:49,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 14:32:49,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:32:49,607 INFO L124 PetriNetUnfolderBase]: 219/398 cut-off events. [2024-06-14 14:32:49,607 INFO L125 PetriNetUnfolderBase]: For 228/228 co-relation queries the response was YES. [2024-06-14 14:32:49,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1006 conditions, 398 events. 219/398 cut-off events. For 228/228 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1500 event pairs, 99 based on Foata normal form. 2/397 useless extension candidates. Maximal degree in co-relation 989. Up to 366 conditions per place. [2024-06-14 14:32:49,611 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 33 selfloop transitions, 7 changer transitions 0/43 dead transitions. [2024-06-14 14:32:49,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 43 transitions, 217 flow [2024-06-14 14:32:49,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 14:32:49,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 14:32:49,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2024-06-14 14:32:49,616 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49696969696969695 [2024-06-14 14:32:49,616 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 99 flow. Second operand 5 states and 82 transitions. [2024-06-14 14:32:49,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 43 transitions, 217 flow [2024-06-14 14:32:49,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 43 transitions, 208 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-14 14:32:49,620 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 123 flow [2024-06-14 14:32:49,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2024-06-14 14:32:49,622 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2024-06-14 14:32:49,622 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 123 flow [2024-06-14 14:32:49,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:32:49,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:32:49,623 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:32:49,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-14 14:32:49,623 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:32:49,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:32:49,624 INFO L85 PathProgramCache]: Analyzing trace with hash -598337282, now seen corresponding path program 1 times [2024-06-14 14:32:49,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:32:49,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54734755] [2024-06-14 14:32:49,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:32:49,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:32:49,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:32:54,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:32:54,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:32:54,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54734755] [2024-06-14 14:32:54,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54734755] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:32:54,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:32:54,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 14:32:54,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166505065] [2024-06-14 14:32:54,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:32:54,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 14:32:54,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:32:54,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 14:32:54,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-14 14:32:54,137 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 14:32:54,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 123 flow. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:32:54,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:32:54,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 14:32:54,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:32:54,565 INFO L124 PetriNetUnfolderBase]: 216/393 cut-off events. [2024-06-14 14:32:54,566 INFO L125 PetriNetUnfolderBase]: For 386/386 co-relation queries the response was YES. [2024-06-14 14:32:54,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1085 conditions, 393 events. 216/393 cut-off events. For 386/386 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1495 event pairs, 78 based on Foata normal form. 2/393 useless extension candidates. Maximal degree in co-relation 1067. Up to 352 conditions per place. [2024-06-14 14:32:54,572 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 37 selfloop transitions, 9 changer transitions 0/49 dead transitions. [2024-06-14 14:32:54,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 49 transitions, 265 flow [2024-06-14 14:32:54,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:32:54,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:32:54,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2024-06-14 14:32:54,575 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2024-06-14 14:32:54,575 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 123 flow. Second operand 6 states and 96 transitions. [2024-06-14 14:32:54,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 49 transitions, 265 flow [2024-06-14 14:32:54,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 49 transitions, 250 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-14 14:32:54,579 INFO L231 Difference]: Finished difference. Result has 42 places, 33 transitions, 147 flow [2024-06-14 14:32:54,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=147, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2024-06-14 14:32:54,581 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 10 predicate places. [2024-06-14 14:32:54,581 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 147 flow [2024-06-14 14:32:54,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:32:54,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:32:54,582 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:32:54,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-14 14:32:54,582 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:32:54,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:32:54,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1368585568, now seen corresponding path program 1 times [2024-06-14 14:32:54,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:32:54,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332777866] [2024-06-14 14:32:54,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:32:54,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:32:54,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:33:00,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:33:00,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:33:00,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332777866] [2024-06-14 14:33:00,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332777866] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:33:00,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:33:00,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:33:00,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399958916] [2024-06-14 14:33:00,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:33:00,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:33:00,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:33:00,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:33:00,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:33:00,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 14:33:00,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 147 flow. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:00,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:33:00,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 14:33:00,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:33:00,761 INFO L124 PetriNetUnfolderBase]: 213/388 cut-off events. [2024-06-14 14:33:00,761 INFO L125 PetriNetUnfolderBase]: For 580/580 co-relation queries the response was YES. [2024-06-14 14:33:00,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1154 conditions, 388 events. 213/388 cut-off events. For 580/580 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1452 event pairs, 57 based on Foata normal form. 2/388 useless extension candidates. Maximal degree in co-relation 1135. Up to 338 conditions per place. [2024-06-14 14:33:00,765 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 41 selfloop transitions, 11 changer transitions 0/55 dead transitions. [2024-06-14 14:33:00,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 55 transitions, 313 flow [2024-06-14 14:33:00,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:33:00,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:33:00,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2024-06-14 14:33:00,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-06-14 14:33:00,767 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 147 flow. Second operand 7 states and 110 transitions. [2024-06-14 14:33:00,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 55 transitions, 313 flow [2024-06-14 14:33:00,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 55 transitions, 292 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-14 14:33:00,774 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 171 flow [2024-06-14 14:33:00,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=171, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2024-06-14 14:33:00,776 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 13 predicate places. [2024-06-14 14:33:00,778 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 171 flow [2024-06-14 14:33:00,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:00,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:33:00,779 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:33:00,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-14 14:33:00,785 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:33:00,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:33:00,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1810801090, now seen corresponding path program 1 times [2024-06-14 14:33:00,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:33:00,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987994941] [2024-06-14 14:33:00,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:33:00,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:33:00,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:33:08,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:33:08,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:33:08,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987994941] [2024-06-14 14:33:08,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987994941] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:33:08,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:33:08,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 14:33:08,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923536150] [2024-06-14 14:33:08,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:33:08,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 14:33:08,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:33:08,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 14:33:08,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-14 14:33:08,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-14 14:33:08,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 171 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:08,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:33:08,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-14 14:33:08,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:33:09,219 INFO L124 PetriNetUnfolderBase]: 165/334 cut-off events. [2024-06-14 14:33:09,219 INFO L125 PetriNetUnfolderBase]: For 675/675 co-relation queries the response was YES. [2024-06-14 14:33:09,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1036 conditions, 334 events. 165/334 cut-off events. For 675/675 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1315 event pairs, 46 based on Foata normal form. 1/333 useless extension candidates. Maximal degree in co-relation 1016. Up to 291 conditions per place. [2024-06-14 14:33:09,222 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 30 selfloop transitions, 6 changer transitions 0/42 dead transitions. [2024-06-14 14:33:09,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 42 transitions, 261 flow [2024-06-14 14:33:09,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 14:33:09,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 14:33:09,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2024-06-14 14:33:09,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2024-06-14 14:33:09,224 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 171 flow. Second operand 5 states and 75 transitions. [2024-06-14 14:33:09,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 42 transitions, 261 flow [2024-06-14 14:33:09,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 42 transitions, 234 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-14 14:33:09,227 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 171 flow [2024-06-14 14:33:09,227 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=171, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2024-06-14 14:33:09,228 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 13 predicate places. [2024-06-14 14:33:09,228 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 171 flow [2024-06-14 14:33:09,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:09,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:33:09,228 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:33:09,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-14 14:33:09,229 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:33:09,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:33:09,229 INFO L85 PathProgramCache]: Analyzing trace with hash -300257916, now seen corresponding path program 1 times [2024-06-14 14:33:09,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:33:09,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095002840] [2024-06-14 14:33:09,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:33:09,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:33:09,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:33:17,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:33:17,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:33:17,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095002840] [2024-06-14 14:33:17,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095002840] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:33:17,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:33:17,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:33:17,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939985281] [2024-06-14 14:33:17,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:33:17,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:33:17,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:33:17,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:33:17,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:33:17,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-14 14:33:17,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 171 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:17,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:33:17,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-14 14:33:17,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:33:18,310 INFO L124 PetriNetUnfolderBase]: 161/328 cut-off events. [2024-06-14 14:33:18,310 INFO L125 PetriNetUnfolderBase]: For 826/826 co-relation queries the response was YES. [2024-06-14 14:33:18,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1053 conditions, 328 events. 161/328 cut-off events. For 826/826 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1281 event pairs, 44 based on Foata normal form. 2/328 useless extension candidates. Maximal degree in co-relation 1031. Up to 279 conditions per place. [2024-06-14 14:33:18,313 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 32 selfloop transitions, 8 changer transitions 0/46 dead transitions. [2024-06-14 14:33:18,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 46 transitions, 275 flow [2024-06-14 14:33:18,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:33:18,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:33:18,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2024-06-14 14:33:18,315 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-14 14:33:18,315 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 171 flow. Second operand 6 states and 88 transitions. [2024-06-14 14:33:18,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 46 transitions, 275 flow [2024-06-14 14:33:18,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 46 transitions, 264 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-14 14:33:18,318 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 193 flow [2024-06-14 14:33:18,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=193, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2024-06-14 14:33:18,318 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 16 predicate places. [2024-06-14 14:33:18,318 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 193 flow [2024-06-14 14:33:18,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:18,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:33:18,319 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:33:18,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-14 14:33:18,319 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:33:18,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:33:18,320 INFO L85 PathProgramCache]: Analyzing trace with hash -695099597, now seen corresponding path program 1 times [2024-06-14 14:33:18,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:33:18,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452387948] [2024-06-14 14:33:18,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:33:18,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:33:18,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:33:25,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:33:25,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:33:25,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452387948] [2024-06-14 14:33:25,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452387948] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:33:25,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:33:25,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:33:25,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614150734] [2024-06-14 14:33:25,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:33:25,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:33:25,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:33:25,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:33:25,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:33:25,178 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 14:33:25,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 193 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 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-06-14 14:33:25,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:33:25,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 14:33:25,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:33:25,600 INFO L124 PetriNetUnfolderBase]: 192/365 cut-off events. [2024-06-14 14:33:25,600 INFO L125 PetriNetUnfolderBase]: For 1180/1180 co-relation queries the response was YES. [2024-06-14 14:33:25,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1277 conditions, 365 events. 192/365 cut-off events. For 1180/1180 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1405 event pairs, 52 based on Foata normal form. 1/364 useless extension candidates. Maximal degree in co-relation 1254. Up to 328 conditions per place. [2024-06-14 14:33:25,604 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 37 selfloop transitions, 8 changer transitions 0/50 dead transitions. [2024-06-14 14:33:25,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 50 transitions, 313 flow [2024-06-14 14:33:25,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:33:25,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:33:25,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2024-06-14 14:33:25,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4292929292929293 [2024-06-14 14:33:25,606 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 193 flow. Second operand 6 states and 85 transitions. [2024-06-14 14:33:25,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 50 transitions, 313 flow [2024-06-14 14:33:25,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 50 transitions, 296 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-14 14:33:25,608 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 209 flow [2024-06-14 14:33:25,608 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=209, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2024-06-14 14:33:25,609 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 18 predicate places. [2024-06-14 14:33:25,609 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 209 flow [2024-06-14 14:33:25,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 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-06-14 14:33:25,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:33:25,610 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:33:25,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-14 14:33:25,610 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:33:25,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:33:25,610 INFO L85 PathProgramCache]: Analyzing trace with hash -718069667, now seen corresponding path program 2 times [2024-06-14 14:33:25,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:33:25,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111521030] [2024-06-14 14:33:25,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:33:25,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:33:25,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:33:32,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:33:32,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:33:32,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111521030] [2024-06-14 14:33:32,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111521030] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:33:32,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:33:32,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:33:32,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194191033] [2024-06-14 14:33:32,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:33:32,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:33:32,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:33:32,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:33:32,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:33:32,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 14:33:32,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 209 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 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-06-14 14:33:32,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:33:32,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 14:33:32,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:33:33,022 INFO L124 PetriNetUnfolderBase]: 190/363 cut-off events. [2024-06-14 14:33:33,023 INFO L125 PetriNetUnfolderBase]: For 1475/1481 co-relation queries the response was YES. [2024-06-14 14:33:33,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1330 conditions, 363 events. 190/363 cut-off events. For 1475/1481 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1388 event pairs, 56 based on Foata normal form. 5/365 useless extension candidates. Maximal degree in co-relation 1306. Up to 319 conditions per place. [2024-06-14 14:33:33,026 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 33 selfloop transitions, 11 changer transitions 0/49 dead transitions. [2024-06-14 14:33:33,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 49 transitions, 323 flow [2024-06-14 14:33:33,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:33:33,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:33:33,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2024-06-14 14:33:33,027 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-14 14:33:33,027 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 209 flow. Second operand 6 states and 84 transitions. [2024-06-14 14:33:33,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 49 transitions, 323 flow [2024-06-14 14:33:33,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 49 transitions, 306 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-14 14:33:33,030 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 235 flow [2024-06-14 14:33:33,030 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=235, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2024-06-14 14:33:33,031 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 20 predicate places. [2024-06-14 14:33:33,031 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 235 flow [2024-06-14 14:33:33,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 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-06-14 14:33:33,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:33:33,032 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:33:33,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-14 14:33:33,032 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:33:33,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:33:33,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1190347907, now seen corresponding path program 1 times [2024-06-14 14:33:33,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:33:33,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586625731] [2024-06-14 14:33:33,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:33:33,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:33:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:33:38,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:33:38,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:33:38,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586625731] [2024-06-14 14:33:38,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586625731] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:33:38,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:33:38,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:33:38,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253329498] [2024-06-14 14:33:38,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:33:38,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:33:38,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:33:38,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:33:38,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:33:38,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 14:33:38,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 235 flow. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:38,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:33:38,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 14:33:38,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:33:38,589 INFO L124 PetriNetUnfolderBase]: 202/370 cut-off events. [2024-06-14 14:33:38,589 INFO L125 PetriNetUnfolderBase]: For 1741/1741 co-relation queries the response was YES. [2024-06-14 14:33:38,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1407 conditions, 370 events. 202/370 cut-off events. For 1741/1741 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1340 event pairs, 30 based on Foata normal form. 4/372 useless extension candidates. Maximal degree in co-relation 1382. Up to 302 conditions per place. [2024-06-14 14:33:38,592 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 49 selfloop transitions, 12 changer transitions 0/64 dead transitions. [2024-06-14 14:33:38,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 64 transitions, 399 flow [2024-06-14 14:33:38,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:33:38,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:33:38,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 119 transitions. [2024-06-14 14:33:38,594 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45075757575757575 [2024-06-14 14:33:38,595 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 235 flow. Second operand 8 states and 119 transitions. [2024-06-14 14:33:38,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 64 transitions, 399 flow [2024-06-14 14:33:38,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 64 transitions, 372 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-14 14:33:38,598 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 224 flow [2024-06-14 14:33:38,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=224, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2024-06-14 14:33:38,600 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 23 predicate places. [2024-06-14 14:33:38,601 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 224 flow [2024-06-14 14:33:38,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:38,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:33:38,601 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:33:38,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-14 14:33:38,602 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:33:38,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:33:38,602 INFO L85 PathProgramCache]: Analyzing trace with hash 438863195, now seen corresponding path program 1 times [2024-06-14 14:33:38,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:33:38,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197532582] [2024-06-14 14:33:38,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:33:38,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:33:38,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:33:46,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:33:46,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:33:46,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197532582] [2024-06-14 14:33:46,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197532582] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:33:46,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:33:46,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:33:46,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95358123] [2024-06-14 14:33:46,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:33:46,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:33:46,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:33:46,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:33:46,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:33:46,284 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:33:46,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 224 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:46,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:33:46,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:33:46,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:33:46,699 INFO L124 PetriNetUnfolderBase]: 205/375 cut-off events. [2024-06-14 14:33:46,700 INFO L125 PetriNetUnfolderBase]: For 2049/2049 co-relation queries the response was YES. [2024-06-14 14:33:46,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1478 conditions, 375 events. 205/375 cut-off events. For 2049/2049 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1361 event pairs, 47 based on Foata normal form. 1/374 useless extension candidates. Maximal degree in co-relation 1453. Up to 340 conditions per place. [2024-06-14 14:33:46,704 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 44 selfloop transitions, 10 changer transitions 0/57 dead transitions. [2024-06-14 14:33:46,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 57 transitions, 376 flow [2024-06-14 14:33:46,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:33:46,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:33:46,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2024-06-14 14:33:46,705 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39826839826839827 [2024-06-14 14:33:46,705 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 224 flow. Second operand 7 states and 92 transitions. [2024-06-14 14:33:46,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 57 transitions, 376 flow [2024-06-14 14:33:46,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 57 transitions, 344 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-14 14:33:46,709 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 233 flow [2024-06-14 14:33:46,709 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=233, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2024-06-14 14:33:46,710 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 24 predicate places. [2024-06-14 14:33:46,710 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 233 flow [2024-06-14 14:33:46,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:46,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:33:46,710 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:33:46,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-14 14:33:46,711 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:33:46,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:33:46,711 INFO L85 PathProgramCache]: Analyzing trace with hash -158460479, now seen corresponding path program 1 times [2024-06-14 14:33:46,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:33:46,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840970219] [2024-06-14 14:33:46,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:33:46,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:33:46,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:33:54,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:33:54,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:33:54,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840970219] [2024-06-14 14:33:54,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840970219] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:33:54,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:33:54,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:33:54,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710455728] [2024-06-14 14:33:54,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:33:54,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:33:54,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:33:54,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:33:54,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:33:54,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-14 14:33:54,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 233 flow. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:54,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:33:54,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-14 14:33:54,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:33:54,916 INFO L124 PetriNetUnfolderBase]: 194/366 cut-off events. [2024-06-14 14:33:54,917 INFO L125 PetriNetUnfolderBase]: For 2430/2430 co-relation queries the response was YES. [2024-06-14 14:33:54,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1476 conditions, 366 events. 194/366 cut-off events. For 2430/2430 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1380 event pairs, 46 based on Foata normal form. 1/365 useless extension candidates. Maximal degree in co-relation 1449. Up to 322 conditions per place. [2024-06-14 14:33:54,920 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 40 selfloop transitions, 10 changer transitions 0/56 dead transitions. [2024-06-14 14:33:54,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 56 transitions, 367 flow [2024-06-14 14:33:54,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:33:54,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:33:54,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2024-06-14 14:33:54,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44155844155844154 [2024-06-14 14:33:54,922 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 233 flow. Second operand 7 states and 102 transitions. [2024-06-14 14:33:54,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 56 transitions, 367 flow [2024-06-14 14:33:54,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 56 transitions, 342 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-14 14:33:54,928 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 247 flow [2024-06-14 14:33:54,928 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=247, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2024-06-14 14:33:54,929 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 26 predicate places. [2024-06-14 14:33:54,930 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 247 flow [2024-06-14 14:33:54,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:54,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:33:54,930 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:33:54,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-14 14:33:54,930 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:33:54,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:33:54,931 INFO L85 PathProgramCache]: Analyzing trace with hash -158460727, now seen corresponding path program 2 times [2024-06-14 14:33:54,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:33:54,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106109012] [2024-06-14 14:33:54,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:33:54,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:33:54,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:34:01,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:34:01,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:34:01,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106109012] [2024-06-14 14:34:01,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106109012] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:34:01,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:34:01,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:34:01,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45265730] [2024-06-14 14:34:01,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:34:01,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:34:01,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:34:01,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:34:01,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:34:02,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:34:02,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 247 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:02,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:34:02,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:34:02,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:34:02,433 INFO L124 PetriNetUnfolderBase]: 211/385 cut-off events. [2024-06-14 14:34:02,433 INFO L125 PetriNetUnfolderBase]: For 2879/2879 co-relation queries the response was YES. [2024-06-14 14:34:02,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1631 conditions, 385 events. 211/385 cut-off events. For 2879/2879 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1401 event pairs, 46 based on Foata normal form. 1/384 useless extension candidates. Maximal degree in co-relation 1603. Up to 344 conditions per place. [2024-06-14 14:34:02,436 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 42 selfloop transitions, 13 changer transitions 0/58 dead transitions. [2024-06-14 14:34:02,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 58 transitions, 397 flow [2024-06-14 14:34:02,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:34:02,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:34:02,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2024-06-14 14:34:02,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2024-06-14 14:34:02,438 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 247 flow. Second operand 7 states and 91 transitions. [2024-06-14 14:34:02,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 58 transitions, 397 flow [2024-06-14 14:34:02,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 58 transitions, 374 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-14 14:34:02,442 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 275 flow [2024-06-14 14:34:02,442 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=275, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2024-06-14 14:34:02,443 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 28 predicate places. [2024-06-14 14:34:02,443 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 275 flow [2024-06-14 14:34:02,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:02,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:34:02,443 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:34:02,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-14 14:34:02,444 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:34:02,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:34:02,444 INFO L85 PathProgramCache]: Analyzing trace with hash 77714881, now seen corresponding path program 2 times [2024-06-14 14:34:02,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:34:02,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860444118] [2024-06-14 14:34:02,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:34:02,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:34:02,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:34:10,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:34:10,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:34:10,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860444118] [2024-06-14 14:34:10,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860444118] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:34:10,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:34:10,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:34:10,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124333841] [2024-06-14 14:34:10,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:34:10,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:34:10,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:34:10,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:34:10,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:34:11,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-14 14:34:11,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 275 flow. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:11,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:34:11,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-14 14:34:11,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:34:11,325 INFO L124 PetriNetUnfolderBase]: 200/377 cut-off events. [2024-06-14 14:34:11,325 INFO L125 PetriNetUnfolderBase]: For 3371/3374 co-relation queries the response was YES. [2024-06-14 14:34:11,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1652 conditions, 377 events. 200/377 cut-off events. For 3371/3374 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1420 event pairs, 50 based on Foata normal form. 3/377 useless extension candidates. Maximal degree in co-relation 1623. Up to 324 conditions per place. [2024-06-14 14:34:11,329 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 37 selfloop transitions, 13 changer transitions 0/57 dead transitions. [2024-06-14 14:34:11,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 57 transitions, 405 flow [2024-06-14 14:34:11,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:34:11,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:34:11,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2024-06-14 14:34:11,330 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43722943722943725 [2024-06-14 14:34:11,330 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 275 flow. Second operand 7 states and 101 transitions. [2024-06-14 14:34:11,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 57 transitions, 405 flow [2024-06-14 14:34:11,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 57 transitions, 370 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-14 14:34:11,334 INFO L231 Difference]: Finished difference. Result has 62 places, 50 transitions, 289 flow [2024-06-14 14:34:11,334 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=289, PETRI_PLACES=62, PETRI_TRANSITIONS=50} [2024-06-14 14:34:11,335 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 30 predicate places. [2024-06-14 14:34:11,335 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 50 transitions, 289 flow [2024-06-14 14:34:11,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:11,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:34:11,335 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:34:11,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-14 14:34:11,336 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:34:11,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:34:11,336 INFO L85 PathProgramCache]: Analyzing trace with hash 77714633, now seen corresponding path program 3 times [2024-06-14 14:34:11,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:34:11,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673751982] [2024-06-14 14:34:11,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:34:11,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:34:11,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:34:17,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:34:17,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:34:17,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673751982] [2024-06-14 14:34:17,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673751982] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:34:17,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:34:17,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:34:17,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178056045] [2024-06-14 14:34:17,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:34:17,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:34:17,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:34:17,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:34:17,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:34:17,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:34:17,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 50 transitions, 289 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:17,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:34:17,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:34:17,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:34:18,232 INFO L124 PetriNetUnfolderBase]: 212/388 cut-off events. [2024-06-14 14:34:18,232 INFO L125 PetriNetUnfolderBase]: For 3810/3813 co-relation queries the response was YES. [2024-06-14 14:34:18,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1765 conditions, 388 events. 212/388 cut-off events. For 3810/3813 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1430 event pairs, 54 based on Foata normal form. 1/386 useless extension candidates. Maximal degree in co-relation 1735. Up to 337 conditions per place. [2024-06-14 14:34:18,236 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 39 selfloop transitions, 17 changer transitions 0/59 dead transitions. [2024-06-14 14:34:18,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 59 transitions, 437 flow [2024-06-14 14:34:18,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:34:18,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:34:18,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2024-06-14 14:34:18,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38961038961038963 [2024-06-14 14:34:18,237 INFO L175 Difference]: Start difference. First operand has 62 places, 50 transitions, 289 flow. Second operand 7 states and 90 transitions. [2024-06-14 14:34:18,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 59 transitions, 437 flow [2024-06-14 14:34:18,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 59 transitions, 404 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-14 14:34:18,241 INFO L231 Difference]: Finished difference. Result has 64 places, 52 transitions, 319 flow [2024-06-14 14:34:18,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=319, PETRI_PLACES=64, PETRI_TRANSITIONS=52} [2024-06-14 14:34:18,242 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 32 predicate places. [2024-06-14 14:34:18,242 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 52 transitions, 319 flow [2024-06-14 14:34:18,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:18,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:34:18,243 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:34:18,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-14 14:34:18,243 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:34:18,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:34:18,244 INFO L85 PathProgramCache]: Analyzing trace with hash 77723251, now seen corresponding path program 3 times [2024-06-14 14:34:18,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:34:18,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17996556] [2024-06-14 14:34:18,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:34:18,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:34:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:34:26,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:34:26,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:34:26,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17996556] [2024-06-14 14:34:26,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17996556] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:34:26,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:34:26,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:34:26,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785601231] [2024-06-14 14:34:26,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:34:26,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:34:26,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:34:26,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:34:26,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:34:26,888 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-14 14:34:26,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 319 flow. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:26,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:34:26,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-14 14:34:26,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:34:27,102 INFO L124 PetriNetUnfolderBase]: 196/371 cut-off events. [2024-06-14 14:34:27,102 INFO L125 PetriNetUnfolderBase]: For 4146/4149 co-relation queries the response was YES. [2024-06-14 14:34:27,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1719 conditions, 371 events. 196/371 cut-off events. For 4146/4149 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1408 event pairs, 50 based on Foata normal form. 3/371 useless extension candidates. Maximal degree in co-relation 1688. Up to 310 conditions per place. [2024-06-14 14:34:27,106 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 37 selfloop transitions, 18 changer transitions 0/63 dead transitions. [2024-06-14 14:34:27,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 63 transitions, 473 flow [2024-06-14 14:34:27,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:34:27,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:34:27,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2024-06-14 14:34:27,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44155844155844154 [2024-06-14 14:34:27,107 INFO L175 Difference]: Start difference. First operand has 64 places, 52 transitions, 319 flow. Second operand 7 states and 102 transitions. [2024-06-14 14:34:27,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 63 transitions, 473 flow [2024-06-14 14:34:27,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 63 transitions, 426 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-14 14:34:27,112 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 356 flow [2024-06-14 14:34:27,112 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=356, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2024-06-14 14:34:27,113 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 35 predicate places. [2024-06-14 14:34:27,113 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 356 flow [2024-06-14 14:34:27,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:27,113 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:34:27,114 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:34:27,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-14 14:34:27,114 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:34:27,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:34:27,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1092068992, now seen corresponding path program 1 times [2024-06-14 14:34:27,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:34:27,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142111204] [2024-06-14 14:34:27,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:34:27,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:34:27,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:34:34,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:34:34,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:34:34,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142111204] [2024-06-14 14:34:34,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142111204] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:34:34,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:34:34,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:34:34,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421807044] [2024-06-14 14:34:34,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:34:34,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:34:34,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:34:34,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:34:34,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:34:34,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:34:34,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 356 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:34,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:34:34,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:34:34,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:34:35,218 INFO L124 PetriNetUnfolderBase]: 236/434 cut-off events. [2024-06-14 14:34:35,218 INFO L125 PetriNetUnfolderBase]: For 5069/5069 co-relation queries the response was YES. [2024-06-14 14:34:35,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2060 conditions, 434 events. 236/434 cut-off events. For 5069/5069 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1666 event pairs, 46 based on Foata normal form. 2/434 useless extension candidates. Maximal degree in co-relation 2027. Up to 363 conditions per place. [2024-06-14 14:34:35,222 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 61 selfloop transitions, 20 changer transitions 0/84 dead transitions. [2024-06-14 14:34:35,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 84 transitions, 640 flow [2024-06-14 14:34:35,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:34:35,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:34:35,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-14 14:34:35,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2024-06-14 14:34:35,224 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 356 flow. Second operand 9 states and 117 transitions. [2024-06-14 14:34:35,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 84 transitions, 640 flow [2024-06-14 14:34:35,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 84 transitions, 610 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-14 14:34:35,231 INFO L231 Difference]: Finished difference. Result has 76 places, 68 transitions, 470 flow [2024-06-14 14:34:35,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=470, PETRI_PLACES=76, PETRI_TRANSITIONS=68} [2024-06-14 14:34:35,232 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 44 predicate places. [2024-06-14 14:34:35,232 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 68 transitions, 470 flow [2024-06-14 14:34:35,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:35,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:34:35,232 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:34:35,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-14 14:34:35,233 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:34:35,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:34:35,233 INFO L85 PathProgramCache]: Analyzing trace with hash -623028352, now seen corresponding path program 2 times [2024-06-14 14:34:35,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:34:35,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119109570] [2024-06-14 14:34:35,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:34:35,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:34:35,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:34:42,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:34:42,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:34:42,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119109570] [2024-06-14 14:34:42,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119109570] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:34:42,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:34:42,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:34:42,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661421469] [2024-06-14 14:34:42,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:34:42,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:34:42,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:34:42,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:34:42,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:34:42,438 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:34:42,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 68 transitions, 470 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:42,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:34:42,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:34:42,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:34:42,934 INFO L124 PetriNetUnfolderBase]: 242/445 cut-off events. [2024-06-14 14:34:42,934 INFO L125 PetriNetUnfolderBase]: For 5832/5832 co-relation queries the response was YES. [2024-06-14 14:34:42,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2268 conditions, 445 events. 242/445 cut-off events. For 5832/5832 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1717 event pairs, 45 based on Foata normal form. 2/445 useless extension candidates. Maximal degree in co-relation 2230. Up to 365 conditions per place. [2024-06-14 14:34:42,938 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 61 selfloop transitions, 23 changer transitions 0/87 dead transitions. [2024-06-14 14:34:42,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 87 transitions, 714 flow [2024-06-14 14:34:42,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:34:42,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:34:42,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 106 transitions. [2024-06-14 14:34:42,940 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4015151515151515 [2024-06-14 14:34:42,940 INFO L175 Difference]: Start difference. First operand has 76 places, 68 transitions, 470 flow. Second operand 8 states and 106 transitions. [2024-06-14 14:34:42,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 87 transitions, 714 flow [2024-06-14 14:34:42,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 87 transitions, 681 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-14 14:34:42,947 INFO L231 Difference]: Finished difference. Result has 81 places, 70 transitions, 518 flow [2024-06-14 14:34:42,947 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=518, PETRI_PLACES=81, PETRI_TRANSITIONS=70} [2024-06-14 14:34:42,948 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 49 predicate places. [2024-06-14 14:34:42,948 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 70 transitions, 518 flow [2024-06-14 14:34:42,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:42,948 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:34:42,948 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:34:42,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-14 14:34:42,949 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:34:42,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:34:42,949 INFO L85 PathProgramCache]: Analyzing trace with hash -622878622, now seen corresponding path program 3 times [2024-06-14 14:34:42,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:34:42,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066166272] [2024-06-14 14:34:42,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:34:42,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:34:42,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:34:49,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:34:49,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:34:49,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066166272] [2024-06-14 14:34:49,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066166272] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:34:49,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:34:49,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:34:49,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359196195] [2024-06-14 14:34:49,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:34:49,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:34:49,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:34:49,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:34:49,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:34:49,922 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:34:49,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 70 transitions, 518 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:49,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:34:49,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:34:49,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:34:50,383 INFO L124 PetriNetUnfolderBase]: 248/458 cut-off events. [2024-06-14 14:34:50,384 INFO L125 PetriNetUnfolderBase]: For 6664/6664 co-relation queries the response was YES. [2024-06-14 14:34:50,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2415 conditions, 458 events. 248/458 cut-off events. For 6664/6664 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1810 event pairs, 48 based on Foata normal form. 2/458 useless extension candidates. Maximal degree in co-relation 2376. Up to 362 conditions per place. [2024-06-14 14:34:50,388 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 59 selfloop transitions, 25 changer transitions 0/87 dead transitions. [2024-06-14 14:34:50,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 87 transitions, 758 flow [2024-06-14 14:34:50,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:34:50,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:34:50,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 106 transitions. [2024-06-14 14:34:50,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4015151515151515 [2024-06-14 14:34:50,395 INFO L175 Difference]: Start difference. First operand has 81 places, 70 transitions, 518 flow. Second operand 8 states and 106 transitions. [2024-06-14 14:34:50,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 87 transitions, 758 flow [2024-06-14 14:34:50,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 87 transitions, 695 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-14 14:34:50,406 INFO L231 Difference]: Finished difference. Result has 83 places, 72 transitions, 540 flow [2024-06-14 14:34:50,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=540, PETRI_PLACES=83, PETRI_TRANSITIONS=72} [2024-06-14 14:34:50,406 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 51 predicate places. [2024-06-14 14:34:50,406 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 72 transitions, 540 flow [2024-06-14 14:34:50,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:50,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:34:50,407 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:34:50,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-14 14:34:50,408 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:34:50,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:34:50,408 INFO L85 PathProgramCache]: Analyzing trace with hash -622878405, now seen corresponding path program 1 times [2024-06-14 14:34:50,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:34:50,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028359006] [2024-06-14 14:34:50,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:34:50,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:34:50,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:34:59,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:34:59,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:34:59,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028359006] [2024-06-14 14:34:59,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028359006] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:34:59,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:34:59,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:34:59,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627507798] [2024-06-14 14:34:59,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:34:59,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:34:59,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:34:59,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:34:59,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:34:59,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:34:59,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 72 transitions, 540 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:59,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:34:59,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:34:59,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:34:59,693 INFO L124 PetriNetUnfolderBase]: 251/462 cut-off events. [2024-06-14 14:34:59,693 INFO L125 PetriNetUnfolderBase]: For 6524/6524 co-relation queries the response was YES. [2024-06-14 14:34:59,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2418 conditions, 462 events. 251/462 cut-off events. For 6524/6524 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1821 event pairs, 44 based on Foata normal form. 1/461 useless extension candidates. Maximal degree in co-relation 2378. Up to 403 conditions per place. [2024-06-14 14:34:59,696 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 68 selfloop transitions, 17 changer transitions 0/88 dead transitions. [2024-06-14 14:34:59,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 88 transitions, 772 flow [2024-06-14 14:34:59,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:34:59,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:34:59,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2024-06-14 14:34:59,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2024-06-14 14:34:59,699 INFO L175 Difference]: Start difference. First operand has 83 places, 72 transitions, 540 flow. Second operand 8 states and 102 transitions. [2024-06-14 14:34:59,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 88 transitions, 772 flow [2024-06-14 14:34:59,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 88 transitions, 707 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-14 14:34:59,707 INFO L231 Difference]: Finished difference. Result has 85 places, 74 transitions, 536 flow [2024-06-14 14:34:59,707 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=536, PETRI_PLACES=85, PETRI_TRANSITIONS=74} [2024-06-14 14:34:59,708 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 53 predicate places. [2024-06-14 14:34:59,708 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 74 transitions, 536 flow [2024-06-14 14:34:59,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:59,708 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:34:59,708 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:34:59,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-14 14:34:59,709 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:34:59,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:34:59,709 INFO L85 PathProgramCache]: Analyzing trace with hash -617314215, now seen corresponding path program 2 times [2024-06-14 14:34:59,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:34:59,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642255790] [2024-06-14 14:34:59,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:34:59,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:34:59,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:35:08,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:35:08,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:35:08,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642255790] [2024-06-14 14:35:08,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642255790] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:35:08,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:35:08,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:35:08,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293979309] [2024-06-14 14:35:08,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:35:08,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:35:08,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:35:08,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:35:08,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:35:08,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:35:08,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 74 transitions, 536 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:08,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:35:08,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:35:08,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:35:09,246 INFO L124 PetriNetUnfolderBase]: 254/467 cut-off events. [2024-06-14 14:35:09,247 INFO L125 PetriNetUnfolderBase]: For 7015/7015 co-relation queries the response was YES. [2024-06-14 14:35:09,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2466 conditions, 467 events. 254/467 cut-off events. For 7015/7015 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1848 event pairs, 46 based on Foata normal form. 1/466 useless extension candidates. Maximal degree in co-relation 2425. Up to 400 conditions per place. [2024-06-14 14:35:09,251 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 65 selfloop transitions, 19 changer transitions 0/87 dead transitions. [2024-06-14 14:35:09,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 87 transitions, 758 flow [2024-06-14 14:35:09,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:35:09,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:35:09,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2024-06-14 14:35:09,253 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38257575757575757 [2024-06-14 14:35:09,253 INFO L175 Difference]: Start difference. First operand has 85 places, 74 transitions, 536 flow. Second operand 8 states and 101 transitions. [2024-06-14 14:35:09,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 87 transitions, 758 flow [2024-06-14 14:35:09,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 87 transitions, 713 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-14 14:35:09,260 INFO L231 Difference]: Finished difference. Result has 87 places, 76 transitions, 560 flow [2024-06-14 14:35:09,260 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=560, PETRI_PLACES=87, PETRI_TRANSITIONS=76} [2024-06-14 14:35:09,261 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 55 predicate places. [2024-06-14 14:35:09,261 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 76 transitions, 560 flow [2024-06-14 14:35:09,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:09,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:35:09,262 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:35:09,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-14 14:35:09,262 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:35:09,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:35:09,262 INFO L85 PathProgramCache]: Analyzing trace with hash -617314432, now seen corresponding path program 4 times [2024-06-14 14:35:09,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:35:09,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194540985] [2024-06-14 14:35:09,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:35:09,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:35:09,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:35:16,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:35:16,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:35:16,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194540985] [2024-06-14 14:35:16,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194540985] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:35:16,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:35:16,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:35:16,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053411111] [2024-06-14 14:35:16,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:35:16,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:35:16,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:35:16,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:35:16,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:35:16,275 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:35:16,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 76 transitions, 560 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:16,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:35:16,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:35:16,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:35:16,671 INFO L124 PetriNetUnfolderBase]: 260/480 cut-off events. [2024-06-14 14:35:16,671 INFO L125 PetriNetUnfolderBase]: For 8092/8092 co-relation queries the response was YES. [2024-06-14 14:35:16,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2587 conditions, 480 events. 260/480 cut-off events. For 8092/8092 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1917 event pairs, 51 based on Foata normal form. 2/480 useless extension candidates. Maximal degree in co-relation 2545. Up to 368 conditions per place. [2024-06-14 14:35:16,674 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 59 selfloop transitions, 28 changer transitions 0/90 dead transitions. [2024-06-14 14:35:16,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 90 transitions, 794 flow [2024-06-14 14:35:16,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:35:16,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:35:16,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2024-06-14 14:35:16,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3977272727272727 [2024-06-14 14:35:16,678 INFO L175 Difference]: Start difference. First operand has 87 places, 76 transitions, 560 flow. Second operand 8 states and 105 transitions. [2024-06-14 14:35:16,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 90 transitions, 794 flow [2024-06-14 14:35:16,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 90 transitions, 741 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-14 14:35:16,687 INFO L231 Difference]: Finished difference. Result has 89 places, 78 transitions, 598 flow [2024-06-14 14:35:16,687 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=598, PETRI_PLACES=89, PETRI_TRANSITIONS=78} [2024-06-14 14:35:16,688 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 57 predicate places. [2024-06-14 14:35:16,688 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 78 transitions, 598 flow [2024-06-14 14:35:16,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:16,689 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:35:16,689 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:35:16,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-14 14:35:16,689 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:35:16,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:35:16,690 INFO L85 PathProgramCache]: Analyzing trace with hash -617306775, now seen corresponding path program 3 times [2024-06-14 14:35:16,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:35:16,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666937136] [2024-06-14 14:35:16,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:35:16,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:35:16,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:35:26,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-06-14 14:35:26,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:35:26,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666937136] [2024-06-14 14:35:26,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666937136] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:35:26,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:35:26,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:35:26,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903083149] [2024-06-14 14:35:26,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:35:26,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:35:26,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:35:26,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:35:26,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:35:26,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:35:26,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 78 transitions, 598 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:26,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:35:26,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:35:26,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:35:26,812 INFO L124 PetriNetUnfolderBase]: 263/484 cut-off events. [2024-06-14 14:35:26,813 INFO L125 PetriNetUnfolderBase]: For 8744/8744 co-relation queries the response was YES. [2024-06-14 14:35:26,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2698 conditions, 484 events. 263/484 cut-off events. For 8744/8744 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1930 event pairs, 46 based on Foata normal form. 1/483 useless extension candidates. Maximal degree in co-relation 2655. Up to 406 conditions per place. [2024-06-14 14:35:26,816 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 64 selfloop transitions, 24 changer transitions 0/91 dead transitions. [2024-06-14 14:35:26,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 91 transitions, 832 flow [2024-06-14 14:35:26,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:35:26,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:35:26,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2024-06-14 14:35:26,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2024-06-14 14:35:26,817 INFO L175 Difference]: Start difference. First operand has 89 places, 78 transitions, 598 flow. Second operand 8 states and 102 transitions. [2024-06-14 14:35:26,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 91 transitions, 832 flow [2024-06-14 14:35:26,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 91 transitions, 757 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-14 14:35:26,824 INFO L231 Difference]: Finished difference. Result has 91 places, 80 transitions, 606 flow [2024-06-14 14:35:26,824 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=606, PETRI_PLACES=91, PETRI_TRANSITIONS=80} [2024-06-14 14:35:26,825 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 59 predicate places. [2024-06-14 14:35:26,825 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 80 transitions, 606 flow [2024-06-14 14:35:26,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:26,825 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:35:26,826 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:35:26,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-14 14:35:26,826 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:35:26,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:35:26,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1168317022, now seen corresponding path program 1 times [2024-06-14 14:35:26,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:35:26,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601000694] [2024-06-14 14:35:26,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:35:26,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:35:26,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:35:35,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:35:35,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:35:35,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601000694] [2024-06-14 14:35:35,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601000694] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:35:35,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:35:35,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:35:35,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841837069] [2024-06-14 14:35:35,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:35:35,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:35:35,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:35:35,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:35:35,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:35:36,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 14:35:36,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 80 transitions, 606 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:36,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:35:36,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 14:35:36,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:35:36,431 INFO L124 PetriNetUnfolderBase]: 250/472 cut-off events. [2024-06-14 14:35:36,431 INFO L125 PetriNetUnfolderBase]: For 9655/9659 co-relation queries the response was YES. [2024-06-14 14:35:36,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2617 conditions, 472 events. 250/472 cut-off events. For 9655/9659 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1961 event pairs, 43 based on Foata normal form. 6/476 useless extension candidates. Maximal degree in co-relation 2573. Up to 396 conditions per place. [2024-06-14 14:35:36,436 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 68 selfloop transitions, 14 changer transitions 0/94 dead transitions. [2024-06-14 14:35:36,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 94 transitions, 822 flow [2024-06-14 14:35:36,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:35:36,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:35:36,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2024-06-14 14:35:36,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4053030303030303 [2024-06-14 14:35:36,438 INFO L175 Difference]: Start difference. First operand has 91 places, 80 transitions, 606 flow. Second operand 8 states and 107 transitions. [2024-06-14 14:35:36,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 94 transitions, 822 flow [2024-06-14 14:35:36,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 94 transitions, 755 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-14 14:35:36,448 INFO L231 Difference]: Finished difference. Result has 93 places, 82 transitions, 594 flow [2024-06-14 14:35:36,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=594, PETRI_PLACES=93, PETRI_TRANSITIONS=82} [2024-06-14 14:35:36,448 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 61 predicate places. [2024-06-14 14:35:36,448 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 82 transitions, 594 flow [2024-06-14 14:35:36,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:36,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:35:36,449 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:35:36,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-14 14:35:36,449 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:35:36,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:35:36,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1876608158, now seen corresponding path program 2 times [2024-06-14 14:35:36,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:35:36,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55963395] [2024-06-14 14:35:36,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:35:36,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:35:36,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:35:46,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:35:46,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:35:46,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55963395] [2024-06-14 14:35:46,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55963395] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:35:46,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:35:46,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:35:46,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447386250] [2024-06-14 14:35:46,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:35:46,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:35:46,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:35:46,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:35:46,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:35:46,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 14:35:46,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 82 transitions, 594 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:46,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:35:46,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 14:35:46,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:35:46,504 INFO L124 PetriNetUnfolderBase]: 258/486 cut-off events. [2024-06-14 14:35:46,505 INFO L125 PetriNetUnfolderBase]: For 10446/10453 co-relation queries the response was YES. [2024-06-14 14:35:46,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2736 conditions, 486 events. 258/486 cut-off events. For 10446/10453 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2007 event pairs, 45 based on Foata normal form. 7/489 useless extension candidates. Maximal degree in co-relation 2691. Up to 383 conditions per place. [2024-06-14 14:35:46,508 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 64 selfloop transitions, 25 changer transitions 0/101 dead transitions. [2024-06-14 14:35:46,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 101 transitions, 971 flow [2024-06-14 14:35:46,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:35:46,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:35:46,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 110 transitions. [2024-06-14 14:35:46,510 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-14 14:35:46,510 INFO L175 Difference]: Start difference. First operand has 93 places, 82 transitions, 594 flow. Second operand 8 states and 110 transitions. [2024-06-14 14:35:46,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 101 transitions, 971 flow [2024-06-14 14:35:46,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 101 transitions, 919 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-14 14:35:46,518 INFO L231 Difference]: Finished difference. Result has 96 places, 90 transitions, 692 flow [2024-06-14 14:35:46,518 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=692, PETRI_PLACES=96, PETRI_TRANSITIONS=90} [2024-06-14 14:35:46,518 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 64 predicate places. [2024-06-14 14:35:46,518 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 90 transitions, 692 flow [2024-06-14 14:35:46,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:46,519 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:35:46,519 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:35:46,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-14 14:35:46,519 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:35:46,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:35:46,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1434014023, now seen corresponding path program 4 times [2024-06-14 14:35:46,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:35:46,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347473997] [2024-06-14 14:35:46,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:35:46,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:35:46,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:35:55,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:35:55,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:35:55,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347473997] [2024-06-14 14:35:55,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347473997] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:35:55,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:35:55,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:35:55,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594494801] [2024-06-14 14:35:55,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:35:55,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:35:55,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:35:55,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:35:55,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:35:55,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:35:55,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 90 transitions, 692 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:55,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:35:55,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:35:55,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:35:55,633 INFO L124 PetriNetUnfolderBase]: 280/513 cut-off events. [2024-06-14 14:35:55,633 INFO L125 PetriNetUnfolderBase]: For 11259/11262 co-relation queries the response was YES. [2024-06-14 14:35:55,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3007 conditions, 513 events. 280/513 cut-off events. For 11259/11262 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2072 event pairs, 51 based on Foata normal form. 1/509 useless extension candidates. Maximal degree in co-relation 2960. Up to 407 conditions per place. [2024-06-14 14:35:55,641 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 66 selfloop transitions, 35 changer transitions 0/104 dead transitions. [2024-06-14 14:35:55,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 104 transitions, 1030 flow [2024-06-14 14:35:55,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:35:55,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:35:55,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-06-14 14:35:55,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39015151515151514 [2024-06-14 14:35:55,644 INFO L175 Difference]: Start difference. First operand has 96 places, 90 transitions, 692 flow. Second operand 8 states and 103 transitions. [2024-06-14 14:35:55,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 104 transitions, 1030 flow [2024-06-14 14:35:55,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 104 transitions, 998 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-14 14:35:55,662 INFO L231 Difference]: Finished difference. Result has 101 places, 94 transitions, 799 flow [2024-06-14 14:35:55,662 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=799, PETRI_PLACES=101, PETRI_TRANSITIONS=94} [2024-06-14 14:35:55,663 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 69 predicate places. [2024-06-14 14:35:55,663 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 94 transitions, 799 flow [2024-06-14 14:35:55,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:55,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:35:55,663 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:35:55,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-14 14:35:55,664 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:35:55,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:35:55,664 INFO L85 PathProgramCache]: Analyzing trace with hash 63482011, now seen corresponding path program 5 times [2024-06-14 14:35:55,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:35:55,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950761581] [2024-06-14 14:35:55,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:35:55,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:35:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:36:03,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:36:03,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:36:03,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950761581] [2024-06-14 14:36:03,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950761581] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:36:03,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:36:03,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:36:03,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866534496] [2024-06-14 14:36:03,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:36:03,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:36:03,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:36:03,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:36:03,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:36:04,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:36:04,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 94 transitions, 799 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:04,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:36:04,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:36:04,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:36:04,374 INFO L124 PetriNetUnfolderBase]: 283/518 cut-off events. [2024-06-14 14:36:04,374 INFO L125 PetriNetUnfolderBase]: For 12315/12318 co-relation queries the response was YES. [2024-06-14 14:36:04,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3166 conditions, 518 events. 283/518 cut-off events. For 12315/12318 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2095 event pairs, 51 based on Foata normal form. 1/514 useless extension candidates. Maximal degree in co-relation 3117. Up to 432 conditions per place. [2024-06-14 14:36:04,379 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 77 selfloop transitions, 26 changer transitions 0/106 dead transitions. [2024-06-14 14:36:04,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 106 transitions, 1117 flow [2024-06-14 14:36:04,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:36:04,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:36:04,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-06-14 14:36:04,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39015151515151514 [2024-06-14 14:36:04,381 INFO L175 Difference]: Start difference. First operand has 101 places, 94 transitions, 799 flow. Second operand 8 states and 103 transitions. [2024-06-14 14:36:04,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 106 transitions, 1117 flow [2024-06-14 14:36:04,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 106 transitions, 1060 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-06-14 14:36:04,396 INFO L231 Difference]: Finished difference. Result has 105 places, 96 transitions, 833 flow [2024-06-14 14:36:04,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=833, PETRI_PLACES=105, PETRI_TRANSITIONS=96} [2024-06-14 14:36:04,397 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 73 predicate places. [2024-06-14 14:36:04,397 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 96 transitions, 833 flow [2024-06-14 14:36:04,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:04,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:36:04,398 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:36:04,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-14 14:36:04,398 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:36:04,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:36:04,399 INFO L85 PathProgramCache]: Analyzing trace with hash 63474571, now seen corresponding path program 6 times [2024-06-14 14:36:04,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:36:04,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906737826] [2024-06-14 14:36:04,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:36:04,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:36:04,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:36:12,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:36:12,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:36:12,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906737826] [2024-06-14 14:36:12,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906737826] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:36:12,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:36:12,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:36:12,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911309540] [2024-06-14 14:36:12,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:36:12,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:36:12,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:36:12,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:36:12,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:36:12,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:36:12,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 96 transitions, 833 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:12,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:36:12,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:36:12,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:36:12,562 INFO L124 PetriNetUnfolderBase]: 281/515 cut-off events. [2024-06-14 14:36:12,563 INFO L125 PetriNetUnfolderBase]: For 12719/12722 co-relation queries the response was YES. [2024-06-14 14:36:12,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3164 conditions, 515 events. 281/515 cut-off events. For 12719/12722 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2075 event pairs, 50 based on Foata normal form. 1/511 useless extension candidates. Maximal degree in co-relation 3113. Up to 436 conditions per place. [2024-06-14 14:36:12,566 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 79 selfloop transitions, 23 changer transitions 0/105 dead transitions. [2024-06-14 14:36:12,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 105 transitions, 1063 flow [2024-06-14 14:36:12,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:36:12,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:36:12,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2024-06-14 14:36:12,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3787878787878788 [2024-06-14 14:36:12,569 INFO L175 Difference]: Start difference. First operand has 105 places, 96 transitions, 833 flow. Second operand 8 states and 100 transitions. [2024-06-14 14:36:12,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 105 transitions, 1063 flow [2024-06-14 14:36:12,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 105 transitions, 952 flow, removed 24 selfloop flow, removed 6 redundant places. [2024-06-14 14:36:12,583 INFO L231 Difference]: Finished difference. Result has 107 places, 96 transitions, 773 flow [2024-06-14 14:36:12,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=773, PETRI_PLACES=107, PETRI_TRANSITIONS=96} [2024-06-14 14:36:12,583 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 75 predicate places. [2024-06-14 14:36:12,583 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 96 transitions, 773 flow [2024-06-14 14:36:12,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:12,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:36:12,584 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:36:12,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-14 14:36:12,584 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:36:12,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:36:12,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1876281728, now seen corresponding path program 3 times [2024-06-14 14:36:12,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:36:12,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287421064] [2024-06-14 14:36:12,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:36:12,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:36:12,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:36:21,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:36:21,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:36:21,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287421064] [2024-06-14 14:36:21,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287421064] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:36:21,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:36:21,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:36:21,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736588590] [2024-06-14 14:36:21,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:36:21,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:36:21,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:36:21,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:36:21,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:36:22,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 14:36:22,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 96 transitions, 773 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:22,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:36:22,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 14:36:22,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:36:22,442 INFO L124 PetriNetUnfolderBase]: 260/488 cut-off events. [2024-06-14 14:36:22,442 INFO L125 PetriNetUnfolderBase]: For 13184/13189 co-relation queries the response was YES. [2024-06-14 14:36:22,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2933 conditions, 488 events. 260/488 cut-off events. For 13184/13189 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2022 event pairs, 46 based on Foata normal form. 4/488 useless extension candidates. Maximal degree in co-relation 2881. Up to 423 conditions per place. [2024-06-14 14:36:22,446 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 78 selfloop transitions, 12 changer transitions 0/105 dead transitions. [2024-06-14 14:36:22,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 105 transitions, 978 flow [2024-06-14 14:36:22,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:36:22,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:36:22,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-06-14 14:36:22,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39015151515151514 [2024-06-14 14:36:22,448 INFO L175 Difference]: Start difference. First operand has 107 places, 96 transitions, 773 flow. Second operand 8 states and 103 transitions. [2024-06-14 14:36:22,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 105 transitions, 978 flow [2024-06-14 14:36:22,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 105 transitions, 901 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-14 14:36:22,467 INFO L231 Difference]: Finished difference. Result has 108 places, 97 transitions, 735 flow [2024-06-14 14:36:22,467 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=735, PETRI_PLACES=108, PETRI_TRANSITIONS=97} [2024-06-14 14:36:22,468 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 76 predicate places. [2024-06-14 14:36:22,468 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 97 transitions, 735 flow [2024-06-14 14:36:22,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:22,468 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:36:22,468 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:36:22,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-14 14:36:22,469 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:36:22,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:36:22,469 INFO L85 PathProgramCache]: Analyzing trace with hash 926519342, now seen corresponding path program 4 times [2024-06-14 14:36:22,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:36:22,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817780373] [2024-06-14 14:36:22,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:36:22,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:36:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:36:32,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:36:32,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:36:32,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817780373] [2024-06-14 14:36:32,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817780373] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:36:32,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:36:32,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:36:32,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782304014] [2024-06-14 14:36:32,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:36:32,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:36:32,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:36:32,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:36:32,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:36:32,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 14:36:32,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 97 transitions, 735 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:32,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:36:32,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 14:36:32,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:36:33,037 INFO L124 PetriNetUnfolderBase]: 258/487 cut-off events. [2024-06-14 14:36:33,037 INFO L125 PetriNetUnfolderBase]: For 13727/13734 co-relation queries the response was YES. [2024-06-14 14:36:33,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2876 conditions, 487 events. 258/487 cut-off events. For 13727/13734 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2019 event pairs, 45 based on Foata normal form. 7/490 useless extension candidates. Maximal degree in co-relation 2823. Up to 404 conditions per place. [2024-06-14 14:36:33,040 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 75 selfloop transitions, 17 changer transitions 0/107 dead transitions. [2024-06-14 14:36:33,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 107 transitions, 952 flow [2024-06-14 14:36:33,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:36:33,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:36:33,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2024-06-14 14:36:33,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3977272727272727 [2024-06-14 14:36:33,041 INFO L175 Difference]: Start difference. First operand has 108 places, 97 transitions, 735 flow. Second operand 8 states and 105 transitions. [2024-06-14 14:36:33,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 107 transitions, 952 flow [2024-06-14 14:36:33,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 107 transitions, 897 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-14 14:36:33,073 INFO L231 Difference]: Finished difference. Result has 109 places, 98 transitions, 728 flow [2024-06-14 14:36:33,073 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=728, PETRI_PLACES=109, PETRI_TRANSITIONS=98} [2024-06-14 14:36:33,073 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 77 predicate places. [2024-06-14 14:36:33,073 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 98 transitions, 728 flow [2024-06-14 14:36:33,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:33,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:36:33,074 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:36:33,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-14 14:36:33,074 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:36:33,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:36:33,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1885812864, now seen corresponding path program 5 times [2024-06-14 14:36:33,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:36:33,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272321502] [2024-06-14 14:36:33,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:36:33,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:36:33,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:36:40,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:36:40,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:36:40,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272321502] [2024-06-14 14:36:40,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272321502] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:36:40,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:36:40,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:36:40,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860685725] [2024-06-14 14:36:40,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:36:40,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:36:40,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:36:40,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:36:40,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:36:40,267 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:36:40,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 98 transitions, 728 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:40,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:36:40,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:36:40,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:36:40,536 INFO L124 PetriNetUnfolderBase]: 278/513 cut-off events. [2024-06-14 14:36:40,537 INFO L125 PetriNetUnfolderBase]: For 14467/14470 co-relation queries the response was YES. [2024-06-14 14:36:40,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3045 conditions, 513 events. 278/513 cut-off events. For 14467/14470 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2088 event pairs, 58 based on Foata normal form. 2/510 useless extension candidates. Maximal degree in co-relation 2992. Up to 384 conditions per place. [2024-06-14 14:36:40,541 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 74 selfloop transitions, 33 changer transitions 0/110 dead transitions. [2024-06-14 14:36:40,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 110 transitions, 1000 flow [2024-06-14 14:36:40,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:36:40,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:36:40,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2024-06-14 14:36:40,545 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2024-06-14 14:36:40,545 INFO L175 Difference]: Start difference. First operand has 109 places, 98 transitions, 728 flow. Second operand 8 states and 104 transitions. [2024-06-14 14:36:40,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 110 transitions, 1000 flow [2024-06-14 14:36:40,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 110 transitions, 961 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-14 14:36:40,558 INFO L231 Difference]: Finished difference. Result has 111 places, 100 transitions, 794 flow [2024-06-14 14:36:40,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=794, PETRI_PLACES=111, PETRI_TRANSITIONS=100} [2024-06-14 14:36:40,559 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 79 predicate places. [2024-06-14 14:36:40,559 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 100 transitions, 794 flow [2024-06-14 14:36:40,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:40,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:36:40,559 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:36:40,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-14 14:36:40,559 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:36:40,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:36:40,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1876269824, now seen corresponding path program 1 times [2024-06-14 14:36:40,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:36:40,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003592229] [2024-06-14 14:36:40,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:36:40,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:36:40,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:36:52,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:36:52,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:36:52,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003592229] [2024-06-14 14:36:52,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003592229] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:36:52,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:36:52,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:36:52,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530057192] [2024-06-14 14:36:52,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:36:52,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:36:52,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:36:52,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:36:52,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:36:52,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 14:36:52,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 100 transitions, 794 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 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-06-14 14:36:52,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:36:52,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 14:36:52,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:36:52,560 INFO L124 PetriNetUnfolderBase]: 257/485 cut-off events. [2024-06-14 14:36:52,561 INFO L125 PetriNetUnfolderBase]: For 14972/14977 co-relation queries the response was YES. [2024-06-14 14:36:52,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2916 conditions, 485 events. 257/485 cut-off events. For 14972/14977 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1997 event pairs, 45 based on Foata normal form. 5/486 useless extension candidates. Maximal degree in co-relation 2862. Up to 411 conditions per place. [2024-06-14 14:36:52,566 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 82 selfloop transitions, 12 changer transitions 0/109 dead transitions. [2024-06-14 14:36:52,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 109 transitions, 1004 flow [2024-06-14 14:36:52,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:36:52,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:36:52,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-06-14 14:36:52,567 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39015151515151514 [2024-06-14 14:36:52,567 INFO L175 Difference]: Start difference. First operand has 111 places, 100 transitions, 794 flow. Second operand 8 states and 103 transitions. [2024-06-14 14:36:52,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 109 transitions, 1004 flow [2024-06-14 14:36:52,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 109 transitions, 915 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-14 14:36:52,586 INFO L231 Difference]: Finished difference. Result has 113 places, 100 transitions, 733 flow [2024-06-14 14:36:52,586 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=733, PETRI_PLACES=113, PETRI_TRANSITIONS=100} [2024-06-14 14:36:52,587 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 81 predicate places. [2024-06-14 14:36:52,587 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 100 transitions, 733 flow [2024-06-14 14:36:52,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 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-06-14 14:36:52,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:36:52,587 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:36:52,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-14 14:36:52,588 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:36:52,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:36:52,588 INFO L85 PathProgramCache]: Analyzing trace with hash -2134128858, now seen corresponding path program 1 times [2024-06-14 14:36:52,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:36:52,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745568781] [2024-06-14 14:36:52,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:36:52,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:36:52,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:37:00,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:37:00,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:37:00,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745568781] [2024-06-14 14:37:00,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745568781] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:37:00,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:37:00,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:37:00,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890951104] [2024-06-14 14:37:00,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:37:00,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:37:00,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:37:00,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:37:00,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:37:01,030 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:37:01,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 100 transitions, 733 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:37:01,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:37:01,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:37:01,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:37:01,520 INFO L124 PetriNetUnfolderBase]: 273/504 cut-off events. [2024-06-14 14:37:01,520 INFO L125 PetriNetUnfolderBase]: For 14345/14345 co-relation queries the response was YES. [2024-06-14 14:37:01,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2960 conditions, 504 events. 273/504 cut-off events. For 14345/14345 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2047 event pairs, 40 based on Foata normal form. 1/503 useless extension candidates. Maximal degree in co-relation 2905. Up to 414 conditions per place. [2024-06-14 14:37:01,523 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 96 selfloop transitions, 23 changer transitions 0/122 dead transitions. [2024-06-14 14:37:01,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 122 transitions, 1067 flow [2024-06-14 14:37:01,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:37:01,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:37:01,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-14 14:37:01,524 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39730639730639733 [2024-06-14 14:37:01,524 INFO L175 Difference]: Start difference. First operand has 113 places, 100 transitions, 733 flow. Second operand 9 states and 118 transitions. [2024-06-14 14:37:01,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 122 transitions, 1067 flow [2024-06-14 14:37:01,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 122 transitions, 1038 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-14 14:37:01,538 INFO L231 Difference]: Finished difference. Result has 116 places, 102 transitions, 793 flow [2024-06-14 14:37:01,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=793, PETRI_PLACES=116, PETRI_TRANSITIONS=102} [2024-06-14 14:37:01,538 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 84 predicate places. [2024-06-14 14:37:01,538 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 102 transitions, 793 flow [2024-06-14 14:37:01,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:37:01,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:37:01,539 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:37:01,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-14 14:37:01,539 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:37:01,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:37:01,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1963306272, now seen corresponding path program 1 times [2024-06-14 14:37:01,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:37:01,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061436375] [2024-06-14 14:37:01,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:37:01,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:37:01,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:37:10,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:37:10,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:37:10,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061436375] [2024-06-14 14:37:10,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061436375] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:37:10,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:37:10,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:37:10,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770746835] [2024-06-14 14:37:10,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:37:10,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:37:10,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:37:10,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:37:10,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:37:10,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:37:10,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 102 transitions, 793 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:37:10,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:37:10,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:37:10,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:37:10,747 INFO L124 PetriNetUnfolderBase]: 279/514 cut-off events. [2024-06-14 14:37:10,748 INFO L125 PetriNetUnfolderBase]: For 15869/15869 co-relation queries the response was YES. [2024-06-14 14:37:10,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3102 conditions, 514 events. 279/514 cut-off events. For 15869/15869 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2100 event pairs, 39 based on Foata normal form. 2/514 useless extension candidates. Maximal degree in co-relation 3046. Up to 418 conditions per place. [2024-06-14 14:37:10,752 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 94 selfloop transitions, 26 changer transitions 0/123 dead transitions. [2024-06-14 14:37:10,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 123 transitions, 1121 flow [2024-06-14 14:37:10,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:37:10,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:37:10,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-14 14:37:10,753 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2024-06-14 14:37:10,754 INFO L175 Difference]: Start difference. First operand has 116 places, 102 transitions, 793 flow. Second operand 9 states and 117 transitions. [2024-06-14 14:37:10,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 123 transitions, 1121 flow [2024-06-14 14:37:10,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 123 transitions, 1048 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-14 14:37:10,774 INFO L231 Difference]: Finished difference. Result has 118 places, 105 transitions, 817 flow [2024-06-14 14:37:10,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=817, PETRI_PLACES=118, PETRI_TRANSITIONS=105} [2024-06-14 14:37:10,775 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 86 predicate places. [2024-06-14 14:37:10,775 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 105 transitions, 817 flow [2024-06-14 14:37:10,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:37:10,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:37:10,775 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:37:10,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-14 14:37:10,776 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:37:10,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:37:10,776 INFO L85 PathProgramCache]: Analyzing trace with hash -2129367072, now seen corresponding path program 2 times [2024-06-14 14:37:10,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:37:10,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040988241] [2024-06-14 14:37:10,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:37:10,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:37:10,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:37:18,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:37:18,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:37:18,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040988241] [2024-06-14 14:37:18,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040988241] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:37:18,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:37:18,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:37:18,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933812751] [2024-06-14 14:37:18,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:37:18,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:37:18,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:37:18,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:37:18,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:37:18,602 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:37:18,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 105 transitions, 817 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:37:18,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:37:18,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:37:18,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:37:18,986 INFO L124 PetriNetUnfolderBase]: 285/525 cut-off events. [2024-06-14 14:37:18,986 INFO L125 PetriNetUnfolderBase]: For 17206/17206 co-relation queries the response was YES. [2024-06-14 14:37:18,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3240 conditions, 525 events. 285/525 cut-off events. For 17206/17206 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2158 event pairs, 42 based on Foata normal form. 2/525 useless extension candidates. Maximal degree in co-relation 3183. Up to 419 conditions per place. [2024-06-14 14:37:18,989 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 93 selfloop transitions, 28 changer transitions 0/124 dead transitions. [2024-06-14 14:37:18,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 124 transitions, 1149 flow [2024-06-14 14:37:18,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:37:18,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:37:18,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-14 14:37:18,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2024-06-14 14:37:18,990 INFO L175 Difference]: Start difference. First operand has 118 places, 105 transitions, 817 flow. Second operand 9 states and 117 transitions. [2024-06-14 14:37:18,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 124 transitions, 1149 flow [2024-06-14 14:37:19,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 124 transitions, 1076 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-14 14:37:19,006 INFO L231 Difference]: Finished difference. Result has 120 places, 108 transitions, 850 flow [2024-06-14 14:37:19,006 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=850, PETRI_PLACES=120, PETRI_TRANSITIONS=108} [2024-06-14 14:37:19,007 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 88 predicate places. [2024-06-14 14:37:19,007 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 108 transitions, 850 flow [2024-06-14 14:37:19,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:37:19,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:37:19,007 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:37:19,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-14 14:37:19,007 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:37:19,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:37:19,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1851594724, now seen corresponding path program 3 times [2024-06-14 14:37:19,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:37:19,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729337252] [2024-06-14 14:37:19,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:37:19,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:37:19,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:37:28,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:37:28,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:37:28,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729337252] [2024-06-14 14:37:28,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729337252] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:37:28,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:37:28,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:37:28,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974823817] [2024-06-14 14:37:28,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:37:28,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:37:28,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:37:28,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:37:28,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:37:28,235 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:37:28,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 108 transitions, 850 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:37:28,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:37:28,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:37:28,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:37:28,618 INFO L124 PetriNetUnfolderBase]: 288/530 cut-off events. [2024-06-14 14:37:28,618 INFO L125 PetriNetUnfolderBase]: For 17880/17880 co-relation queries the response was YES. [2024-06-14 14:37:28,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3331 conditions, 530 events. 288/530 cut-off events. For 17880/17880 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2182 event pairs, 42 based on Foata normal form. 1/529 useless extension candidates. Maximal degree in co-relation 3273. Up to 408 conditions per place. [2024-06-14 14:37:28,622 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 88 selfloop transitions, 34 changer transitions 0/125 dead transitions. [2024-06-14 14:37:28,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 125 transitions, 1168 flow [2024-06-14 14:37:28,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:37:28,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:37:28,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-14 14:37:28,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2024-06-14 14:37:28,623 INFO L175 Difference]: Start difference. First operand has 120 places, 108 transitions, 850 flow. Second operand 9 states and 117 transitions. [2024-06-14 14:37:28,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 125 transitions, 1168 flow [2024-06-14 14:37:28,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 125 transitions, 1084 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-14 14:37:28,639 INFO L231 Difference]: Finished difference. Result has 122 places, 110 transitions, 869 flow [2024-06-14 14:37:28,639 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=869, PETRI_PLACES=122, PETRI_TRANSITIONS=110} [2024-06-14 14:37:28,639 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 90 predicate places. [2024-06-14 14:37:28,640 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 110 transitions, 869 flow [2024-06-14 14:37:28,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:37:28,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:37:28,640 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:37:28,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-14 14:37:28,640 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:37:28,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:37:28,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1851594972, now seen corresponding path program 1 times [2024-06-14 14:37:28,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:37:28,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393483327] [2024-06-14 14:37:28,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:37:28,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:37:28,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:37:37,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:37:37,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:37:37,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393483327] [2024-06-14 14:37:37,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393483327] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:37:37,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:37:37,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:37:37,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549556879] [2024-06-14 14:37:37,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:37:37,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:37:37,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:37:37,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:37:37,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:37:37,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 14:37:37,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 110 transitions, 869 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 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-06-14 14:37:37,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:37:37,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 14:37:37,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:37:37,580 INFO L124 PetriNetUnfolderBase]: 294/539 cut-off events. [2024-06-14 14:37:37,580 INFO L125 PetriNetUnfolderBase]: For 19538/19538 co-relation queries the response was YES. [2024-06-14 14:37:37,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3431 conditions, 539 events. 294/539 cut-off events. For 19538/19538 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2228 event pairs, 38 based on Foata normal form. 2/539 useless extension candidates. Maximal degree in co-relation 3372. Up to 470 conditions per place. [2024-06-14 14:37:37,584 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 106 selfloop transitions, 19 changer transitions 0/128 dead transitions. [2024-06-14 14:37:37,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 128 transitions, 1193 flow [2024-06-14 14:37:37,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:37:37,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:37:37,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 122 transitions. [2024-06-14 14:37:37,589 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4107744107744108 [2024-06-14 14:37:37,589 INFO L175 Difference]: Start difference. First operand has 122 places, 110 transitions, 869 flow. Second operand 9 states and 122 transitions. [2024-06-14 14:37:37,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 128 transitions, 1193 flow [2024-06-14 14:37:37,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 128 transitions, 1106 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-14 14:37:37,617 INFO L231 Difference]: Finished difference. Result has 124 places, 112 transitions, 853 flow [2024-06-14 14:37:37,618 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=853, PETRI_PLACES=124, PETRI_TRANSITIONS=112} [2024-06-14 14:37:37,618 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 92 predicate places. [2024-06-14 14:37:37,618 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 112 transitions, 853 flow [2024-06-14 14:37:37,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 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-06-14 14:37:37,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:37:37,619 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:37:37,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-14 14:37:37,619 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:37:37,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:37:37,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1956877182, now seen corresponding path program 4 times [2024-06-14 14:37:37,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:37:37,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134508150] [2024-06-14 14:37:37,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:37:37,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:37:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:37:46,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:37:46,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:37:46,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134508150] [2024-06-14 14:37:46,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134508150] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:37:46,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:37:46,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:37:46,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598100498] [2024-06-14 14:37:46,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:37:46,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:37:46,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:37:46,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:37:46,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:37:46,735 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:37:46,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 112 transitions, 853 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:37:46,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:37:46,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:37:46,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:37:47,091 INFO L124 PetriNetUnfolderBase]: 300/550 cut-off events. [2024-06-14 14:37:47,091 INFO L125 PetriNetUnfolderBase]: For 20594/20594 co-relation queries the response was YES. [2024-06-14 14:37:47,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3522 conditions, 550 events. 300/550 cut-off events. For 20594/20594 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2283 event pairs, 45 based on Foata normal form. 2/550 useless extension candidates. Maximal degree in co-relation 3462. Up to 430 conditions per place. [2024-06-14 14:37:47,095 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 94 selfloop transitions, 31 changer transitions 0/128 dead transitions. [2024-06-14 14:37:47,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 128 transitions, 1199 flow [2024-06-14 14:37:47,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:37:47,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:37:47,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-14 14:37:47,097 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39057239057239057 [2024-06-14 14:37:47,097 INFO L175 Difference]: Start difference. First operand has 124 places, 112 transitions, 853 flow. Second operand 9 states and 116 transitions. [2024-06-14 14:37:47,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 128 transitions, 1199 flow [2024-06-14 14:37:47,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 128 transitions, 1144 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-14 14:37:47,124 INFO L231 Difference]: Finished difference. Result has 126 places, 115 transitions, 920 flow [2024-06-14 14:37:47,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=920, PETRI_PLACES=126, PETRI_TRANSITIONS=115} [2024-06-14 14:37:47,125 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 94 predicate places. [2024-06-14 14:37:47,125 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 115 transitions, 920 flow [2024-06-14 14:37:47,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:37:47,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:37:47,125 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:37:47,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-14 14:37:47,126 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:37:47,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:37:47,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1956870672, now seen corresponding path program 5 times [2024-06-14 14:37:47,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:37:47,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345488128] [2024-06-14 14:37:47,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:37:47,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:37:47,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:37:55,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:37:55,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:37:55,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345488128] [2024-06-14 14:37:55,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345488128] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:37:55,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:37:55,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:37:55,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215284749] [2024-06-14 14:37:55,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:37:55,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:37:55,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:37:55,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:37:55,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:37:55,751 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:37:55,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 115 transitions, 920 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:37:55,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:37:55,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:37:55,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:37:56,111 INFO L124 PetriNetUnfolderBase]: 303/555 cut-off events. [2024-06-14 14:37:56,111 INFO L125 PetriNetUnfolderBase]: For 21255/21255 co-relation queries the response was YES. [2024-06-14 14:37:56,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3644 conditions, 555 events. 303/555 cut-off events. For 21255/21255 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2316 event pairs, 45 based on Foata normal form. 1/554 useless extension candidates. Maximal degree in co-relation 3583. Up to 429 conditions per place. [2024-06-14 14:37:56,115 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 93 selfloop transitions, 34 changer transitions 0/130 dead transitions. [2024-06-14 14:37:56,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 130 transitions, 1260 flow [2024-06-14 14:37:56,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:37:56,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:37:56,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-14 14:37:56,116 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39730639730639733 [2024-06-14 14:37:56,116 INFO L175 Difference]: Start difference. First operand has 126 places, 115 transitions, 920 flow. Second operand 9 states and 118 transitions. [2024-06-14 14:37:56,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 130 transitions, 1260 flow [2024-06-14 14:37:56,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 130 transitions, 1160 flow, removed 21 selfloop flow, removed 7 redundant places. [2024-06-14 14:37:56,146 INFO L231 Difference]: Finished difference. Result has 128 places, 117 transitions, 931 flow [2024-06-14 14:37:56,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=820, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=931, PETRI_PLACES=128, PETRI_TRANSITIONS=117} [2024-06-14 14:37:56,149 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 96 predicate places. [2024-06-14 14:37:56,149 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 117 transitions, 931 flow [2024-06-14 14:37:56,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:37:56,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:37:56,149 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:37:56,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-14 14:37:56,150 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:37:56,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:37:56,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1956870424, now seen corresponding path program 2 times [2024-06-14 14:37:56,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:37:56,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985049227] [2024-06-14 14:37:56,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:37:56,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:37:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:38:04,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:38:04,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:38:04,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985049227] [2024-06-14 14:38:04,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985049227] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:38:04,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:38:04,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:38:04,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230787464] [2024-06-14 14:38:04,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:38:04,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:38:04,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:38:04,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:38:04,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:38:04,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 14:38:04,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 117 transitions, 931 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 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-06-14 14:38:04,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:38:04,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 14:38:04,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:38:05,057 INFO L124 PetriNetUnfolderBase]: 309/564 cut-off events. [2024-06-14 14:38:05,057 INFO L125 PetriNetUnfolderBase]: For 23098/23098 co-relation queries the response was YES. [2024-06-14 14:38:05,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3728 conditions, 564 events. 309/564 cut-off events. For 23098/23098 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2366 event pairs, 40 based on Foata normal form. 2/564 useless extension candidates. Maximal degree in co-relation 3666. Up to 487 conditions per place. [2024-06-14 14:38:05,061 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 108 selfloop transitions, 21 changer transitions 0/132 dead transitions. [2024-06-14 14:38:05,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 132 transitions, 1255 flow [2024-06-14 14:38:05,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:38:05,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:38:05,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 121 transitions. [2024-06-14 14:38:05,062 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4074074074074074 [2024-06-14 14:38:05,063 INFO L175 Difference]: Start difference. First operand has 128 places, 117 transitions, 931 flow. Second operand 9 states and 121 transitions. [2024-06-14 14:38:05,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 132 transitions, 1255 flow [2024-06-14 14:38:05,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 132 transitions, 1160 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-14 14:38:05,093 INFO L231 Difference]: Finished difference. Result has 130 places, 119 transitions, 915 flow [2024-06-14 14:38:05,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=915, PETRI_PLACES=130, PETRI_TRANSITIONS=119} [2024-06-14 14:38:05,093 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 98 predicate places. [2024-06-14 14:38:05,094 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 119 transitions, 915 flow [2024-06-14 14:38:05,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 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-06-14 14:38:05,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:38:05,094 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:38:05,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-14 14:38:05,094 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:38:05,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:38:05,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1013488532, now seen corresponding path program 6 times [2024-06-14 14:38:05,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:38:05,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364903034] [2024-06-14 14:38:05,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:38:05,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:38:05,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:38:14,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-06-14 14:38:14,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:38:14,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364903034] [2024-06-14 14:38:14,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364903034] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:38:14,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:38:14,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:38:14,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613384272] [2024-06-14 14:38:14,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:38:14,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:38:14,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:38:14,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:38:14,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:38:14,391 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:38:14,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 119 transitions, 915 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:38:14,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:38:14,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:38:14,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:38:14,729 INFO L124 PetriNetUnfolderBase]: 312/570 cut-off events. [2024-06-14 14:38:14,729 INFO L125 PetriNetUnfolderBase]: For 23470/23470 co-relation queries the response was YES. [2024-06-14 14:38:14,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3779 conditions, 570 events. 312/570 cut-off events. For 23470/23470 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2405 event pairs, 45 based on Foata normal form. 1/569 useless extension candidates. Maximal degree in co-relation 3716. Up to 413 conditions per place. [2024-06-14 14:38:14,732 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 83 selfloop transitions, 47 changer transitions 0/133 dead transitions. [2024-06-14 14:38:14,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 133 transitions, 1255 flow [2024-06-14 14:38:14,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:38:14,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:38:14,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-14 14:38:14,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2024-06-14 14:38:14,734 INFO L175 Difference]: Start difference. First operand has 130 places, 119 transitions, 915 flow. Second operand 9 states and 117 transitions. [2024-06-14 14:38:14,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 133 transitions, 1255 flow [2024-06-14 14:38:14,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 133 transitions, 1192 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-14 14:38:14,756 INFO L231 Difference]: Finished difference. Result has 132 places, 121 transitions, 993 flow [2024-06-14 14:38:14,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=993, PETRI_PLACES=132, PETRI_TRANSITIONS=121} [2024-06-14 14:38:14,757 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 100 predicate places. [2024-06-14 14:38:14,757 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 121 transitions, 993 flow [2024-06-14 14:38:14,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:38:14,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:38:14,757 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:38:14,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-14 14:38:14,758 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:38:14,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:38:14,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1013488780, now seen corresponding path program 3 times [2024-06-14 14:38:14,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:38:14,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074740369] [2024-06-14 14:38:14,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:38:14,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:38:14,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:38:25,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:38:25,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:38:25,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074740369] [2024-06-14 14:38:25,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074740369] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:38:25,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:38:25,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:38:25,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330069187] [2024-06-14 14:38:25,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:38:25,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:38:25,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:38:25,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:38:25,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:38:25,961 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:38:25,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 121 transitions, 993 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:38:25,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:38:25,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:38:25,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:38:26,346 INFO L124 PetriNetUnfolderBase]: 320/582 cut-off events. [2024-06-14 14:38:26,347 INFO L125 PetriNetUnfolderBase]: For 25515/25515 co-relation queries the response was YES. [2024-06-14 14:38:26,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3992 conditions, 582 events. 320/582 cut-off events. For 25515/25515 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2452 event pairs, 39 based on Foata normal form. 1/581 useless extension candidates. Maximal degree in co-relation 3928. Up to 486 conditions per place. [2024-06-14 14:38:26,351 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 108 selfloop transitions, 30 changer transitions 0/141 dead transitions. [2024-06-14 14:38:26,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 141 transitions, 1449 flow [2024-06-14 14:38:26,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:38:26,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:38:26,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions. [2024-06-14 14:38:26,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3872053872053872 [2024-06-14 14:38:26,354 INFO L175 Difference]: Start difference. First operand has 132 places, 121 transitions, 993 flow. Second operand 9 states and 115 transitions. [2024-06-14 14:38:26,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 141 transitions, 1449 flow [2024-06-14 14:38:26,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 141 transitions, 1324 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-14 14:38:26,377 INFO L231 Difference]: Finished difference. Result has 135 places, 128 transitions, 1016 flow [2024-06-14 14:38:26,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=868, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1016, PETRI_PLACES=135, PETRI_TRANSITIONS=128} [2024-06-14 14:38:26,378 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 103 predicate places. [2024-06-14 14:38:26,378 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 128 transitions, 1016 flow [2024-06-14 14:38:26,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:38:26,378 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:38:26,378 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:38:26,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-14 14:38:26,379 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:38:26,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:38:26,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1013497150, now seen corresponding path program 4 times [2024-06-14 14:38:26,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:38:26,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82777238] [2024-06-14 14:38:26,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:38:26,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:38:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:38:37,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:38:37,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:38:37,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82777238] [2024-06-14 14:38:37,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82777238] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:38:37,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:38:37,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:38:37,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422450520] [2024-06-14 14:38:37,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:38:37,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:38:37,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:38:37,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:38:37,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:38:37,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:38:37,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 128 transitions, 1016 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:38:37,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:38:37,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:38:37,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:38:37,583 INFO L124 PetriNetUnfolderBase]: 318/579 cut-off events. [2024-06-14 14:38:37,583 INFO L125 PetriNetUnfolderBase]: For 25842/25842 co-relation queries the response was YES. [2024-06-14 14:38:37,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3943 conditions, 579 events. 318/579 cut-off events. For 25842/25842 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2443 event pairs, 39 based on Foata normal form. 1/578 useless extension candidates. Maximal degree in co-relation 3877. Up to 484 conditions per place. [2024-06-14 14:38:37,587 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 105 selfloop transitions, 32 changer transitions 0/140 dead transitions. [2024-06-14 14:38:37,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 140 transitions, 1324 flow [2024-06-14 14:38:37,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:38:37,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:38:37,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-14 14:38:37,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38047138047138046 [2024-06-14 14:38:37,588 INFO L175 Difference]: Start difference. First operand has 135 places, 128 transitions, 1016 flow. Second operand 9 states and 113 transitions. [2024-06-14 14:38:37,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 140 transitions, 1324 flow [2024-06-14 14:38:37,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 140 transitions, 1254 flow, removed 22 selfloop flow, removed 5 redundant places. [2024-06-14 14:38:37,614 INFO L231 Difference]: Finished difference. Result has 139 places, 128 transitions, 1015 flow [2024-06-14 14:38:37,615 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=946, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1015, PETRI_PLACES=139, PETRI_TRANSITIONS=128} [2024-06-14 14:38:37,615 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 107 predicate places. [2024-06-14 14:38:37,615 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 128 transitions, 1015 flow [2024-06-14 14:38:37,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:38:37,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:38:37,616 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:38:37,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-14 14:38:37,616 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:38:37,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:38:37,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1342916460, now seen corresponding path program 7 times [2024-06-14 14:38:37,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:38:37,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908369635] [2024-06-14 14:38:37,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:38:37,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:38:37,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:38:45,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:38:45,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:38:45,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908369635] [2024-06-14 14:38:45,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908369635] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:38:45,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:38:45,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:38:45,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838057238] [2024-06-14 14:38:45,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:38:45,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:38:45,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:38:45,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:38:45,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:38:45,264 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:38:45,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 128 transitions, 1015 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:38:45,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:38:45,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:38:45,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:38:45,576 INFO L124 PetriNetUnfolderBase]: 324/590 cut-off events. [2024-06-14 14:38:45,576 INFO L125 PetriNetUnfolderBase]: For 28133/28136 co-relation queries the response was YES. [2024-06-14 14:38:45,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4087 conditions, 590 events. 324/590 cut-off events. For 28133/28136 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2506 event pairs, 53 based on Foata normal form. 2/587 useless extension candidates. Maximal degree in co-relation 4020. Up to 455 conditions per place. [2024-06-14 14:38:45,580 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 103 selfloop transitions, 36 changer transitions 0/142 dead transitions. [2024-06-14 14:38:45,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 142 transitions, 1409 flow [2024-06-14 14:38:45,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:38:45,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:38:45,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions. [2024-06-14 14:38:45,581 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3872053872053872 [2024-06-14 14:38:45,581 INFO L175 Difference]: Start difference. First operand has 139 places, 128 transitions, 1015 flow. Second operand 9 states and 115 transitions. [2024-06-14 14:38:45,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 142 transitions, 1409 flow [2024-06-14 14:38:45,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 142 transitions, 1349 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-14 14:38:45,610 INFO L231 Difference]: Finished difference. Result has 141 places, 131 transitions, 1101 flow [2024-06-14 14:38:45,610 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=955, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1101, PETRI_PLACES=141, PETRI_TRANSITIONS=131} [2024-06-14 14:38:45,610 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 109 predicate places. [2024-06-14 14:38:45,610 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 131 transitions, 1101 flow [2024-06-14 14:38:45,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:38:45,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:38:45,611 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:38:45,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-14 14:38:45,611 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:38:45,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:38:45,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1669351144, now seen corresponding path program 5 times [2024-06-14 14:38:45,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:38:45,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934073429] [2024-06-14 14:38:45,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:38:45,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:38:45,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:38:54,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:38:54,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:38:54,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934073429] [2024-06-14 14:38:54,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934073429] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:38:54,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:38:54,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:38:54,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391533014] [2024-06-14 14:38:54,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:38:54,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:38:54,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:38:54,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:38:54,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:38:54,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 14:38:54,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 131 transitions, 1101 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 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-06-14 14:38:54,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:38:54,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 14:38:54,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:38:54,561 INFO L124 PetriNetUnfolderBase]: 330/600 cut-off events. [2024-06-14 14:38:54,561 INFO L125 PetriNetUnfolderBase]: For 29947/29950 co-relation queries the response was YES. [2024-06-14 14:38:54,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4268 conditions, 600 events. 330/600 cut-off events. For 29947/29950 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2566 event pairs, 45 based on Foata normal form. 2/597 useless extension candidates. Maximal degree in co-relation 4200. Up to 513 conditions per place. [2024-06-14 14:38:54,565 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 116 selfloop transitions, 25 changer transitions 0/144 dead transitions. [2024-06-14 14:38:54,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 144 transitions, 1451 flow [2024-06-14 14:38:54,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:38:54,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:38:54,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2024-06-14 14:38:54,567 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40404040404040403 [2024-06-14 14:38:54,567 INFO L175 Difference]: Start difference. First operand has 141 places, 131 transitions, 1101 flow. Second operand 9 states and 120 transitions. [2024-06-14 14:38:54,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 144 transitions, 1451 flow [2024-06-14 14:38:54,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 144 transitions, 1327 flow, removed 28 selfloop flow, removed 7 redundant places. [2024-06-14 14:38:54,597 INFO L231 Difference]: Finished difference. Result has 143 places, 133 transitions, 1070 flow [2024-06-14 14:38:54,597 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=977, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1070, PETRI_PLACES=143, PETRI_TRANSITIONS=133} [2024-06-14 14:38:54,598 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 111 predicate places. [2024-06-14 14:38:54,598 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 133 transitions, 1070 flow [2024-06-14 14:38:54,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 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-06-14 14:38:54,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:38:54,598 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:38:54,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-14 14:38:54,599 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:38:54,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:38:54,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1669590154, now seen corresponding path program 6 times [2024-06-14 14:38:54,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:38:54,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431804862] [2024-06-14 14:38:54,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:38:54,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:38:54,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:39:02,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:39:02,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:39:02,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431804862] [2024-06-14 14:39:02,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431804862] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:39:02,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:39:02,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:39:02,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340576346] [2024-06-14 14:39:02,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:39:02,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:39:02,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:39:02,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:39:02,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:39:02,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:39:02,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 133 transitions, 1070 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:39:02,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:39:02,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:39:02,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:39:02,840 INFO L124 PetriNetUnfolderBase]: 352/636 cut-off events. [2024-06-14 14:39:02,840 INFO L125 PetriNetUnfolderBase]: For 34402/34405 co-relation queries the response was YES. [2024-06-14 14:39:02,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4643 conditions, 636 events. 352/636 cut-off events. For 34402/34405 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2737 event pairs, 46 based on Foata normal form. 2/633 useless extension candidates. Maximal degree in co-relation 4574. Up to 518 conditions per place. [2024-06-14 14:39:02,845 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 115 selfloop transitions, 33 changer transitions 0/151 dead transitions. [2024-06-14 14:39:02,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 151 transitions, 1590 flow [2024-06-14 14:39:02,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:39:02,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:39:02,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-14 14:39:02,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39057239057239057 [2024-06-14 14:39:02,846 INFO L175 Difference]: Start difference. First operand has 143 places, 133 transitions, 1070 flow. Second operand 9 states and 116 transitions. [2024-06-14 14:39:02,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 151 transitions, 1590 flow [2024-06-14 14:39:02,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 151 transitions, 1515 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-14 14:39:02,880 INFO L231 Difference]: Finished difference. Result has 146 places, 138 transitions, 1176 flow [2024-06-14 14:39:02,880 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=995, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1176, PETRI_PLACES=146, PETRI_TRANSITIONS=138} [2024-06-14 14:39:02,880 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 114 predicate places. [2024-06-14 14:39:02,880 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 138 transitions, 1176 flow [2024-06-14 14:39:02,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:39:02,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:39:02,881 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:39:02,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-14 14:39:02,881 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:39:02,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:39:02,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1669350896, now seen corresponding path program 8 times [2024-06-14 14:39:02,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:39:02,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786288607] [2024-06-14 14:39:02,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:39:02,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:39:02,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:39:12,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:39:12,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:39:12,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786288607] [2024-06-14 14:39:12,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786288607] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:39:12,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:39:12,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:39:12,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936213061] [2024-06-14 14:39:12,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:39:12,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:39:12,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:39:12,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:39:12,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:39:12,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:39:12,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 138 transitions, 1176 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:39:12,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:39:12,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:39:12,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:39:13,264 INFO L124 PetriNetUnfolderBase]: 355/641 cut-off events. [2024-06-14 14:39:13,264 INFO L125 PetriNetUnfolderBase]: For 35148/35151 co-relation queries the response was YES. [2024-06-14 14:39:13,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4782 conditions, 641 events. 355/641 cut-off events. For 35148/35151 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2762 event pairs, 54 based on Foata normal form. 1/637 useless extension candidates. Maximal degree in co-relation 4711. Up to 500 conditions per place. [2024-06-14 14:39:13,269 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 109 selfloop transitions, 39 changer transitions 0/151 dead transitions. [2024-06-14 14:39:13,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 151 transitions, 1576 flow [2024-06-14 14:39:13,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:39:13,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:39:13,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-14 14:39:13,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2024-06-14 14:39:13,270 INFO L175 Difference]: Start difference. First operand has 146 places, 138 transitions, 1176 flow. Second operand 9 states and 117 transitions. [2024-06-14 14:39:13,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 151 transitions, 1576 flow [2024-06-14 14:39:13,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 151 transitions, 1507 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-14 14:39:13,310 INFO L231 Difference]: Finished difference. Result has 150 places, 140 transitions, 1240 flow [2024-06-14 14:39:13,311 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1107, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1240, PETRI_PLACES=150, PETRI_TRANSITIONS=140} [2024-06-14 14:39:13,311 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 118 predicate places. [2024-06-14 14:39:13,311 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 140 transitions, 1240 flow [2024-06-14 14:39:13,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:39:13,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:39:13,312 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:39:13,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-14 14:39:13,312 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:39:13,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:39:13,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1342670382, now seen corresponding path program 1 times [2024-06-14 14:39:13,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:39:13,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626664678] [2024-06-14 14:39:13,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:39:13,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:39:13,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:39:22,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:39:22,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:39:22,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626664678] [2024-06-14 14:39:22,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626664678] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:39:22,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:39:22,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:39:22,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706890741] [2024-06-14 14:39:22,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:39:22,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:39:22,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:39:22,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:39:22,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:39:22,845 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 14:39:22,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 140 transitions, 1240 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:39:22,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:39:22,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 14:39:22,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:39:23,159 INFO L124 PetriNetUnfolderBase]: 334/615 cut-off events. [2024-06-14 14:39:23,159 INFO L125 PetriNetUnfolderBase]: For 36548/36555 co-relation queries the response was YES. [2024-06-14 14:39:23,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4620 conditions, 615 events. 334/615 cut-off events. For 36548/36555 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2708 event pairs, 41 based on Foata normal form. 7/618 useless extension candidates. Maximal degree in co-relation 4547. Up to 495 conditions per place. [2024-06-14 14:39:23,164 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 108 selfloop transitions, 19 changer transitions 0/151 dead transitions. [2024-06-14 14:39:23,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 151 transitions, 1537 flow [2024-06-14 14:39:23,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:39:23,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:39:23,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-14 14:39:23,166 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39057239057239057 [2024-06-14 14:39:23,166 INFO L175 Difference]: Start difference. First operand has 150 places, 140 transitions, 1240 flow. Second operand 9 states and 116 transitions. [2024-06-14 14:39:23,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 151 transitions, 1537 flow [2024-06-14 14:39:23,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 151 transitions, 1420 flow, removed 21 selfloop flow, removed 7 redundant places. [2024-06-14 14:39:23,209 INFO L231 Difference]: Finished difference. Result has 152 places, 141 transitions, 1183 flow [2024-06-14 14:39:23,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1123, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1183, PETRI_PLACES=152, PETRI_TRANSITIONS=141} [2024-06-14 14:39:23,209 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 120 predicate places. [2024-06-14 14:39:23,210 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 141 transitions, 1183 flow [2024-06-14 14:39:23,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:39:23,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:39:23,210 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:39:23,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-14 14:39:23,210 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:39:23,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:39:23,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1669581784, now seen corresponding path program 7 times [2024-06-14 14:39:23,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:39:23,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644600491] [2024-06-14 14:39:23,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:39:23,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:39:23,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:39:32,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:39:32,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:39:32,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644600491] [2024-06-14 14:39:32,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644600491] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:39:32,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:39:32,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:39:32,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520751877] [2024-06-14 14:39:32,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:39:32,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:39:32,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:39:32,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:39:32,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:39:32,403 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 14:39:32,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 141 transitions, 1183 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 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-06-14 14:39:32,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:39:32,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 14:39:32,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:39:32,647 INFO L124 PetriNetUnfolderBase]: 348/630 cut-off events. [2024-06-14 14:39:32,647 INFO L125 PetriNetUnfolderBase]: For 35397/35400 co-relation queries the response was YES. [2024-06-14 14:39:32,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4580 conditions, 630 events. 348/630 cut-off events. For 35397/35400 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2724 event pairs, 45 based on Foata normal form. 2/627 useless extension candidates. Maximal degree in co-relation 4506. Up to 517 conditions per place. [2024-06-14 14:39:32,652 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 118 selfloop transitions, 33 changer transitions 0/154 dead transitions. [2024-06-14 14:39:32,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 154 transitions, 1531 flow [2024-06-14 14:39:32,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:39:32,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:39:32,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 126 transitions. [2024-06-14 14:39:32,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-14 14:39:32,653 INFO L175 Difference]: Start difference. First operand has 152 places, 141 transitions, 1183 flow. Second operand 9 states and 126 transitions. [2024-06-14 14:39:32,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 154 transitions, 1531 flow [2024-06-14 14:39:32,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 154 transitions, 1444 flow, removed 26 selfloop flow, removed 7 redundant places. [2024-06-14 14:39:32,703 INFO L231 Difference]: Finished difference. Result has 154 places, 141 transitions, 1167 flow [2024-06-14 14:39:32,703 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1096, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1167, PETRI_PLACES=154, PETRI_TRANSITIONS=141} [2024-06-14 14:39:32,703 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 122 predicate places. [2024-06-14 14:39:32,703 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 141 transitions, 1167 flow [2024-06-14 14:39:32,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 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-06-14 14:39:32,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:39:32,703 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:39:32,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-14 14:39:32,704 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:39:32,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:39:32,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1669581536, now seen corresponding path program 9 times [2024-06-14 14:39:32,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:39:32,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988773151] [2024-06-14 14:39:32,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:39:32,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:39:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:39:41,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:39:41,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:39:41,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988773151] [2024-06-14 14:39:41,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988773151] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:39:41,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:39:41,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:39:41,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189984530] [2024-06-14 14:39:41,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:39:41,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:39:41,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:39:41,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:39:41,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:39:41,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:39:41,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 141 transitions, 1167 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:39:41,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:39:41,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:39:41,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:39:41,963 INFO L124 PetriNetUnfolderBase]: 351/635 cut-off events. [2024-06-14 14:39:41,963 INFO L125 PetriNetUnfolderBase]: For 35542/35545 co-relation queries the response was YES. [2024-06-14 14:39:41,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4641 conditions, 635 events. 351/635 cut-off events. For 35542/35545 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2742 event pairs, 53 based on Foata normal form. 1/631 useless extension candidates. Maximal degree in co-relation 4566. Up to 485 conditions per place. [2024-06-14 14:39:41,968 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 108 selfloop transitions, 43 changer transitions 0/154 dead transitions. [2024-06-14 14:39:41,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 154 transitions, 1581 flow [2024-06-14 14:39:41,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:39:41,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:39:41,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-14 14:39:41,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4006734006734007 [2024-06-14 14:39:41,972 INFO L175 Difference]: Start difference. First operand has 154 places, 141 transitions, 1167 flow. Second operand 9 states and 119 transitions. [2024-06-14 14:39:41,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 154 transitions, 1581 flow [2024-06-14 14:39:42,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 154 transitions, 1502 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-14 14:39:42,017 INFO L231 Difference]: Finished difference. Result has 155 places, 143 transitions, 1233 flow [2024-06-14 14:39:42,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1088, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1233, PETRI_PLACES=155, PETRI_TRANSITIONS=143} [2024-06-14 14:39:42,018 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 123 predicate places. [2024-06-14 14:39:42,018 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 143 transitions, 1233 flow [2024-06-14 14:39:42,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:39:42,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:39:42,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:39:42,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-14 14:39:42,018 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:39:42,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:39:42,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1965165854, now seen corresponding path program 2 times [2024-06-14 14:39:42,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:39:42,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436154518] [2024-06-14 14:39:42,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:39:42,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:39:42,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:39:51,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:39:51,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:39:51,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436154518] [2024-06-14 14:39:51,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436154518] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:39:51,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:39:51,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:39:51,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645906979] [2024-06-14 14:39:51,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:39:51,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:39:51,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:39:51,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:39:51,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:39:51,517 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 14:39:51,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 143 transitions, 1233 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:39:51,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:39:51,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 14:39:51,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:39:51,907 INFO L124 PetriNetUnfolderBase]: 340/624 cut-off events. [2024-06-14 14:39:51,907 INFO L125 PetriNetUnfolderBase]: For 39054/39059 co-relation queries the response was YES. [2024-06-14 14:39:51,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4709 conditions, 624 events. 340/624 cut-off events. For 39054/39059 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2763 event pairs, 41 based on Foata normal form. 4/624 useless extension candidates. Maximal degree in co-relation 4633. Up to 517 conditions per place. [2024-06-14 14:39:51,912 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 116 selfloop transitions, 18 changer transitions 0/158 dead transitions. [2024-06-14 14:39:51,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 158 transitions, 1693 flow [2024-06-14 14:39:51,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:39:51,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:39:51,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-14 14:39:51,914 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38484848484848483 [2024-06-14 14:39:51,914 INFO L175 Difference]: Start difference. First operand has 155 places, 143 transitions, 1233 flow. Second operand 10 states and 127 transitions. [2024-06-14 14:39:51,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 158 transitions, 1693 flow [2024-06-14 14:39:51,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 158 transitions, 1564 flow, removed 23 selfloop flow, removed 7 redundant places. [2024-06-14 14:39:51,963 INFO L231 Difference]: Finished difference. Result has 158 places, 147 transitions, 1217 flow [2024-06-14 14:39:51,963 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1104, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1217, PETRI_PLACES=158, PETRI_TRANSITIONS=147} [2024-06-14 14:39:51,964 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 126 predicate places. [2024-06-14 14:39:51,964 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 147 transitions, 1217 flow [2024-06-14 14:39:51,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:39:51,964 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:39:51,964 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:39:51,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-14 14:39:51,964 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:39:51,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:39:51,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1964809664, now seen corresponding path program 3 times [2024-06-14 14:39:51,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:39:51,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082230698] [2024-06-14 14:39:51,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:39:51,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:39:52,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:40:03,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:40:03,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:40:03,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082230698] [2024-06-14 14:40:03,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082230698] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:40:03,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:40:03,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:40:03,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455600624] [2024-06-14 14:40:03,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:40:03,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:40:03,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:40:03,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:40:03,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:40:03,439 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 14:40:03,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 147 transitions, 1217 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:40:03,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:40:03,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 14:40:03,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:40:03,861 INFO L124 PetriNetUnfolderBase]: 338/621 cut-off events. [2024-06-14 14:40:03,861 INFO L125 PetriNetUnfolderBase]: For 38988/38993 co-relation queries the response was YES. [2024-06-14 14:40:03,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4592 conditions, 621 events. 338/621 cut-off events. For 38988/38993 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2758 event pairs, 41 based on Foata normal form. 4/621 useless extension candidates. Maximal degree in co-relation 4515. Up to 521 conditions per place. [2024-06-14 14:40:03,865 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 118 selfloop transitions, 14 changer transitions 0/156 dead transitions. [2024-06-14 14:40:03,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 156 transitions, 1503 flow [2024-06-14 14:40:03,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:40:03,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:40:03,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-14 14:40:03,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3838383838383838 [2024-06-14 14:40:03,867 INFO L175 Difference]: Start difference. First operand has 158 places, 147 transitions, 1217 flow. Second operand 9 states and 114 transitions. [2024-06-14 14:40:03,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 156 transitions, 1503 flow [2024-06-14 14:40:03,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 156 transitions, 1426 flow, removed 30 selfloop flow, removed 6 redundant places. [2024-06-14 14:40:03,919 INFO L231 Difference]: Finished difference. Result has 161 places, 147 transitions, 1173 flow [2024-06-14 14:40:03,920 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1173, PETRI_PLACES=161, PETRI_TRANSITIONS=147} [2024-06-14 14:40:03,920 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 129 predicate places. [2024-06-14 14:40:03,920 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 147 transitions, 1173 flow [2024-06-14 14:40:03,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:40:03,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:40:03,920 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:40:03,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-14 14:40:03,920 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:40:03,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:40:03,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1954681406, now seen corresponding path program 10 times [2024-06-14 14:40:03,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:40:03,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255576585] [2024-06-14 14:40:03,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:40:03,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:40:03,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:40:15,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:40:15,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:40:15,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255576585] [2024-06-14 14:40:15,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255576585] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:40:15,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:40:15,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:40:15,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969179472] [2024-06-14 14:40:15,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:40:15,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:40:15,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:40:15,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:40:15,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:40:15,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:40:15,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 147 transitions, 1173 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:40:15,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:40:15,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:40:15,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:40:15,537 INFO L124 PetriNetUnfolderBase]: 355/642 cut-off events. [2024-06-14 14:40:15,537 INFO L125 PetriNetUnfolderBase]: For 38489/38492 co-relation queries the response was YES. [2024-06-14 14:40:15,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4669 conditions, 642 events. 355/642 cut-off events. For 38489/38492 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2790 event pairs, 53 based on Foata normal form. 1/638 useless extension candidates. Maximal degree in co-relation 4590. Up to 437 conditions per place. [2024-06-14 14:40:15,543 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 89 selfloop transitions, 67 changer transitions 0/159 dead transitions. [2024-06-14 14:40:15,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 159 transitions, 1583 flow [2024-06-14 14:40:15,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:40:15,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:40:15,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-14 14:40:15,545 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2024-06-14 14:40:15,545 INFO L175 Difference]: Start difference. First operand has 161 places, 147 transitions, 1173 flow. Second operand 9 states and 117 transitions. [2024-06-14 14:40:15,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 159 transitions, 1583 flow [2024-06-14 14:40:15,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 159 transitions, 1556 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-14 14:40:15,602 INFO L231 Difference]: Finished difference. Result has 163 places, 149 transitions, 1343 flow [2024-06-14 14:40:15,602 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1146, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1343, PETRI_PLACES=163, PETRI_TRANSITIONS=149} [2024-06-14 14:40:15,603 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 131 predicate places. [2024-06-14 14:40:15,603 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 149 transitions, 1343 flow [2024-06-14 14:40:15,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:40:15,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:40:15,603 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:40:15,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-14 14:40:15,604 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:40:15,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:40:15,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1954681654, now seen corresponding path program 8 times [2024-06-14 14:40:15,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:40:15,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077227546] [2024-06-14 14:40:15,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:40:15,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:40:15,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:40:23,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:40:23,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:40:23,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077227546] [2024-06-14 14:40:23,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077227546] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:40:23,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:40:23,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:40:23,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136286121] [2024-06-14 14:40:23,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:40:23,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:40:23,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:40:23,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:40:23,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:40:23,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 14:40:23,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 149 transitions, 1343 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 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-06-14 14:40:23,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:40:23,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 14:40:23,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:40:24,276 INFO L124 PetriNetUnfolderBase]: 366/660 cut-off events. [2024-06-14 14:40:24,276 INFO L125 PetriNetUnfolderBase]: For 43535/43538 co-relation queries the response was YES. [2024-06-14 14:40:24,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5077 conditions, 660 events. 366/660 cut-off events. For 43535/43538 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2879 event pairs, 45 based on Foata normal form. 2/657 useless extension candidates. Maximal degree in co-relation 4997. Up to 448 conditions per place. [2024-06-14 14:40:24,281 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 109 selfloop transitions, 61 changer transitions 0/173 dead transitions. [2024-06-14 14:40:24,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 173 transitions, 2217 flow [2024-06-14 14:40:24,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:40:24,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:40:24,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 131 transitions. [2024-06-14 14:40:24,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44107744107744107 [2024-06-14 14:40:24,284 INFO L175 Difference]: Start difference. First operand has 163 places, 149 transitions, 1343 flow. Second operand 9 states and 131 transitions. [2024-06-14 14:40:24,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 173 transitions, 2217 flow [2024-06-14 14:40:24,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 173 transitions, 2036 flow, removed 25 selfloop flow, removed 7 redundant places. [2024-06-14 14:40:24,338 INFO L231 Difference]: Finished difference. Result has 166 places, 157 transitions, 1477 flow [2024-06-14 14:40:24,338 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1162, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1477, PETRI_PLACES=166, PETRI_TRANSITIONS=157} [2024-06-14 14:40:24,338 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 134 predicate places. [2024-06-14 14:40:24,339 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 157 transitions, 1477 flow [2024-06-14 14:40:24,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 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-06-14 14:40:24,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:40:24,339 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:40:24,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-14 14:40:24,339 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:40:24,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:40:24,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1504771490, now seen corresponding path program 4 times [2024-06-14 14:40:24,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:40:24,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669722148] [2024-06-14 14:40:24,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:40:24,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:40:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:40:33,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:40:33,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:40:33,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669722148] [2024-06-14 14:40:33,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669722148] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:40:33,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:40:33,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:40:33,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835736907] [2024-06-14 14:40:33,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:40:33,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:40:33,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:40:33,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:40:33,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:40:33,789 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 14:40:33,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 157 transitions, 1477 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:40:33,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:40:33,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 14:40:33,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:40:34,102 INFO L124 PetriNetUnfolderBase]: 345/635 cut-off events. [2024-06-14 14:40:34,102 INFO L125 PetriNetUnfolderBase]: For 42672/42679 co-relation queries the response was YES. [2024-06-14 14:40:34,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4851 conditions, 635 events. 345/635 cut-off events. For 42672/42679 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2840 event pairs, 40 based on Foata normal form. 7/638 useless extension candidates. Maximal degree in co-relation 4769. Up to 489 conditions per place. [2024-06-14 14:40:34,107 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 111 selfloop transitions, 29 changer transitions 0/167 dead transitions. [2024-06-14 14:40:34,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 167 transitions, 1785 flow [2024-06-14 14:40:34,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:40:34,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:40:34,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-14 14:40:34,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4006734006734007 [2024-06-14 14:40:34,109 INFO L175 Difference]: Start difference. First operand has 166 places, 157 transitions, 1477 flow. Second operand 9 states and 119 transitions. [2024-06-14 14:40:34,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 167 transitions, 1785 flow [2024-06-14 14:40:34,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 167 transitions, 1685 flow, removed 37 selfloop flow, removed 3 redundant places. [2024-06-14 14:40:34,168 INFO L231 Difference]: Finished difference. Result has 172 places, 157 transitions, 1440 flow [2024-06-14 14:40:34,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1377, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1440, PETRI_PLACES=172, PETRI_TRANSITIONS=157} [2024-06-14 14:40:34,168 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 140 predicate places. [2024-06-14 14:40:34,168 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 157 transitions, 1440 flow [2024-06-14 14:40:34,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:40:34,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:40:34,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:40:34,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-14 14:40:34,169 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:40:34,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:40:34,169 INFO L85 PathProgramCache]: Analyzing trace with hash -9788390, now seen corresponding path program 9 times [2024-06-14 14:40:34,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:40:34,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524596929] [2024-06-14 14:40:34,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:40:34,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:40:34,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:40:43,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:40:43,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:40:43,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524596929] [2024-06-14 14:40:43,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524596929] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:40:43,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:40:43,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:40:43,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697472966] [2024-06-14 14:40:43,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:40:43,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:40:43,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:40:43,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:40:43,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:40:43,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-14 14:40:43,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 157 transitions, 1440 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:40:43,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:40:43,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-14 14:40:43,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:40:44,186 INFO L124 PetriNetUnfolderBase]: 367/662 cut-off events. [2024-06-14 14:40:44,186 INFO L125 PetriNetUnfolderBase]: For 43420/43423 co-relation queries the response was YES. [2024-06-14 14:40:44,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5021 conditions, 662 events. 367/662 cut-off events. For 43420/43423 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2892 event pairs, 45 based on Foata normal form. 1/658 useless extension candidates. Maximal degree in co-relation 4937. Up to 508 conditions per place. [2024-06-14 14:40:44,190 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 123 selfloop transitions, 52 changer transitions 0/178 dead transitions. [2024-06-14 14:40:44,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 178 transitions, 2044 flow [2024-06-14 14:40:44,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:40:44,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:40:44,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2024-06-14 14:40:44,192 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-14 14:40:44,192 INFO L175 Difference]: Start difference. First operand has 172 places, 157 transitions, 1440 flow. Second operand 9 states and 108 transitions. [2024-06-14 14:40:44,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 178 transitions, 2044 flow [2024-06-14 14:40:44,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 178 transitions, 1969 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-14 14:40:44,252 INFO L231 Difference]: Finished difference. Result has 175 places, 167 transitions, 1635 flow [2024-06-14 14:40:44,252 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1365, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1635, PETRI_PLACES=175, PETRI_TRANSITIONS=167} [2024-06-14 14:40:44,253 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 143 predicate places. [2024-06-14 14:40:44,253 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 167 transitions, 1635 flow [2024-06-14 14:40:44,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:40:44,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:40:44,253 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:40:44,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-14 14:40:44,253 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:40:44,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:40:44,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1964809354, now seen corresponding path program 10 times [2024-06-14 14:40:44,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:40:44,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013022513] [2024-06-14 14:40:44,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:40:44,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:40:44,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:40:53,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-06-14 14:40:53,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:40:53,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013022513] [2024-06-14 14:40:53,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013022513] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:40:53,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:40:53,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:40:53,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820573511] [2024-06-14 14:40:53,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:40:53,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:40:53,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:40:53,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:40:53,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:40:53,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 14:40:53,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 167 transitions, 1635 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 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-06-14 14:40:53,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:40:53,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 14:40:53,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:40:54,052 INFO L124 PetriNetUnfolderBase]: 368/664 cut-off events. [2024-06-14 14:40:54,052 INFO L125 PetriNetUnfolderBase]: For 45206/45206 co-relation queries the response was YES. [2024-06-14 14:40:54,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5152 conditions, 664 events. 368/664 cut-off events. For 45206/45206 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2918 event pairs, 46 based on Foata normal form. 2/664 useless extension candidates. Maximal degree in co-relation 5065. Up to 606 conditions per place. [2024-06-14 14:40:54,056 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 156 selfloop transitions, 19 changer transitions 0/178 dead transitions. [2024-06-14 14:40:54,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 178 transitions, 2051 flow [2024-06-14 14:40:54,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:40:54,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:40:54,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-14 14:40:54,057 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39730639730639733 [2024-06-14 14:40:54,057 INFO L175 Difference]: Start difference. First operand has 175 places, 167 transitions, 1635 flow. Second operand 9 states and 118 transitions. [2024-06-14 14:40:54,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 178 transitions, 2051 flow [2024-06-14 14:40:54,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 178 transitions, 1969 flow, removed 28 selfloop flow, removed 3 redundant places. [2024-06-14 14:40:54,113 INFO L231 Difference]: Finished difference. Result has 181 places, 169 transitions, 1647 flow [2024-06-14 14:40:54,113 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1553, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1647, PETRI_PLACES=181, PETRI_TRANSITIONS=169} [2024-06-14 14:40:54,113 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 149 predicate places. [2024-06-14 14:40:54,113 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 169 transitions, 1647 flow [2024-06-14 14:40:54,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 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-06-14 14:40:54,114 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:40:54,114 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:40:54,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-14 14:40:54,114 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:40:54,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:40:54,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1733484132, now seen corresponding path program 1 times [2024-06-14 14:40:54,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:40:54,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119343172] [2024-06-14 14:40:54,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:40:54,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:40:54,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:41:03,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:41:03,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:41:03,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119343172] [2024-06-14 14:41:03,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119343172] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:41:03,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:41:03,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:41:03,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921887115] [2024-06-14 14:41:03,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:41:03,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:41:03,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:41:03,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:41:03,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:41:03,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:41:03,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 169 transitions, 1647 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:41:03,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:41:03,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:41:03,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:41:03,907 INFO L124 PetriNetUnfolderBase]: 371/670 cut-off events. [2024-06-14 14:41:03,907 INFO L125 PetriNetUnfolderBase]: For 45245/45245 co-relation queries the response was YES. [2024-06-14 14:41:03,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5225 conditions, 670 events. 371/670 cut-off events. For 45245/45245 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2966 event pairs, 36 based on Foata normal form. 1/669 useless extension candidates. Maximal degree in co-relation 5136. Up to 575 conditions per place. [2024-06-14 14:41:03,913 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 164 selfloop transitions, 25 changer transitions 0/192 dead transitions. [2024-06-14 14:41:03,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 192 transitions, 2145 flow [2024-06-14 14:41:03,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:41:03,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:41:03,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2024-06-14 14:41:03,914 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3878787878787879 [2024-06-14 14:41:03,914 INFO L175 Difference]: Start difference. First operand has 181 places, 169 transitions, 1647 flow. Second operand 10 states and 128 transitions. [2024-06-14 14:41:03,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 192 transitions, 2145 flow [2024-06-14 14:41:03,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 192 transitions, 2073 flow, removed 20 selfloop flow, removed 7 redundant places. [2024-06-14 14:41:03,974 INFO L231 Difference]: Finished difference. Result has 184 places, 171 transitions, 1690 flow [2024-06-14 14:41:03,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1575, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1690, PETRI_PLACES=184, PETRI_TRANSITIONS=171} [2024-06-14 14:41:03,974 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 152 predicate places. [2024-06-14 14:41:03,975 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 171 transitions, 1690 flow [2024-06-14 14:41:03,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:41:03,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:41:03,975 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:41:03,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-14 14:41:03,975 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:41:03,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:41:03,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1729759265, now seen corresponding path program 1 times [2024-06-14 14:41:03,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:41:03,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520413099] [2024-06-14 14:41:03,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:41:03,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:41:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:41:14,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:41:14,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:41:14,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520413099] [2024-06-14 14:41:14,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520413099] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:41:14,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:41:14,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:41:14,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60443044] [2024-06-14 14:41:14,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:41:14,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:41:14,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:41:14,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:41:14,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:41:15,167 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:41:15,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 171 transitions, 1690 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:41:15,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:41:15,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:41:15,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:41:15,585 INFO L124 PetriNetUnfolderBase]: 377/680 cut-off events. [2024-06-14 14:41:15,585 INFO L125 PetriNetUnfolderBase]: For 48498/48498 co-relation queries the response was YES. [2024-06-14 14:41:15,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5353 conditions, 680 events. 377/680 cut-off events. For 48498/48498 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3006 event pairs, 35 based on Foata normal form. 2/680 useless extension candidates. Maximal degree in co-relation 5263. Up to 576 conditions per place. [2024-06-14 14:41:15,591 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 161 selfloop transitions, 29 changer transitions 0/193 dead transitions. [2024-06-14 14:41:15,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 193 transitions, 2204 flow [2024-06-14 14:41:15,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:41:15,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:41:15,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2024-06-14 14:41:15,597 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3878787878787879 [2024-06-14 14:41:15,597 INFO L175 Difference]: Start difference. First operand has 184 places, 171 transitions, 1690 flow. Second operand 10 states and 128 transitions. [2024-06-14 14:41:15,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 193 transitions, 2204 flow [2024-06-14 14:41:15,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 193 transitions, 2105 flow, removed 26 selfloop flow, removed 8 redundant places. [2024-06-14 14:41:15,666 INFO L231 Difference]: Finished difference. Result has 186 places, 174 transitions, 1717 flow [2024-06-14 14:41:15,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1591, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1717, PETRI_PLACES=186, PETRI_TRANSITIONS=174} [2024-06-14 14:41:15,667 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 154 predicate places. [2024-06-14 14:41:15,667 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 174 transitions, 1717 flow [2024-06-14 14:41:15,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:41:15,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:41:15,667 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:41:15,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-14 14:41:15,668 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:41:15,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:41:15,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1729759482, now seen corresponding path program 2 times [2024-06-14 14:41:15,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:41:15,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639909937] [2024-06-14 14:41:15,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:41:15,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:41:15,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:41:25,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:41:25,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:41:25,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639909937] [2024-06-14 14:41:25,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639909937] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:41:25,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:41:25,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:41:25,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570481725] [2024-06-14 14:41:25,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:41:25,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:41:25,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:41:25,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:41:25,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:41:25,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 14:41:25,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 174 transitions, 1717 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:41:25,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:41:25,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 14:41:25,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:41:26,250 INFO L124 PetriNetUnfolderBase]: 380/687 cut-off events. [2024-06-14 14:41:26,250 INFO L125 PetriNetUnfolderBase]: For 49472/49472 co-relation queries the response was YES. [2024-06-14 14:41:26,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5471 conditions, 687 events. 380/687 cut-off events. For 49472/49472 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3080 event pairs, 35 based on Foata normal form. 1/686 useless extension candidates. Maximal degree in co-relation 5380. Up to 584 conditions per place. [2024-06-14 14:41:26,255 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 164 selfloop transitions, 28 changer transitions 0/195 dead transitions. [2024-06-14 14:41:26,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 195 transitions, 2243 flow [2024-06-14 14:41:26,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:41:26,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:41:26,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2024-06-14 14:41:26,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41515151515151516 [2024-06-14 14:41:26,256 INFO L175 Difference]: Start difference. First operand has 186 places, 174 transitions, 1717 flow. Second operand 10 states and 137 transitions. [2024-06-14 14:41:26,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 195 transitions, 2243 flow [2024-06-14 14:41:26,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 195 transitions, 2139 flow, removed 25 selfloop flow, removed 8 redundant places. [2024-06-14 14:41:26,329 INFO L231 Difference]: Finished difference. Result has 188 places, 176 transitions, 1740 flow [2024-06-14 14:41:26,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1613, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1740, PETRI_PLACES=188, PETRI_TRANSITIONS=176} [2024-06-14 14:41:26,330 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 156 predicate places. [2024-06-14 14:41:26,330 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 176 transitions, 1740 flow [2024-06-14 14:41:26,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:41:26,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:41:26,331 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:41:26,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-14 14:41:26,331 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:41:26,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:41:26,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1585868735, now seen corresponding path program 2 times [2024-06-14 14:41:26,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:41:26,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232041150] [2024-06-14 14:41:26,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:41:26,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:41:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:41:35,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:41:35,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:41:35,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232041150] [2024-06-14 14:41:35,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232041150] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:41:35,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:41:35,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:41:35,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350615180] [2024-06-14 14:41:35,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:41:35,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:41:35,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:41:35,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:41:35,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:41:35,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:41:35,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 176 transitions, 1740 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:41:35,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:41:35,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:41:35,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:41:35,665 INFO L124 PetriNetUnfolderBase]: 386/698 cut-off events. [2024-06-14 14:41:35,665 INFO L125 PetriNetUnfolderBase]: For 53088/53088 co-relation queries the response was YES. [2024-06-14 14:41:35,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5558 conditions, 698 events. 386/698 cut-off events. For 53088/53088 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3134 event pairs, 38 based on Foata normal form. 2/698 useless extension candidates. Maximal degree in co-relation 5466. Up to 582 conditions per place. [2024-06-14 14:41:35,671 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 162 selfloop transitions, 31 changer transitions 0/196 dead transitions. [2024-06-14 14:41:35,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 196 transitions, 2284 flow [2024-06-14 14:41:35,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:41:35,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:41:35,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2024-06-14 14:41:35,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3878787878787879 [2024-06-14 14:41:35,672 INFO L175 Difference]: Start difference. First operand has 188 places, 176 transitions, 1740 flow. Second operand 10 states and 128 transitions. [2024-06-14 14:41:35,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 196 transitions, 2284 flow [2024-06-14 14:41:35,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 196 transitions, 2173 flow, removed 29 selfloop flow, removed 8 redundant places. [2024-06-14 14:41:35,741 INFO L231 Difference]: Finished difference. Result has 190 places, 179 transitions, 1767 flow [2024-06-14 14:41:35,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1629, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1767, PETRI_PLACES=190, PETRI_TRANSITIONS=179} [2024-06-14 14:41:35,742 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 158 predicate places. [2024-06-14 14:41:35,742 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 179 transitions, 1767 flow [2024-06-14 14:41:35,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:41:35,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:41:35,743 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:41:35,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-14 14:41:35,743 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:41:35,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:41:35,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1585868952, now seen corresponding path program 3 times [2024-06-14 14:41:35,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:41:35,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009986181] [2024-06-14 14:41:35,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:41:35,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:41:35,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:41:46,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:41:46,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:41:46,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009986181] [2024-06-14 14:41:46,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009986181] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:41:46,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:41:46,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:41:46,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425582158] [2024-06-14 14:41:46,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:41:46,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:41:46,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:41:46,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:41:46,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:41:46,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 14:41:46,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 179 transitions, 1767 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:41:46,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:41:46,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 14:41:46,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:41:47,268 INFO L124 PetriNetUnfolderBase]: 389/705 cut-off events. [2024-06-14 14:41:47,268 INFO L125 PetriNetUnfolderBase]: For 53297/53297 co-relation queries the response was YES. [2024-06-14 14:41:47,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5666 conditions, 705 events. 389/705 cut-off events. For 53297/53297 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3195 event pairs, 38 based on Foata normal form. 1/704 useless extension candidates. Maximal degree in co-relation 5573. Up to 590 conditions per place. [2024-06-14 14:41:47,274 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 165 selfloop transitions, 30 changer transitions 0/198 dead transitions. [2024-06-14 14:41:47,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 198 transitions, 2323 flow [2024-06-14 14:41:47,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:41:47,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:41:47,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2024-06-14 14:41:47,275 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41515151515151516 [2024-06-14 14:41:47,275 INFO L175 Difference]: Start difference. First operand has 190 places, 179 transitions, 1767 flow. Second operand 10 states and 137 transitions. [2024-06-14 14:41:47,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 198 transitions, 2323 flow [2024-06-14 14:41:47,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 198 transitions, 2207 flow, removed 29 selfloop flow, removed 8 redundant places. [2024-06-14 14:41:47,338 INFO L231 Difference]: Finished difference. Result has 192 places, 181 transitions, 1788 flow [2024-06-14 14:41:47,339 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1651, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1788, PETRI_PLACES=192, PETRI_TRANSITIONS=181} [2024-06-14 14:41:47,339 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 160 predicate places. [2024-06-14 14:41:47,339 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 181 transitions, 1788 flow [2024-06-14 14:41:47,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:41:47,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:41:47,339 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:41:47,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-14 14:41:47,340 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:41:47,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:41:47,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1564870093, now seen corresponding path program 3 times [2024-06-14 14:41:47,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:41:47,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321728756] [2024-06-14 14:41:47,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:41:47,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:41:47,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:41:55,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:41:55,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:41:55,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321728756] [2024-06-14 14:41:55,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321728756] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:41:55,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:41:55,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:41:55,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878446266] [2024-06-14 14:41:55,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:41:55,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:41:55,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:41:55,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:41:55,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:41:55,975 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:41:55,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 181 transitions, 1788 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:41:55,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:41:55,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:41:55,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:41:56,450 INFO L124 PetriNetUnfolderBase]: 410/739 cut-off events. [2024-06-14 14:41:56,451 INFO L125 PetriNetUnfolderBase]: For 63026/63026 co-relation queries the response was YES. [2024-06-14 14:41:56,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6163 conditions, 739 events. 410/739 cut-off events. For 63026/63026 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3368 event pairs, 37 based on Foata normal form. 2/739 useless extension candidates. Maximal degree in co-relation 6069. Up to 566 conditions per place. [2024-06-14 14:41:56,458 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 158 selfloop transitions, 45 changer transitions 0/206 dead transitions. [2024-06-14 14:41:56,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 206 transitions, 2543 flow [2024-06-14 14:41:56,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:41:56,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:41:56,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions. [2024-06-14 14:41:56,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-14 14:41:56,459 INFO L175 Difference]: Start difference. First operand has 192 places, 181 transitions, 1788 flow. Second operand 10 states and 132 transitions. [2024-06-14 14:41:56,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 206 transitions, 2543 flow [2024-06-14 14:41:56,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 206 transitions, 2422 flow, removed 32 selfloop flow, removed 8 redundant places. [2024-06-14 14:41:56,537 INFO L231 Difference]: Finished difference. Result has 195 places, 186 transitions, 1905 flow [2024-06-14 14:41:56,537 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1667, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1905, PETRI_PLACES=195, PETRI_TRANSITIONS=186} [2024-06-14 14:41:56,538 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 163 predicate places. [2024-06-14 14:41:56,538 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 186 transitions, 1905 flow [2024-06-14 14:41:56,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:41:56,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:41:56,538 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:41:56,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-14 14:41:56,539 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:41:56,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:41:56,539 INFO L85 PathProgramCache]: Analyzing trace with hash 294005343, now seen corresponding path program 4 times [2024-06-14 14:41:56,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:41:56,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960078619] [2024-06-14 14:41:56,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:41:56,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:41:56,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:42:06,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:42:06,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:42:06,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960078619] [2024-06-14 14:42:06,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960078619] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:42:06,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:42:06,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:42:06,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705860236] [2024-06-14 14:42:06,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:42:06,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:42:06,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:42:06,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:42:06,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:42:06,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:42:06,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 186 transitions, 1905 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:42:06,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:42:06,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:42:06,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:42:06,772 INFO L124 PetriNetUnfolderBase]: 411/741 cut-off events. [2024-06-14 14:42:06,772 INFO L125 PetriNetUnfolderBase]: For 63403/63403 co-relation queries the response was YES. [2024-06-14 14:42:06,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6252 conditions, 741 events. 411/741 cut-off events. For 63403/63403 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3382 event pairs, 38 based on Foata normal form. 2/741 useless extension candidates. Maximal degree in co-relation 6156. Up to 569 conditions per place. [2024-06-14 14:42:06,779 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 160 selfloop transitions, 45 changer transitions 0/208 dead transitions. [2024-06-14 14:42:06,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 208 transitions, 2600 flow [2024-06-14 14:42:06,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:42:06,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:42:06,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-14 14:42:06,780 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403030303030303 [2024-06-14 14:42:06,780 INFO L175 Difference]: Start difference. First operand has 195 places, 186 transitions, 1905 flow. Second operand 10 states and 133 transitions. [2024-06-14 14:42:06,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 208 transitions, 2600 flow [2024-06-14 14:42:06,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 208 transitions, 2513 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-14 14:42:06,896 INFO L231 Difference]: Finished difference. Result has 199 places, 188 transitions, 1963 flow [2024-06-14 14:42:06,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1820, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1963, PETRI_PLACES=199, PETRI_TRANSITIONS=188} [2024-06-14 14:42:06,897 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 167 predicate places. [2024-06-14 14:42:06,897 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 188 transitions, 1963 flow [2024-06-14 14:42:06,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:42:06,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:42:06,897 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:42:06,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-14 14:42:06,898 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:42:06,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:42:06,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1585667142, now seen corresponding path program 4 times [2024-06-14 14:42:06,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:42:06,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473030611] [2024-06-14 14:42:06,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:42:06,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:42:06,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:42:18,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-06-14 14:42:18,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:42:18,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473030611] [2024-06-14 14:42:18,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473030611] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:42:18,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:42:18,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:42:18,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540881086] [2024-06-14 14:42:18,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:42:18,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:42:18,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:42:18,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:42:18,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:42:18,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 14:42:18,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 188 transitions, 1963 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:42:18,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:42:18,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 14:42:18,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:42:18,728 INFO L124 PetriNetUnfolderBase]: 414/748 cut-off events. [2024-06-14 14:42:18,728 INFO L125 PetriNetUnfolderBase]: For 63353/63353 co-relation queries the response was YES. [2024-06-14 14:42:18,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6380 conditions, 748 events. 414/748 cut-off events. For 63353/63353 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3420 event pairs, 39 based on Foata normal form. 1/747 useless extension candidates. Maximal degree in co-relation 6282. Up to 609 conditions per place. [2024-06-14 14:42:18,735 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 165 selfloop transitions, 38 changer transitions 0/206 dead transitions. [2024-06-14 14:42:18,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 206 transitions, 2517 flow [2024-06-14 14:42:18,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:42:18,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:42:18,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2024-06-14 14:42:18,738 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41515151515151516 [2024-06-14 14:42:18,738 INFO L175 Difference]: Start difference. First operand has 199 places, 188 transitions, 1963 flow. Second operand 10 states and 137 transitions. [2024-06-14 14:42:18,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 206 transitions, 2517 flow [2024-06-14 14:42:18,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 206 transitions, 2415 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-14 14:42:18,843 INFO L231 Difference]: Finished difference. Result has 202 places, 190 transitions, 2020 flow [2024-06-14 14:42:18,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1861, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2020, PETRI_PLACES=202, PETRI_TRANSITIONS=190} [2024-06-14 14:42:18,844 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 170 predicate places. [2024-06-14 14:42:18,844 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 190 transitions, 2020 flow [2024-06-14 14:42:18,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:42:18,845 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:42:18,845 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:42:18,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-14 14:42:18,845 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:42:18,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:42:18,845 INFO L85 PathProgramCache]: Analyzing trace with hash -533649658, now seen corresponding path program 5 times [2024-06-14 14:42:18,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:42:18,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660208356] [2024-06-14 14:42:18,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:42:18,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:42:18,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:42:30,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:42:30,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:42:30,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660208356] [2024-06-14 14:42:30,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660208356] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:42:30,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:42:30,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:42:30,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428739402] [2024-06-14 14:42:30,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:42:30,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:42:30,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:42:30,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:42:30,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:42:31,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 14:42:31,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 190 transitions, 2020 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:42:31,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:42:31,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 14:42:31,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:42:31,466 INFO L124 PetriNetUnfolderBase]: 417/755 cut-off events. [2024-06-14 14:42:31,467 INFO L125 PetriNetUnfolderBase]: For 65753/65753 co-relation queries the response was YES. [2024-06-14 14:42:31,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6464 conditions, 755 events. 417/755 cut-off events. For 65753/65753 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3482 event pairs, 43 based on Foata normal form. 1/754 useless extension candidates. Maximal degree in co-relation 6365. Up to 622 conditions per place. [2024-06-14 14:42:31,473 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 170 selfloop transitions, 33 changer transitions 0/206 dead transitions. [2024-06-14 14:42:31,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 206 transitions, 2598 flow [2024-06-14 14:42:31,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:42:31,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:42:31,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 136 transitions. [2024-06-14 14:42:31,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121212121212121 [2024-06-14 14:42:31,475 INFO L175 Difference]: Start difference. First operand has 202 places, 190 transitions, 2020 flow. Second operand 10 states and 136 transitions. [2024-06-14 14:42:31,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 206 transitions, 2598 flow [2024-06-14 14:42:31,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 206 transitions, 2455 flow, removed 35 selfloop flow, removed 8 redundant places. [2024-06-14 14:42:31,586 INFO L231 Difference]: Finished difference. Result has 204 places, 192 transitions, 2030 flow [2024-06-14 14:42:31,586 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1877, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2030, PETRI_PLACES=204, PETRI_TRANSITIONS=192} [2024-06-14 14:42:31,586 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 172 predicate places. [2024-06-14 14:42:31,586 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 192 transitions, 2030 flow [2024-06-14 14:42:31,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:42:31,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:42:31,587 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:42:31,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-14 14:42:31,587 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:42:31,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:42:31,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1346022827, now seen corresponding path program 5 times [2024-06-14 14:42:31,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:42:31,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373555593] [2024-06-14 14:42:31,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:42:31,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:42:31,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:42:40,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:42:40,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:42:40,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373555593] [2024-06-14 14:42:40,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373555593] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:42:40,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:42:40,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:42:40,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12695734] [2024-06-14 14:42:40,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:42:40,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:42:40,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:42:40,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:42:40,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:42:40,478 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 14:42:40,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 192 transitions, 2030 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:42:40,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:42:40,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 14:42:40,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:42:40,823 INFO L124 PetriNetUnfolderBase]: 429/775 cut-off events. [2024-06-14 14:42:40,823 INFO L125 PetriNetUnfolderBase]: For 74449/74449 co-relation queries the response was YES. [2024-06-14 14:42:40,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6664 conditions, 775 events. 429/775 cut-off events. For 74449/74449 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3568 event pairs, 43 based on Foata normal form. 4/777 useless extension candidates. Maximal degree in co-relation 6564. Up to 633 conditions per place. [2024-06-14 14:42:40,831 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 173 selfloop transitions, 34 changer transitions 0/210 dead transitions. [2024-06-14 14:42:40,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 210 transitions, 2638 flow [2024-06-14 14:42:40,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:42:40,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:42:40,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 138 transitions. [2024-06-14 14:42:40,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41818181818181815 [2024-06-14 14:42:40,832 INFO L175 Difference]: Start difference. First operand has 204 places, 192 transitions, 2030 flow. Second operand 10 states and 138 transitions. [2024-06-14 14:42:40,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 210 transitions, 2638 flow [2024-06-14 14:42:40,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 210 transitions, 2501 flow, removed 37 selfloop flow, removed 8 redundant places. [2024-06-14 14:42:40,954 INFO L231 Difference]: Finished difference. Result has 206 places, 195 transitions, 2061 flow [2024-06-14 14:42:40,954 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1893, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2061, PETRI_PLACES=206, PETRI_TRANSITIONS=195} [2024-06-14 14:42:40,955 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 174 predicate places. [2024-06-14 14:42:40,955 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 195 transitions, 2061 flow [2024-06-14 14:42:40,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:42:40,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:42:40,955 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:42:40,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-14 14:42:40,956 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:42:40,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:42:40,956 INFO L85 PathProgramCache]: Analyzing trace with hash -526290351, now seen corresponding path program 6 times [2024-06-14 14:42:40,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:42:40,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889028335] [2024-06-14 14:42:40,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:42:40,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:42:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:42:49,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:42:49,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:42:49,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889028335] [2024-06-14 14:42:49,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889028335] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:42:49,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:42:49,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:42:49,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975392515] [2024-06-14 14:42:49,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:42:49,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:42:49,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:42:49,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:42:49,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:42:49,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:42:49,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 195 transitions, 2061 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:42:49,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:42:49,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:42:49,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:42:49,881 INFO L124 PetriNetUnfolderBase]: 452/814 cut-off events. [2024-06-14 14:42:49,881 INFO L125 PetriNetUnfolderBase]: For 79937/79937 co-relation queries the response was YES. [2024-06-14 14:42:49,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7334 conditions, 814 events. 452/814 cut-off events. For 79937/79937 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 3820 event pairs, 41 based on Foata normal form. 1/813 useless extension candidates. Maximal degree in co-relation 7233. Up to 564 conditions per place. [2024-06-14 14:42:49,888 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 157 selfloop transitions, 65 changer transitions 0/225 dead transitions. [2024-06-14 14:42:49,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 225 transitions, 3295 flow [2024-06-14 14:42:49,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:42:49,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:42:49,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 135 transitions. [2024-06-14 14:42:49,890 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2024-06-14 14:42:49,891 INFO L175 Difference]: Start difference. First operand has 206 places, 195 transitions, 2061 flow. Second operand 10 states and 135 transitions. [2024-06-14 14:42:49,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 225 transitions, 3295 flow [2024-06-14 14:42:50,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 225 transitions, 3097 flow, removed 66 selfloop flow, removed 8 redundant places. [2024-06-14 14:42:50,025 INFO L231 Difference]: Finished difference. Result has 209 places, 209 transitions, 2402 flow [2024-06-14 14:42:50,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1923, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2402, PETRI_PLACES=209, PETRI_TRANSITIONS=209} [2024-06-14 14:42:50,025 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 177 predicate places. [2024-06-14 14:42:50,026 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 209 transitions, 2402 flow [2024-06-14 14:42:50,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:42:50,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:42:50,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:42:50,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-14 14:42:50,026 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:42:50,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:42:50,026 INFO L85 PathProgramCache]: Analyzing trace with hash -526290072, now seen corresponding path program 1 times [2024-06-14 14:42:50,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:42:50,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422605194] [2024-06-14 14:42:50,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:42:50,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:42:50,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:42:59,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:42:59,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:42:59,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422605194] [2024-06-14 14:42:59,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422605194] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:42:59,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:42:59,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:42:59,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585834167] [2024-06-14 14:43:00,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:43:00,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:43:00,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:43:00,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:43:00,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:43:00,167 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:43:00,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 209 transitions, 2402 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:43:00,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:43:00,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:43:00,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:43:00,610 INFO L124 PetriNetUnfolderBase]: 455/818 cut-off events. [2024-06-14 14:43:00,610 INFO L125 PetriNetUnfolderBase]: For 82049/82049 co-relation queries the response was YES. [2024-06-14 14:43:00,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7487 conditions, 818 events. 455/818 cut-off events. For 82049/82049 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 3842 event pairs, 37 based on Foata normal form. 1/817 useless extension candidates. Maximal degree in co-relation 7384. Up to 708 conditions per place. [2024-06-14 14:43:00,618 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 189 selfloop transitions, 32 changer transitions 0/224 dead transitions. [2024-06-14 14:43:00,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 224 transitions, 2928 flow [2024-06-14 14:43:00,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:43:00,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:43:00,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-14 14:43:00,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37575757575757573 [2024-06-14 14:43:00,620 INFO L175 Difference]: Start difference. First operand has 209 places, 209 transitions, 2402 flow. Second operand 10 states and 124 transitions. [2024-06-14 14:43:00,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 224 transitions, 2928 flow [2024-06-14 14:43:00,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 224 transitions, 2830 flow, removed 41 selfloop flow, removed 3 redundant places. [2024-06-14 14:43:00,760 INFO L231 Difference]: Finished difference. Result has 216 places, 211 transitions, 2425 flow [2024-06-14 14:43:00,760 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2304, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2425, PETRI_PLACES=216, PETRI_TRANSITIONS=211} [2024-06-14 14:43:00,761 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 184 predicate places. [2024-06-14 14:43:00,761 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 211 transitions, 2425 flow [2024-06-14 14:43:00,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:43:00,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:43:00,761 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:43:00,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-14 14:43:00,761 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:43:00,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:43:00,761 INFO L85 PathProgramCache]: Analyzing trace with hash -533440191, now seen corresponding path program 7 times [2024-06-14 14:43:00,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:43:00,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101954143] [2024-06-14 14:43:00,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:43:00,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:43:00,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:43:09,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:43:09,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:43:09,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101954143] [2024-06-14 14:43:09,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101954143] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:43:09,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:43:09,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:43:09,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959382564] [2024-06-14 14:43:09,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:43:09,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:43:09,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:43:09,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:43:09,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:43:10,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:43:10,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 211 transitions, 2425 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:43:10,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:43:10,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:43:10,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:43:10,467 INFO L124 PetriNetUnfolderBase]: 466/837 cut-off events. [2024-06-14 14:43:10,467 INFO L125 PetriNetUnfolderBase]: For 88345/88345 co-relation queries the response was YES. [2024-06-14 14:43:10,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7702 conditions, 837 events. 466/837 cut-off events. For 88345/88345 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 3947 event pairs, 43 based on Foata normal form. 2/837 useless extension candidates. Maximal degree in co-relation 7597. Up to 664 conditions per place. [2024-06-14 14:43:10,507 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 183 selfloop transitions, 47 changer transitions 0/233 dead transitions. [2024-06-14 14:43:10,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 233 transitions, 3252 flow [2024-06-14 14:43:10,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:43:10,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:43:10,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-14 14:43:10,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403030303030303 [2024-06-14 14:43:10,508 INFO L175 Difference]: Start difference. First operand has 216 places, 211 transitions, 2425 flow. Second operand 10 states and 133 transitions. [2024-06-14 14:43:10,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 233 transitions, 3252 flow [2024-06-14 14:43:10,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 233 transitions, 3149 flow, removed 20 selfloop flow, removed 8 redundant places. [2024-06-14 14:43:10,652 INFO L231 Difference]: Finished difference. Result has 218 places, 216 transitions, 2578 flow [2024-06-14 14:43:10,652 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2324, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2578, PETRI_PLACES=218, PETRI_TRANSITIONS=216} [2024-06-14 14:43:10,653 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 186 predicate places. [2024-06-14 14:43:10,653 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 216 transitions, 2578 flow [2024-06-14 14:43:10,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:43:10,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:43:10,653 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:43:10,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-14 14:43:10,653 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:43:10,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:43:10,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1758801846, now seen corresponding path program 6 times [2024-06-14 14:43:10,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:43:10,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856589029] [2024-06-14 14:43:10,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:43:10,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:43:10,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:43:24,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:43:24,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:43:24,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856589029] [2024-06-14 14:43:24,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856589029] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:43:24,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:43:24,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:43:24,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463318833] [2024-06-14 14:43:24,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:43:24,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:43:24,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:43:24,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:43:24,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:43:25,100 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:43:25,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 216 transitions, 2578 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:43:25,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:43:25,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:43:25,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:43:25,509 INFO L124 PetriNetUnfolderBase]: 469/844 cut-off events. [2024-06-14 14:43:25,509 INFO L125 PetriNetUnfolderBase]: For 89492/89492 co-relation queries the response was YES. [2024-06-14 14:43:25,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7866 conditions, 844 events. 469/844 cut-off events. For 89492/89492 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4011 event pairs, 43 based on Foata normal form. 1/843 useless extension candidates. Maximal degree in co-relation 7760. Up to 698 conditions per place. [2024-06-14 14:43:25,517 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 191 selfloop transitions, 37 changer transitions 0/231 dead transitions. [2024-06-14 14:43:25,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 231 transitions, 3154 flow [2024-06-14 14:43:25,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:43:25,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:43:25,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2024-06-14 14:43:25,518 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3878787878787879 [2024-06-14 14:43:25,518 INFO L175 Difference]: Start difference. First operand has 218 places, 216 transitions, 2578 flow. Second operand 10 states and 128 transitions. [2024-06-14 14:43:25,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 231 transitions, 3154 flow [2024-06-14 14:43:25,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 231 transitions, 3026 flow, removed 41 selfloop flow, removed 6 redundant places. [2024-06-14 14:43:25,667 INFO L231 Difference]: Finished difference. Result has 222 places, 218 transitions, 2619 flow [2024-06-14 14:43:25,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2450, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2619, PETRI_PLACES=222, PETRI_TRANSITIONS=218} [2024-06-14 14:43:25,667 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 190 predicate places. [2024-06-14 14:43:25,668 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 218 transitions, 2619 flow [2024-06-14 14:43:25,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:43:25,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:43:25,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:43:25,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-14 14:43:25,668 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:43:25,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:43:25,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1758802063, now seen corresponding path program 8 times [2024-06-14 14:43:25,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:43:25,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021689171] [2024-06-14 14:43:25,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:43:25,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:43:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:43:35,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:43:35,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:43:35,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021689171] [2024-06-14 14:43:35,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021689171] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:43:35,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:43:35,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:43:35,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899521603] [2024-06-14 14:43:35,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:43:35,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:43:35,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:43:35,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:43:35,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:43:35,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:43:35,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 218 transitions, 2619 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:43:35,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:43:35,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:43:35,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:43:35,999 INFO L124 PetriNetUnfolderBase]: 467/841 cut-off events. [2024-06-14 14:43:35,999 INFO L125 PetriNetUnfolderBase]: For 89022/89022 co-relation queries the response was YES. [2024-06-14 14:43:36,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7802 conditions, 841 events. 467/841 cut-off events. For 89022/89022 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 3994 event pairs, 42 based on Foata normal form. 1/840 useless extension candidates. Maximal degree in co-relation 7694. Up to 686 conditions per place. [2024-06-14 14:43:36,007 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 191 selfloop transitions, 41 changer transitions 0/235 dead transitions. [2024-06-14 14:43:36,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 235 transitions, 3176 flow [2024-06-14 14:43:36,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:43:36,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:43:36,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2024-06-14 14:43:36,009 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2024-06-14 14:43:36,009 INFO L175 Difference]: Start difference. First operand has 222 places, 218 transitions, 2619 flow. Second operand 10 states and 130 transitions. [2024-06-14 14:43:36,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 235 transitions, 3176 flow [2024-06-14 14:43:36,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 235 transitions, 3023 flow, removed 41 selfloop flow, removed 8 redundant places. [2024-06-14 14:43:36,165 INFO L231 Difference]: Finished difference. Result has 225 places, 222 transitions, 2626 flow [2024-06-14 14:43:36,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2466, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2626, PETRI_PLACES=225, PETRI_TRANSITIONS=222} [2024-06-14 14:43:36,166 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 193 predicate places. [2024-06-14 14:43:36,166 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 222 transitions, 2626 flow [2024-06-14 14:43:36,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:43:36,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:43:36,167 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:43:36,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-14 14:43:36,167 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:43:36,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:43:36,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1466433334, now seen corresponding path program 7 times [2024-06-14 14:43:36,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:43:36,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571645122] [2024-06-14 14:43:36,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:43:36,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:43:36,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:43:47,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:43:47,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:43:47,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571645122] [2024-06-14 14:43:47,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571645122] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:43:47,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:43:47,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:43:47,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298782642] [2024-06-14 14:43:47,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:43:47,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:43:47,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:43:47,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:43:47,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:43:47,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 14:43:47,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 222 transitions, 2626 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:43:47,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:43:47,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 14:43:47,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:43:48,172 INFO L124 PetriNetUnfolderBase]: 470/848 cut-off events. [2024-06-14 14:43:48,172 INFO L125 PetriNetUnfolderBase]: For 91433/91433 co-relation queries the response was YES. [2024-06-14 14:43:48,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7894 conditions, 848 events. 470/848 cut-off events. For 91433/91433 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4050 event pairs, 42 based on Foata normal form. 1/847 useless extension candidates. Maximal degree in co-relation 7784. Up to 657 conditions per place. [2024-06-14 14:43:48,179 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 179 selfloop transitions, 54 changer transitions 0/236 dead transitions. [2024-06-14 14:43:48,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 236 transitions, 3212 flow [2024-06-14 14:43:48,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:43:48,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:43:48,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2024-06-14 14:43:48,180 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41515151515151516 [2024-06-14 14:43:48,181 INFO L175 Difference]: Start difference. First operand has 225 places, 222 transitions, 2626 flow. Second operand 10 states and 137 transitions. [2024-06-14 14:43:48,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 236 transitions, 3212 flow [2024-06-14 14:43:48,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 236 transitions, 3104 flow, removed 35 selfloop flow, removed 5 redundant places. [2024-06-14 14:43:48,330 INFO L231 Difference]: Finished difference. Result has 230 places, 224 transitions, 2725 flow [2024-06-14 14:43:48,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2518, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2725, PETRI_PLACES=230, PETRI_TRANSITIONS=224} [2024-06-14 14:43:48,331 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 198 predicate places. [2024-06-14 14:43:48,331 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 224 transitions, 2725 flow [2024-06-14 14:43:48,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:43:48,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:43:48,331 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:43:48,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-14 14:43:48,331 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:43:48,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:43:48,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1466433117, now seen corresponding path program 9 times [2024-06-14 14:43:48,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:43:48,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914083434] [2024-06-14 14:43:48,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:43:48,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:43:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:43:57,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:43:57,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:43:57,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914083434] [2024-06-14 14:43:57,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914083434] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:43:57,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:43:57,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:43:57,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653483425] [2024-06-14 14:43:57,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:43:57,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:43:57,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:43:57,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:43:57,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:43:57,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:43:57,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 224 transitions, 2725 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:43:57,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:43:57,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:43:57,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:43:58,266 INFO L124 PetriNetUnfolderBase]: 468/845 cut-off events. [2024-06-14 14:43:58,266 INFO L125 PetriNetUnfolderBase]: For 90721/90721 co-relation queries the response was YES. [2024-06-14 14:43:58,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7885 conditions, 845 events. 468/845 cut-off events. For 90721/90721 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4047 event pairs, 43 based on Foata normal form. 1/844 useless extension candidates. Maximal degree in co-relation 7773. Up to 617 conditions per place. [2024-06-14 14:43:58,274 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 167 selfloop transitions, 68 changer transitions 0/238 dead transitions. [2024-06-14 14:43:58,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 238 transitions, 3388 flow [2024-06-14 14:43:58,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:43:58,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:43:58,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 131 transitions. [2024-06-14 14:43:58,275 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.396969696969697 [2024-06-14 14:43:58,275 INFO L175 Difference]: Start difference. First operand has 230 places, 224 transitions, 2725 flow. Second operand 10 states and 131 transitions. [2024-06-14 14:43:58,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 238 transitions, 3388 flow [2024-06-14 14:43:58,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 238 transitions, 3151 flow, removed 66 selfloop flow, removed 8 redundant places. [2024-06-14 14:43:58,420 INFO L231 Difference]: Finished difference. Result has 233 places, 225 transitions, 2684 flow [2024-06-14 14:43:58,420 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2488, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2684, PETRI_PLACES=233, PETRI_TRANSITIONS=225} [2024-06-14 14:43:58,420 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 201 predicate places. [2024-06-14 14:43:58,420 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 225 transitions, 2684 flow [2024-06-14 14:43:58,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:43:58,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:43:58,420 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:43:58,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-14 14:43:58,421 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:43:58,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:43:58,421 INFO L85 PathProgramCache]: Analyzing trace with hash -526030602, now seen corresponding path program 2 times [2024-06-14 14:43:58,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:43:58,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291474372] [2024-06-14 14:43:58,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:43:58,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:43:58,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:44:08,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:44:08,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:44:08,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291474372] [2024-06-14 14:44:08,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291474372] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:44:08,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:44:08,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:44:08,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970514390] [2024-06-14 14:44:08,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:44:08,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:44:08,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:44:08,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:44:08,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:44:08,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:44:08,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 225 transitions, 2684 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:44:08,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:44:08,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:44:08,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:44:09,409 INFO L124 PetriNetUnfolderBase]: 471/847 cut-off events. [2024-06-14 14:44:09,409 INFO L125 PetriNetUnfolderBase]: For 93006/93006 co-relation queries the response was YES. [2024-06-14 14:44:09,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7949 conditions, 847 events. 471/847 cut-off events. For 93006/93006 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4021 event pairs, 37 based on Foata normal form. 1/846 useless extension candidates. Maximal degree in co-relation 7835. Up to 735 conditions per place. [2024-06-14 14:44:09,418 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 202 selfloop transitions, 35 changer transitions 0/240 dead transitions. [2024-06-14 14:44:09,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 240 transitions, 3246 flow [2024-06-14 14:44:09,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:44:09,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:44:09,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-14 14:44:09,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37272727272727274 [2024-06-14 14:44:09,421 INFO L175 Difference]: Start difference. First operand has 233 places, 225 transitions, 2684 flow. Second operand 10 states and 123 transitions. [2024-06-14 14:44:09,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 240 transitions, 3246 flow [2024-06-14 14:44:09,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 240 transitions, 3144 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-14 14:44:09,580 INFO L231 Difference]: Finished difference. Result has 236 places, 227 transitions, 2713 flow [2024-06-14 14:44:09,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2582, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2713, PETRI_PLACES=236, PETRI_TRANSITIONS=227} [2024-06-14 14:44:09,580 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 204 predicate places. [2024-06-14 14:44:09,580 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 227 transitions, 2713 flow [2024-06-14 14:44:09,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:44:09,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:44:09,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:44:09,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-14 14:44:09,581 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:44:09,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:44:09,581 INFO L85 PathProgramCache]: Analyzing trace with hash -526030881, now seen corresponding path program 10 times [2024-06-14 14:44:09,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:44:09,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171358669] [2024-06-14 14:44:09,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:44:09,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:44:09,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:44:18,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:44:18,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:44:18,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171358669] [2024-06-14 14:44:18,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171358669] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:44:18,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:44:18,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:44:18,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317916333] [2024-06-14 14:44:18,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:44:18,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:44:18,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:44:18,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:44:18,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:44:18,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:44:18,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 227 transitions, 2713 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:44:18,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:44:18,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:44:18,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:44:19,383 INFO L124 PetriNetUnfolderBase]: 469/845 cut-off events. [2024-06-14 14:44:19,383 INFO L125 PetriNetUnfolderBase]: For 91792/91792 co-relation queries the response was YES. [2024-06-14 14:44:19,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7828 conditions, 845 events. 469/845 cut-off events. For 91792/91792 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4028 event pairs, 43 based on Foata normal form. 1/844 useless extension candidates. Maximal degree in co-relation 7713. Up to 620 conditions per place. [2024-06-14 14:44:19,392 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 162 selfloop transitions, 74 changer transitions 0/239 dead transitions. [2024-06-14 14:44:19,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 239 transitions, 3215 flow [2024-06-14 14:44:19,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:44:19,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:44:19,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2024-06-14 14:44:19,393 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2024-06-14 14:44:19,393 INFO L175 Difference]: Start difference. First operand has 236 places, 227 transitions, 2713 flow. Second operand 10 states and 130 transitions. [2024-06-14 14:44:19,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 239 transitions, 3215 flow [2024-06-14 14:44:19,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 239 transitions, 3072 flow, removed 38 selfloop flow, removed 8 redundant places. [2024-06-14 14:44:19,608 INFO L231 Difference]: Finished difference. Result has 238 places, 227 transitions, 2723 flow [2024-06-14 14:44:19,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2570, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2723, PETRI_PLACES=238, PETRI_TRANSITIONS=227} [2024-06-14 14:44:19,609 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 206 predicate places. [2024-06-14 14:44:19,609 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 227 transitions, 2723 flow [2024-06-14 14:44:19,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:44:19,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:44:19,610 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:44:19,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-14 14:44:19,610 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:44:19,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:44:19,611 INFO L85 PathProgramCache]: Analyzing trace with hash -526021302, now seen corresponding path program 3 times [2024-06-14 14:44:19,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:44:19,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360447087] [2024-06-14 14:44:19,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:44:19,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:44:19,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:44:29,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:44:29,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:44:29,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360447087] [2024-06-14 14:44:29,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360447087] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:44:29,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:44:29,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:44:29,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753635794] [2024-06-14 14:44:29,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:44:29,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:44:29,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:44:29,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:44:29,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:44:29,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:44:29,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 227 transitions, 2723 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:44:29,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:44:29,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:44:29,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:44:30,262 INFO L124 PetriNetUnfolderBase]: 467/843 cut-off events. [2024-06-14 14:44:30,262 INFO L125 PetriNetUnfolderBase]: For 90933/90933 co-relation queries the response was YES. [2024-06-14 14:44:30,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7782 conditions, 843 events. 467/843 cut-off events. For 90933/90933 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4018 event pairs, 37 based on Foata normal form. 1/842 useless extension candidates. Maximal degree in co-relation 7666. Up to 714 conditions per place. [2024-06-14 14:44:30,271 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 193 selfloop transitions, 44 changer transitions 0/240 dead transitions. [2024-06-14 14:44:30,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 240 transitions, 3233 flow [2024-06-14 14:44:30,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:44:30,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:44:30,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-14 14:44:30,272 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37575757575757573 [2024-06-14 14:44:30,272 INFO L175 Difference]: Start difference. First operand has 238 places, 227 transitions, 2723 flow. Second operand 10 states and 124 transitions. [2024-06-14 14:44:30,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 240 transitions, 3233 flow [2024-06-14 14:44:30,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 240 transitions, 3096 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-06-14 14:44:30,454 INFO L231 Difference]: Finished difference. Result has 239 places, 227 transitions, 2679 flow [2024-06-14 14:44:30,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2586, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2679, PETRI_PLACES=239, PETRI_TRANSITIONS=227} [2024-06-14 14:44:30,455 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 207 predicate places. [2024-06-14 14:44:30,455 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 227 transitions, 2679 flow [2024-06-14 14:44:30,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:44:30,455 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:44:30,455 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:44:30,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-14 14:44:30,456 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:44:30,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:44:30,456 INFO L85 PathProgramCache]: Analyzing trace with hash -526020961, now seen corresponding path program 1 times [2024-06-14 14:44:30,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:44:30,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104239248] [2024-06-14 14:44:30,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:44:30,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:44:30,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:44:39,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:44:39,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:44:39,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104239248] [2024-06-14 14:44:39,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104239248] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:44:39,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:44:39,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:44:39,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120429173] [2024-06-14 14:44:39,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:44:39,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:44:39,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:44:39,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:44:39,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:44:40,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-14 14:44:40,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 227 transitions, 2679 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:44:40,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:44:40,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-14 14:44:40,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:44:40,619 INFO L124 PetriNetUnfolderBase]: 445/820 cut-off events. [2024-06-14 14:44:40,619 INFO L125 PetriNetUnfolderBase]: For 97387/97388 co-relation queries the response was YES. [2024-06-14 14:44:40,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7611 conditions, 820 events. 445/820 cut-off events. For 97387/97388 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 3995 event pairs, 35 based on Foata normal form. 3/821 useless extension candidates. Maximal degree in co-relation 7494. Up to 676 conditions per place. [2024-06-14 14:44:40,629 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 189 selfloop transitions, 17 changer transitions 0/242 dead transitions. [2024-06-14 14:44:40,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 242 transitions, 3153 flow [2024-06-14 14:44:40,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:44:40,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:44:40,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 138 transitions. [2024-06-14 14:44:40,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41818181818181815 [2024-06-14 14:44:40,631 INFO L175 Difference]: Start difference. First operand has 239 places, 227 transitions, 2679 flow. Second operand 10 states and 138 transitions. [2024-06-14 14:44:40,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 242 transitions, 3153 flow [2024-06-14 14:44:40,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 242 transitions, 2951 flow, removed 23 selfloop flow, removed 11 redundant places. [2024-06-14 14:44:40,846 INFO L231 Difference]: Finished difference. Result has 238 places, 228 transitions, 2541 flow [2024-06-14 14:44:40,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2477, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2541, PETRI_PLACES=238, PETRI_TRANSITIONS=228} [2024-06-14 14:44:40,847 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 206 predicate places. [2024-06-14 14:44:40,847 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 228 transitions, 2541 flow [2024-06-14 14:44:40,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:44:40,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:44:40,848 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:44:40,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-14 14:44:40,848 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:44:40,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:44:40,848 INFO L85 PathProgramCache]: Analyzing trace with hash 474796629, now seen corresponding path program 2 times [2024-06-14 14:44:40,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:44:40,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048383920] [2024-06-14 14:44:40,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:44:40,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:44:40,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:44:51,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:44:51,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:44:51,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048383920] [2024-06-14 14:44:51,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048383920] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:44:51,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:44:51,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:44:51,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243757455] [2024-06-14 14:44:51,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:44:51,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:44:51,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:44:51,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:44:51,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:44:51,802 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 14:44:51,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 228 transitions, 2541 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:44:51,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:44:51,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 14:44:51,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:44:52,298 INFO L124 PetriNetUnfolderBase]: 449/827 cut-off events. [2024-06-14 14:44:52,298 INFO L125 PetriNetUnfolderBase]: For 99832/99835 co-relation queries the response was YES. [2024-06-14 14:44:52,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7524 conditions, 827 events. 449/827 cut-off events. For 99832/99835 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4050 event pairs, 39 based on Foata normal form. 3/826 useless extension candidates. Maximal degree in co-relation 7409. Up to 688 conditions per place. [2024-06-14 14:44:52,306 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 186 selfloop transitions, 18 changer transitions 0/240 dead transitions. [2024-06-14 14:44:52,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 240 transitions, 3001 flow [2024-06-14 14:44:52,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:44:52,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:44:52,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-14 14:44:52,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38484848484848483 [2024-06-14 14:44:52,307 INFO L175 Difference]: Start difference. First operand has 238 places, 228 transitions, 2541 flow. Second operand 10 states and 127 transitions. [2024-06-14 14:44:52,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 240 transitions, 3001 flow [2024-06-14 14:44:52,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 240 transitions, 2937 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-14 14:44:52,493 INFO L231 Difference]: Finished difference. Result has 240 places, 229 transitions, 2545 flow [2024-06-14 14:44:52,493 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2477, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2545, PETRI_PLACES=240, PETRI_TRANSITIONS=229} [2024-06-14 14:44:52,493 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 208 predicate places. [2024-06-14 14:44:52,493 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 229 transitions, 2545 flow [2024-06-14 14:44:52,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:44:52,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:44:52,494 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:44:52,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-14 14:44:52,494 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:44:52,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:44:52,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1326882317, now seen corresponding path program 11 times [2024-06-14 14:44:52,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:44:52,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709115425] [2024-06-14 14:44:52,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:44:52,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:44:52,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:45:01,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:45:01,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:45:01,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709115425] [2024-06-14 14:45:01,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709115425] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:45:01,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:45:01,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:45:01,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47647923] [2024-06-14 14:45:01,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:45:01,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:45:01,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:45:01,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:45:01,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:45:02,109 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:45:02,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 229 transitions, 2545 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:45:02,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:45:02,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:45:02,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:45:02,563 INFO L124 PetriNetUnfolderBase]: 501/900 cut-off events. [2024-06-14 14:45:02,564 INFO L125 PetriNetUnfolderBase]: For 115035/115038 co-relation queries the response was YES. [2024-06-14 14:45:02,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8549 conditions, 900 events. 501/900 cut-off events. For 115035/115038 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4354 event pairs, 53 based on Foata normal form. 2/897 useless extension candidates. Maximal degree in co-relation 8433. Up to 672 conditions per place. [2024-06-14 14:45:02,574 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 192 selfloop transitions, 54 changer transitions 0/249 dead transitions. [2024-06-14 14:45:02,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 249 transitions, 3460 flow [2024-06-14 14:45:02,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:45:02,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:45:02,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 136 transitions. [2024-06-14 14:45:02,575 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121212121212121 [2024-06-14 14:45:02,575 INFO L175 Difference]: Start difference. First operand has 240 places, 229 transitions, 2545 flow. Second operand 10 states and 136 transitions. [2024-06-14 14:45:02,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 249 transitions, 3460 flow [2024-06-14 14:45:02,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 249 transitions, 3402 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-14 14:45:02,839 INFO L231 Difference]: Finished difference. Result has 243 places, 234 transitions, 2789 flow [2024-06-14 14:45:02,839 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2487, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2789, PETRI_PLACES=243, PETRI_TRANSITIONS=234} [2024-06-14 14:45:02,840 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 211 predicate places. [2024-06-14 14:45:02,840 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 234 transitions, 2789 flow [2024-06-14 14:45:02,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:45:02,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:45:02,840 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:45:02,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-14 14:45:02,840 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:45:02,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:45:02,842 INFO L85 PathProgramCache]: Analyzing trace with hash 217697951, now seen corresponding path program 3 times [2024-06-14 14:45:02,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:45:02,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940248970] [2024-06-14 14:45:02,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:45:02,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:45:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:45:12,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:45:12,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:45:12,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940248970] [2024-06-14 14:45:12,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940248970] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:45:12,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:45:12,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:45:12,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190641087] [2024-06-14 14:45:12,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:45:12,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:45:12,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:45:12,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:45:12,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:45:12,387 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-14 14:45:12,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 234 transitions, 2789 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:45:12,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:45:12,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-14 14:45:12,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:45:12,760 INFO L124 PetriNetUnfolderBase]: 478/878 cut-off events. [2024-06-14 14:45:12,760 INFO L125 PetriNetUnfolderBase]: For 120342/120346 co-relation queries the response was YES. [2024-06-14 14:45:12,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8606 conditions, 878 events. 478/878 cut-off events. For 120342/120346 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 4353 event pairs, 42 based on Foata normal form. 5/879 useless extension candidates. Maximal degree in co-relation 8488. Up to 727 conditions per place. [2024-06-14 14:45:12,771 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 191 selfloop transitions, 20 changer transitions 0/247 dead transitions. [2024-06-14 14:45:12,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 247 transitions, 3271 flow [2024-06-14 14:45:12,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:45:12,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:45:12,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2024-06-14 14:45:12,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41515151515151516 [2024-06-14 14:45:12,773 INFO L175 Difference]: Start difference. First operand has 243 places, 234 transitions, 2789 flow. Second operand 10 states and 137 transitions. [2024-06-14 14:45:12,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 247 transitions, 3271 flow [2024-06-14 14:45:12,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 247 transitions, 3147 flow, removed 32 selfloop flow, removed 6 redundant places. [2024-06-14 14:45:12,998 INFO L231 Difference]: Finished difference. Result has 247 places, 235 transitions, 2739 flow [2024-06-14 14:45:12,998 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2665, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2739, PETRI_PLACES=247, PETRI_TRANSITIONS=235} [2024-06-14 14:45:12,999 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 215 predicate places. [2024-06-14 14:45:12,999 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 235 transitions, 2739 flow [2024-06-14 14:45:12,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:45:12,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:45:12,999 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:45:12,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-14 14:45:12,999 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:45:13,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:45:13,000 INFO L85 PathProgramCache]: Analyzing trace with hash 790986399, now seen corresponding path program 4 times [2024-06-14 14:45:13,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:45:13,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148774549] [2024-06-14 14:45:13,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:45:13,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:45:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:45:22,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:45:22,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:45:22,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148774549] [2024-06-14 14:45:22,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148774549] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:45:22,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:45:22,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:45:22,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569857766] [2024-06-14 14:45:22,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:45:22,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:45:22,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:45:22,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:45:22,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:45:22,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-14 14:45:22,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 235 transitions, 2739 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:45:22,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:45:22,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-14 14:45:22,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:45:23,350 INFO L124 PetriNetUnfolderBase]: 486/894 cut-off events. [2024-06-14 14:45:23,350 INFO L125 PetriNetUnfolderBase]: For 129311/129314 co-relation queries the response was YES. [2024-06-14 14:45:23,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8866 conditions, 894 events. 486/894 cut-off events. For 129311/129314 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 4472 event pairs, 41 based on Foata normal form. 3/893 useless extension candidates. Maximal degree in co-relation 8746. Up to 732 conditions per place. [2024-06-14 14:45:23,360 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 194 selfloop transitions, 21 changer transitions 0/251 dead transitions. [2024-06-14 14:45:23,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 251 transitions, 3421 flow [2024-06-14 14:45:23,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:45:23,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:45:23,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 149 transitions. [2024-06-14 14:45:23,361 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41046831955922863 [2024-06-14 14:45:23,361 INFO L175 Difference]: Start difference. First operand has 247 places, 235 transitions, 2739 flow. Second operand 11 states and 149 transitions. [2024-06-14 14:45:23,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 251 transitions, 3421 flow [2024-06-14 14:45:23,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 251 transitions, 3357 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-14 14:45:23,606 INFO L231 Difference]: Finished difference. Result has 250 places, 237 transitions, 2783 flow [2024-06-14 14:45:23,606 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2675, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2783, PETRI_PLACES=250, PETRI_TRANSITIONS=237} [2024-06-14 14:45:23,606 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 218 predicate places. [2024-06-14 14:45:23,606 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 237 transitions, 2783 flow [2024-06-14 14:45:23,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:45:23,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:45:23,607 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:45:23,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-14 14:45:23,607 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:45:23,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:45:23,608 INFO L85 PathProgramCache]: Analyzing trace with hash -271981827, now seen corresponding path program 5 times [2024-06-14 14:45:23,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:45:23,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272350987] [2024-06-14 14:45:23,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:45:23,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:45:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:45:33,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:45:33,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:45:33,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272350987] [2024-06-14 14:45:33,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272350987] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:45:33,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:45:33,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:45:33,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596602218] [2024-06-14 14:45:33,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:45:33,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:45:33,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:45:33,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:45:33,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:45:34,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-14 14:45:34,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 237 transitions, 2783 flow. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:45:34,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:45:34,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-14 14:45:34,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:45:34,470 INFO L124 PetriNetUnfolderBase]: 484/890 cut-off events. [2024-06-14 14:45:34,470 INFO L125 PetriNetUnfolderBase]: For 125560/125563 co-relation queries the response was YES. [2024-06-14 14:45:34,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8672 conditions, 890 events. 484/890 cut-off events. For 125560/125563 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 4451 event pairs, 42 based on Foata normal form. 3/889 useless extension candidates. Maximal degree in co-relation 8551. Up to 745 conditions per place. [2024-06-14 14:45:34,480 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 193 selfloop transitions, 18 changer transitions 0/247 dead transitions. [2024-06-14 14:45:34,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 247 transitions, 3229 flow [2024-06-14 14:45:34,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:45:34,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:45:34,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 125 transitions. [2024-06-14 14:45:34,481 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4208754208754209 [2024-06-14 14:45:34,481 INFO L175 Difference]: Start difference. First operand has 250 places, 237 transitions, 2783 flow. Second operand 9 states and 125 transitions. [2024-06-14 14:45:34,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 247 transitions, 3229 flow [2024-06-14 14:45:34,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 247 transitions, 3151 flow, removed 27 selfloop flow, removed 7 redundant places. [2024-06-14 14:45:34,718 INFO L231 Difference]: Finished difference. Result has 252 places, 237 transitions, 2747 flow [2024-06-14 14:45:34,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2705, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2747, PETRI_PLACES=252, PETRI_TRANSITIONS=237} [2024-06-14 14:45:34,719 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 220 predicate places. [2024-06-14 14:45:34,719 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 237 transitions, 2747 flow [2024-06-14 14:45:34,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:45:34,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:45:34,719 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:45:34,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-14 14:45:34,719 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:45:34,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:45:34,720 INFO L85 PathProgramCache]: Analyzing trace with hash -845153715, now seen corresponding path program 12 times [2024-06-14 14:45:34,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:45:34,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757849570] [2024-06-14 14:45:34,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:45:34,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:45:34,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:45:44,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:45:44,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:45:44,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757849570] [2024-06-14 14:45:44,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757849570] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:45:44,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:45:44,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:45:44,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866177727] [2024-06-14 14:45:44,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:45:44,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:45:44,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:45:44,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:45:44,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:45:44,339 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:45:44,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 237 transitions, 2747 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:45:44,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:45:44,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:45:44,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:45:44,762 INFO L124 PetriNetUnfolderBase]: 521/937 cut-off events. [2024-06-14 14:45:44,763 INFO L125 PetriNetUnfolderBase]: For 126522/126525 co-relation queries the response was YES. [2024-06-14 14:45:44,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9065 conditions, 937 events. 521/937 cut-off events. For 126522/126525 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 4600 event pairs, 53 based on Foata normal form. 1/933 useless extension candidates. Maximal degree in co-relation 8942. Up to 739 conditions per place. [2024-06-14 14:45:44,773 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 205 selfloop transitions, 53 changer transitions 0/261 dead transitions. [2024-06-14 14:45:44,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 261 transitions, 3902 flow [2024-06-14 14:45:44,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:45:44,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:45:44,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 135 transitions. [2024-06-14 14:45:44,774 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2024-06-14 14:45:44,774 INFO L175 Difference]: Start difference. First operand has 252 places, 237 transitions, 2747 flow. Second operand 10 states and 135 transitions. [2024-06-14 14:45:44,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 261 transitions, 3902 flow [2024-06-14 14:45:45,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 261 transitions, 3864 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-14 14:45:45,046 INFO L231 Difference]: Finished difference. Result has 256 places, 248 transitions, 3090 flow [2024-06-14 14:45:45,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2709, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3090, PETRI_PLACES=256, PETRI_TRANSITIONS=248} [2024-06-14 14:45:45,046 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 224 predicate places. [2024-06-14 14:45:45,046 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 248 transitions, 3090 flow [2024-06-14 14:45:45,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:45:45,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:45:45,047 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:45:45,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-14 14:45:45,047 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:45:45,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:45:45,047 INFO L85 PathProgramCache]: Analyzing trace with hash 217421121, now seen corresponding path program 13 times [2024-06-14 14:45:45,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:45:45,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403692226] [2024-06-14 14:45:45,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:45:45,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:45:45,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:45:54,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:45:54,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:45:54,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403692226] [2024-06-14 14:45:54,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403692226] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:45:54,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:45:54,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:45:54,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338245094] [2024-06-14 14:45:54,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:45:54,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:45:54,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:45:54,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:45:54,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:45:54,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 14:45:54,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 248 transitions, 3090 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:45:54,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:45:54,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 14:45:54,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:45:55,371 INFO L124 PetriNetUnfolderBase]: 527/947 cut-off events. [2024-06-14 14:45:55,371 INFO L125 PetriNetUnfolderBase]: For 133351/133354 co-relation queries the response was YES. [2024-06-14 14:45:55,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9383 conditions, 947 events. 527/947 cut-off events. For 133351/133354 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 4653 event pairs, 55 based on Foata normal form. 2/944 useless extension candidates. Maximal degree in co-relation 9257. Up to 710 conditions per place. [2024-06-14 14:45:55,381 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 200 selfloop transitions, 62 changer transitions 0/265 dead transitions. [2024-06-14 14:45:55,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 265 transitions, 4132 flow [2024-06-14 14:45:55,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:45:55,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:45:55,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 138 transitions. [2024-06-14 14:45:55,383 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41818181818181815 [2024-06-14 14:45:55,383 INFO L175 Difference]: Start difference. First operand has 256 places, 248 transitions, 3090 flow. Second operand 10 states and 138 transitions. [2024-06-14 14:45:55,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 265 transitions, 4132 flow [2024-06-14 14:45:55,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 265 transitions, 3978 flow, removed 56 selfloop flow, removed 4 redundant places. [2024-06-14 14:45:55,691 INFO L231 Difference]: Finished difference. Result has 262 places, 252 transitions, 3182 flow [2024-06-14 14:45:55,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2936, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3182, PETRI_PLACES=262, PETRI_TRANSITIONS=252} [2024-06-14 14:45:55,691 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 230 predicate places. [2024-06-14 14:45:55,691 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 252 transitions, 3182 flow [2024-06-14 14:45:55,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:45:55,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:45:55,692 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:45:55,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-14 14:45:55,692 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:45:55,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:45:55,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1585170287, now seen corresponding path program 14 times [2024-06-14 14:45:55,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:45:55,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076597532] [2024-06-14 14:45:55,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:45:55,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:45:55,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15