./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.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/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.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/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.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 16:09:19,698 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 16:09:19,751 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 16:09:19,758 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 16:09:19,758 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 16:09:19,786 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 16:09:19,787 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 16:09:19,787 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 16:09:19,787 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 16:09:19,788 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 16:09:19,788 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 16:09:19,788 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 16:09:19,789 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 16:09:19,789 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 16:09:19,789 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 16:09:19,789 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 16:09:19,790 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 16:09:19,790 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 16:09:19,790 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 16:09:19,790 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 16:09:19,791 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 16:09:19,795 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 16:09:19,795 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 16:09:19,795 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 16:09:19,796 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 16:09:19,796 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 16:09:19,797 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 16:09:19,797 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 16:09:19,797 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 16:09:19,797 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 16:09:19,797 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 16:09:19,798 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 16:09:19,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 16:09:19,798 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 16:09:19,798 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 16:09:19,798 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 16:09:19,798 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 16:09:19,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 16:09:19,799 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 16:09:19,799 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 16:09:19,799 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 16:09:19,802 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 16:09:19,802 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 16:09:19,802 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 16:09:20,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 16:09:20,026 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 16:09:20,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 16:09:20,029 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 16:09:20,030 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 16:09:20,031 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-14 16:09:21,190 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 16:09:21,416 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 16:09:21,416 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-14 16:09:21,430 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ab6a8bf2/52be59079bb2400dae0fde9318ba6ee0/FLAG807866197 [2024-06-14 16:09:21,444 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ab6a8bf2/52be59079bb2400dae0fde9318ba6ee0 [2024-06-14 16:09:21,447 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 16:09:21,447 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 16:09:21,448 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/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml [2024-06-14 16:09:21,595 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 16:09:21,596 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 16:09:21,597 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 16:09:21,597 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 16:09:21,601 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 16:09:21,601 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 04:09:21" (1/2) ... [2024-06-14 16:09:21,602 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32687da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 04:09:21, skipping insertion in model container [2024-06-14 16:09:21,602 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 04:09:21" (1/2) ... [2024-06-14 16:09:21,604 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6bf74f49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 04:09:21, skipping insertion in model container [2024-06-14 16:09:21,604 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 04:09:21" (2/2) ... [2024-06-14 16:09:21,605 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32687da1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:09:21, skipping insertion in model container [2024-06-14 16:09:21,605 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 04:09:21" (2/2) ... [2024-06-14 16:09:21,605 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 16:09:21,654 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 16:09:21,655 INFO L97 edCorrectnessWitness]: Location invariant before [L807-L807] ((((((((((((((! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 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 )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p0_EAX) - (long long )y >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (2LL + (long long )x) - (long long )y >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (3LL - (long long )weak$$choice0) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p0_EAX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 2) && y <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0) [2024-06-14 16:09:21,656 INFO L97 edCorrectnessWitness]: Location invariant before [L806-L806] ((((((((((((((! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 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 )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p0_EAX) - (long long )y >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (2LL + (long long )x) - (long long )y >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (3LL - (long long )weak$$choice0) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p0_EAX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 2) && y <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0) [2024-06-14 16:09:21,656 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 16:09:21,657 INFO L106 edCorrectnessWitness]: ghost_update [L804-L804] multithreaded = 1; [2024-06-14 16:09:21,691 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 16:09:21,980 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 16:09:21,987 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-14 16:09:22,246 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 16:09:22,277 INFO L206 MainTranslator]: Completed translation [2024-06-14 16:09:22,278 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:09:22 WrapperNode [2024-06-14 16:09:22,278 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 16:09:22,279 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 16:09:22,279 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 16:09:22,279 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 16:09:22,288 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 04:09:22" (1/1) ... [2024-06-14 16:09:22,319 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 04:09:22" (1/1) ... [2024-06-14 16:09:22,397 INFO L138 Inliner]: procedures = 174, calls = 36, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 112 [2024-06-14 16:09:22,397 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 16:09:22,398 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 16:09:22,398 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 16:09:22,399 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 16:09:22,407 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 04:09:22" (1/1) ... [2024-06-14 16:09:22,408 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 04:09:22" (1/1) ... [2024-06-14 16:09:22,431 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 04:09:22" (1/1) ... [2024-06-14 16:09:22,467 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 16:09:22,468 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 04:09:22" (1/1) ... [2024-06-14 16:09:22,468 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 04:09:22" (1/1) ... [2024-06-14 16:09:22,490 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 04:09:22" (1/1) ... [2024-06-14 16:09:22,492 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 04:09:22" (1/1) ... [2024-06-14 16:09:22,501 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 04:09:22" (1/1) ... [2024-06-14 16:09:22,503 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 04:09:22" (1/1) ... [2024-06-14 16:09:22,512 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 16:09:22,514 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 16:09:22,514 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 16:09:22,514 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 16:09:22,515 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 04:09:22" (1/1) ... [2024-06-14 16:09:22,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 16:09:22,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 16:09:22,539 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 16:09:22,554 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 16:09:22,568 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-14 16:09:22,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 16:09:22,569 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-14 16:09:22,569 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-14 16:09:22,569 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-14 16:09:22,569 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-14 16:09:22,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 16:09:22,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-14 16:09:22,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 16:09:22,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 16:09:22,571 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 16:09:22,662 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 16:09:22,664 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 16:09:23,324 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 16:09:23,324 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 16:09:23,460 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 16:09:23,463 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-14 16:09:23,465 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 04:09:23 BoogieIcfgContainer [2024-06-14 16:09:23,465 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 16:09:23,467 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 16:09:23,467 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 16:09:23,470 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 16:09:23,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 04:09:21" (1/4) ... [2024-06-14 16:09:23,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3964a696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 04:09:23, skipping insertion in model container [2024-06-14 16:09:23,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 04:09:21" (2/4) ... [2024-06-14 16:09:23,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3964a696 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 04:09:23, skipping insertion in model container [2024-06-14 16:09:23,472 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 04:09:22" (3/4) ... [2024-06-14 16:09:23,476 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3964a696 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 04:09:23, skipping insertion in model container [2024-06-14 16:09:23,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 04:09:23" (4/4) ... [2024-06-14 16:09:23,477 INFO L112 eAbstractionObserver]: Analyzing ICFG safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-14 16:09:23,490 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 16:09:23,490 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-14 16:09:23,491 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 16:09:23,558 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-14 16:09:23,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 31 transitions, 70 flow [2024-06-14 16:09:23,626 INFO L124 PetriNetUnfolderBase]: 0/29 cut-off events. [2024-06-14 16:09:23,630 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 16:09:23,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 29 events. 0/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-14 16:09:23,632 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 31 transitions, 70 flow [2024-06-14 16:09:23,635 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 23 transitions, 52 flow [2024-06-14 16:09:23,647 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 16:09:23,654 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;@551ac025, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 16:09:23,654 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-14 16:09:23,660 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 16:09:23,660 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-14 16:09:23,660 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 16:09:23,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:09:23,661 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-14 16:09:23,661 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 16:09:23,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:09:23,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1303796410, now seen corresponding path program 1 times [2024-06-14 16:09:23,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:09:23,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989856794] [2024-06-14 16:09:23,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:09:23,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:09:24,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:09:26,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:09:26,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:09:26,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989856794] [2024-06-14 16:09:26,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989856794] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:09:26,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:09:26,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 16:09:26,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893736302] [2024-06-14 16:09:26,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:09:26,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 16:09:26,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:09:26,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 16:09:26,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 16:09:26,626 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2024-06-14 16:09:26,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states 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 16:09:26,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:09:26,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2024-06-14 16:09:26,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:09:26,797 INFO L124 PetriNetUnfolderBase]: 131/254 cut-off events. [2024-06-14 16:09:26,797 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-14 16:09:26,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 254 events. 131/254 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 963 event pairs, 75 based on Foata normal form. 1/249 useless extension candidates. Maximal degree in co-relation 498. Up to 235 conditions per place. [2024-06-14 16:09:26,801 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 22 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2024-06-14 16:09:26,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 117 flow [2024-06-14 16:09:26,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 16:09:26,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 16:09:26,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2024-06-14 16:09:26,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5806451612903226 [2024-06-14 16:09:26,811 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 52 flow. Second operand 3 states and 54 transitions. [2024-06-14 16:09:26,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 117 flow [2024-06-14 16:09:26,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-14 16:09:26,815 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 71 flow [2024-06-14 16:09:26,816 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2024-06-14 16:09:26,818 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2024-06-14 16:09:26,818 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 71 flow [2024-06-14 16:09:26,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states 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 16:09:26,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:09:26,819 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:09:26,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 16:09:26,819 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 16:09:26,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:09:26,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1182063719, now seen corresponding path program 1 times [2024-06-14 16:09:26,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:09:26,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97545754] [2024-06-14 16:09:26,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:09:26,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:09:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:09:28,665 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 16:09:28,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:09:28,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97545754] [2024-06-14 16:09:28,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97545754] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:09:28,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:09:28,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 16:09:28,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020149038] [2024-06-14 16:09:28,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:09:28,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 16:09:28,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:09:28,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 16:09:28,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-14 16:09:28,716 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2024-06-14 16:09:28,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 71 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 16:09:28,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:09:28,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2024-06-14 16:09:28,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:09:28,863 INFO L124 PetriNetUnfolderBase]: 128/249 cut-off events. [2024-06-14 16:09:28,863 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2024-06-14 16:09:28,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 574 conditions, 249 events. 128/249 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 927 event pairs, 57 based on Foata normal form. 2/250 useless extension candidates. Maximal degree in co-relation 559. Up to 221 conditions per place. [2024-06-14 16:09:28,865 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 26 selfloop transitions, 5 changer transitions 0/35 dead transitions. [2024-06-14 16:09:28,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 159 flow [2024-06-14 16:09:28,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 16:09:28,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 16:09:28,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2024-06-14 16:09:28,867 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5564516129032258 [2024-06-14 16:09:28,867 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 71 flow. Second operand 4 states and 69 transitions. [2024-06-14 16:09:28,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 159 flow [2024-06-14 16:09:28,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 35 transitions, 156 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 16:09:28,869 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 95 flow [2024-06-14 16:09:28,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=95, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2024-06-14 16:09:28,870 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 4 predicate places. [2024-06-14 16:09:28,870 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 95 flow [2024-06-14 16:09:28,870 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 16:09:28,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:09:28,870 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:09:28,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-14 16:09:28,871 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 16:09:28,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:09:28,871 INFO L85 PathProgramCache]: Analyzing trace with hash -2091829128, now seen corresponding path program 1 times [2024-06-14 16:09:28,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:09:28,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749194860] [2024-06-14 16:09:28,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:09:28,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:09:28,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:09:31,503 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 16:09:31,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:09:31,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749194860] [2024-06-14 16:09:31,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749194860] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:09:31,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:09:31,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 16:09:31,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272680895] [2024-06-14 16:09:31,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:09:31,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 16:09:31,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:09:31,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 16:09:31,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-14 16:09:31,586 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2024-06-14 16:09:31,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 95 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 16:09:31,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:09:31,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2024-06-14 16:09:31,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:09:31,774 INFO L124 PetriNetUnfolderBase]: 125/244 cut-off events. [2024-06-14 16:09:31,774 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2024-06-14 16:09:31,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 629 conditions, 244 events. 125/244 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 891 event pairs, 39 based on Foata normal form. 2/245 useless extension candidates. Maximal degree in co-relation 612. Up to 207 conditions per place. [2024-06-14 16:09:31,777 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 30 selfloop transitions, 7 changer transitions 0/41 dead transitions. [2024-06-14 16:09:31,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 41 transitions, 207 flow [2024-06-14 16:09:31,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 16:09:31,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 16:09:31,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2024-06-14 16:09:31,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5419354838709678 [2024-06-14 16:09:31,782 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 95 flow. Second operand 5 states and 84 transitions. [2024-06-14 16:09:31,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 41 transitions, 207 flow [2024-06-14 16:09:31,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 41 transitions, 198 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-14 16:09:31,787 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 119 flow [2024-06-14 16:09:31,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=119, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2024-06-14 16:09:31,789 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2024-06-14 16:09:31,789 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 119 flow [2024-06-14 16:09:31,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 16:09:31,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:09:31,789 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:09:31,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-14 16:09:31,790 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 16:09:31,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:09:31,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1183318545, now seen corresponding path program 1 times [2024-06-14 16:09:31,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:09:31,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233457609] [2024-06-14 16:09:31,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:09:31,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:09:31,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:09:35,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:09:35,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:09:35,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233457609] [2024-06-14 16:09:35,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233457609] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:09:35,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:09:35,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 16:09:35,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009681855] [2024-06-14 16:09:35,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:09:35,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 16:09:35,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:09:35,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 16:09:35,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-14 16:09:35,399 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-14 16:09:35,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 119 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states 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 16:09:35,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:09:35,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-14 16:09:35,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:09:35,559 INFO L124 PetriNetUnfolderBase]: 123/241 cut-off events. [2024-06-14 16:09:35,559 INFO L125 PetriNetUnfolderBase]: For 265/265 co-relation queries the response was YES. [2024-06-14 16:09:35,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 687 conditions, 241 events. 123/241 cut-off events. For 265/265 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 875 event pairs, 38 based on Foata normal form. 1/241 useless extension candidates. Maximal degree in co-relation 669. Up to 219 conditions per place. [2024-06-14 16:09:35,561 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 26 selfloop transitions, 6 changer transitions 0/36 dead transitions. [2024-06-14 16:09:35,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 36 transitions, 201 flow [2024-06-14 16:09:35,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 16:09:35,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 16:09:35,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2024-06-14 16:09:35,565 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44516129032258067 [2024-06-14 16:09:35,565 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 119 flow. Second operand 5 states and 69 transitions. [2024-06-14 16:09:35,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 36 transitions, 201 flow [2024-06-14 16:09:35,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 36 transitions, 186 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-14 16:09:35,567 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 131 flow [2024-06-14 16:09:35,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=131, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2024-06-14 16:09:35,569 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2024-06-14 16:09:35,569 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 131 flow [2024-06-14 16:09:35,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states 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 16:09:35,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:09:35,569 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:09:35,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-14 16:09:35,570 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 16:09:35,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:09:35,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1987406221, now seen corresponding path program 1 times [2024-06-14 16:09:35,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:09:35,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414795948] [2024-06-14 16:09:35,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:09:35,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:09:35,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:09:37,936 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 16:09:37,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:09:37,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414795948] [2024-06-14 16:09:37,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414795948] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:09:37,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:09:37,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 16:09:37,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150085490] [2024-06-14 16:09:37,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:09:37,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 16:09:37,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:09:37,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 16:09:37,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-14 16:09:37,995 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2024-06-14 16:09:37,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 131 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:09:37,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:09:37,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2024-06-14 16:09:37,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:09:38,218 INFO L124 PetriNetUnfolderBase]: 119/233 cut-off events. [2024-06-14 16:09:38,219 INFO L125 PetriNetUnfolderBase]: For 345/345 co-relation queries the response was YES. [2024-06-14 16:09:38,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 698 conditions, 233 events. 119/233 cut-off events. For 345/345 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 827 event pairs, 19 based on Foata normal form. 4/236 useless extension candidates. Maximal degree in co-relation 678. Up to 178 conditions per place. [2024-06-14 16:09:38,222 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 32 selfloop transitions, 8 changer transitions 0/44 dead transitions. [2024-06-14 16:09:38,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 44 transitions, 237 flow [2024-06-14 16:09:38,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 16:09:38,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 16:09:38,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 94 transitions. [2024-06-14 16:09:38,223 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5053763440860215 [2024-06-14 16:09:38,223 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 131 flow. Second operand 6 states and 94 transitions. [2024-06-14 16:09:38,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 44 transitions, 237 flow [2024-06-14 16:09:38,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 44 transitions, 226 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-14 16:09:38,229 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 132 flow [2024-06-14 16:09:38,229 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=132, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2024-06-14 16:09:38,231 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 11 predicate places. [2024-06-14 16:09:38,233 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 132 flow [2024-06-14 16:09:38,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:09:38,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:09:38,233 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:09:38,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-14 16:09:38,240 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 16:09:38,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:09:38,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1971832074, now seen corresponding path program 1 times [2024-06-14 16:09:38,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:09:38,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999950782] [2024-06-14 16:09:38,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:09:38,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:09:38,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:09:41,711 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 16:09:41,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:09:41,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999950782] [2024-06-14 16:09:41,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999950782] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:09:41,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:09:41,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 16:09:41,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363541854] [2024-06-14 16:09:41,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:09:41,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 16:09:41,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:09:41,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 16:09:41,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 16:09:41,799 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-14 16:09:41,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 132 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 16:09:41,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:09:41,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-14 16:09:41,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:09:41,977 INFO L124 PetriNetUnfolderBase]: 135/263 cut-off events. [2024-06-14 16:09:41,977 INFO L125 PetriNetUnfolderBase]: For 525/525 co-relation queries the response was YES. [2024-06-14 16:09:41,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 815 conditions, 263 events. 135/263 cut-off events. For 525/525 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1016 event pairs, 35 based on Foata normal form. 3/263 useless extension candidates. Maximal degree in co-relation 795. Up to 195 conditions per place. [2024-06-14 16:09:41,979 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 29 selfloop transitions, 12 changer transitions 0/45 dead transitions. [2024-06-14 16:09:41,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 270 flow [2024-06-14 16:09:41,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 16:09:41,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 16:09:41,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2024-06-14 16:09:41,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46236559139784944 [2024-06-14 16:09:41,982 INFO L175 Difference]: Start difference. First operand has 41 places, 30 transitions, 132 flow. Second operand 6 states and 86 transitions. [2024-06-14 16:09:41,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 270 flow [2024-06-14 16:09:41,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 45 transitions, 250 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-14 16:09:41,985 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 180 flow [2024-06-14 16:09:41,985 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=180, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2024-06-14 16:09:41,988 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 14 predicate places. [2024-06-14 16:09:41,988 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 180 flow [2024-06-14 16:09:41,988 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 16:09:41,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:09:41,988 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:09:41,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-14 16:09:41,989 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 16:09:41,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:09:41,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1065870266, now seen corresponding path program 1 times [2024-06-14 16:09:41,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:09:41,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650183801] [2024-06-14 16:09:41,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:09:41,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:09:42,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:09:45,347 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 16:09:45,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:09:45,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650183801] [2024-06-14 16:09:45,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650183801] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:09:45,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:09:45,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 16:09:45,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253227520] [2024-06-14 16:09:45,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:09:45,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 16:09:45,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:09:45,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 16:09:45,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 16:09:45,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-14 16:09:45,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 180 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 16:09:45,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:09:45,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-14 16:09:45,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:09:45,590 INFO L124 PetriNetUnfolderBase]: 145/286 cut-off events. [2024-06-14 16:09:45,590 INFO L125 PetriNetUnfolderBase]: For 741/741 co-relation queries the response was YES. [2024-06-14 16:09:45,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1003 conditions, 286 events. 145/286 cut-off events. For 741/741 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1124 event pairs, 37 based on Foata normal form. 2/287 useless extension candidates. Maximal degree in co-relation 980. Up to 241 conditions per place. [2024-06-14 16:09:45,592 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 37 selfloop transitions, 11 changer transitions 0/52 dead transitions. [2024-06-14 16:09:45,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 52 transitions, 338 flow [2024-06-14 16:09:45,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:09:45,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:09:45,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2024-06-14 16:09:45,593 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4377880184331797 [2024-06-14 16:09:45,594 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 180 flow. Second operand 7 states and 95 transitions. [2024-06-14 16:09:45,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 52 transitions, 338 flow [2024-06-14 16:09:45,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 52 transitions, 324 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-14 16:09:45,596 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 235 flow [2024-06-14 16:09:45,596 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=235, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2024-06-14 16:09:45,596 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 20 predicate places. [2024-06-14 16:09:45,596 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 235 flow [2024-06-14 16:09:45,597 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 16:09:45,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:09:45,597 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:09:45,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-14 16:09:45,597 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 16:09:45,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:09:45,598 INFO L85 PathProgramCache]: Analyzing trace with hash -222427366, now seen corresponding path program 2 times [2024-06-14 16:09:45,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:09:45,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669819920] [2024-06-14 16:09:45,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:09:45,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:09:45,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:09:48,973 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 16:09:48,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:09:48,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669819920] [2024-06-14 16:09:48,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669819920] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:09:48,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:09:48,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 16:09:48,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15079491] [2024-06-14 16:09:48,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:09:48,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 16:09:48,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:09:48,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 16:09:48,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 16:09:49,026 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-14 16:09:49,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 235 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 16:09:49,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:09:49,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-14 16:09:49,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:09:49,252 INFO L124 PetriNetUnfolderBase]: 151/300 cut-off events. [2024-06-14 16:09:49,253 INFO L125 PetriNetUnfolderBase]: For 1038/1038 co-relation queries the response was YES. [2024-06-14 16:09:49,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1130 conditions, 300 events. 151/300 cut-off events. For 1038/1038 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1221 event pairs, 34 based on Foata normal form. 2/301 useless extension candidates. Maximal degree in co-relation 1104. Up to 245 conditions per place. [2024-06-14 16:09:49,255 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 36 selfloop transitions, 12 changer transitions 0/52 dead transitions. [2024-06-14 16:09:49,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 52 transitions, 376 flow [2024-06-14 16:09:49,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 16:09:49,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 16:09:49,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2024-06-14 16:09:49,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44623655913978494 [2024-06-14 16:09:49,256 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 235 flow. Second operand 6 states and 83 transitions. [2024-06-14 16:09:49,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 52 transitions, 376 flow [2024-06-14 16:09:49,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 52 transitions, 355 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-14 16:09:49,270 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 269 flow [2024-06-14 16:09:49,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=269, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2024-06-14 16:09:49,271 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 22 predicate places. [2024-06-14 16:09:49,271 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 269 flow [2024-06-14 16:09:49,271 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 16:09:49,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:09:49,272 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:09:49,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-14 16:09:49,272 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 16:09:49,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:09:49,273 INFO L85 PathProgramCache]: Analyzing trace with hash 997244558, now seen corresponding path program 3 times [2024-06-14 16:09:49,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:09:49,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613963535] [2024-06-14 16:09:49,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:09:49,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:09:49,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:09:52,939 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 16:09:52,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:09:52,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613963535] [2024-06-14 16:09:52,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613963535] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:09:52,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:09:52,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 16:09:52,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110114413] [2024-06-14 16:09:52,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:09:52,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 16:09:52,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:09:52,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 16:09:52,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 16:09:53,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-14 16:09:53,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 269 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 16:09:53,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:09:53,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-14 16:09:53,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:09:53,192 INFO L124 PetriNetUnfolderBase]: 141/282 cut-off events. [2024-06-14 16:09:53,192 INFO L125 PetriNetUnfolderBase]: For 1255/1255 co-relation queries the response was YES. [2024-06-14 16:09:53,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1083 conditions, 282 events. 141/282 cut-off events. For 1255/1255 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1113 event pairs, 36 based on Foata normal form. 4/282 useless extension candidates. Maximal degree in co-relation 1056. Up to 195 conditions per place. [2024-06-14 16:09:53,194 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 31 selfloop transitions, 16 changer transitions 0/51 dead transitions. [2024-06-14 16:09:53,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 51 transitions, 387 flow [2024-06-14 16:09:53,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 16:09:53,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 16:09:53,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2024-06-14 16:09:53,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45698924731182794 [2024-06-14 16:09:53,196 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 269 flow. Second operand 6 states and 85 transitions. [2024-06-14 16:09:53,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 51 transitions, 387 flow [2024-06-14 16:09:53,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 51 transitions, 357 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-14 16:09:53,198 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 278 flow [2024-06-14 16:09:53,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=278, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2024-06-14 16:09:53,198 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 24 predicate places. [2024-06-14 16:09:53,199 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 278 flow [2024-06-14 16:09:53,199 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 16:09:53,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:09:53,199 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:09:53,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-14 16:09:53,199 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 16:09:53,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:09:53,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1274309786, now seen corresponding path program 1 times [2024-06-14 16:09:53,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:09:53,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679039152] [2024-06-14 16:09:53,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:09:53,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:09:53,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:09:57,237 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 16:09:57,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:09:57,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679039152] [2024-06-14 16:09:57,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679039152] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:09:57,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:09:57,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 16:09:57,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559394894] [2024-06-14 16:09:57,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:09:57,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 16:09:57,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:09:57,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 16:09:57,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 16:09:57,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-14 16:09:57,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 278 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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 16:09:57,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:09:57,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-14 16:09:57,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:09:57,567 INFO L124 PetriNetUnfolderBase]: 145/291 cut-off events. [2024-06-14 16:09:57,567 INFO L125 PetriNetUnfolderBase]: For 1149/1149 co-relation queries the response was YES. [2024-06-14 16:09:57,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1104 conditions, 291 events. 145/291 cut-off events. For 1149/1149 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1164 event pairs, 32 based on Foata normal form. 3/290 useless extension candidates. Maximal degree in co-relation 1076. Up to 193 conditions per place. [2024-06-14 16:09:57,571 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 30 selfloop transitions, 22 changer transitions 0/56 dead transitions. [2024-06-14 16:09:57,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 56 transitions, 428 flow [2024-06-14 16:09:57,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:09:57,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:09:57,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2024-06-14 16:09:57,573 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45161290322580644 [2024-06-14 16:09:57,573 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 278 flow. Second operand 7 states and 98 transitions. [2024-06-14 16:09:57,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 56 transitions, 428 flow [2024-06-14 16:09:57,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 56 transitions, 383 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-14 16:09:57,577 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 312 flow [2024-06-14 16:09:57,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=312, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2024-06-14 16:09:57,578 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 26 predicate places. [2024-06-14 16:09:57,579 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 312 flow [2024-06-14 16:09:57,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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 16:09:57,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:09:57,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:09:57,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-14 16:09:57,580 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 16:09:57,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:09:57,581 INFO L85 PathProgramCache]: Analyzing trace with hash 850088361, now seen corresponding path program 1 times [2024-06-14 16:09:57,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:09:57,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615295792] [2024-06-14 16:09:57,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:09:57,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:09:57,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:10:02,019 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 16:10:02,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:10:02,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615295792] [2024-06-14 16:10:02,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615295792] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:10:02,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:10:02,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:10:02,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189495062] [2024-06-14 16:10:02,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:10:02,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:10:02,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:10:02,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:10:02,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:10:02,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-14 16:10:02,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 312 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 16:10:02,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:10:02,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-14 16:10:02,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:10:02,383 INFO L124 PetriNetUnfolderBase]: 162/328 cut-off events. [2024-06-14 16:10:02,383 INFO L125 PetriNetUnfolderBase]: For 1700/1700 co-relation queries the response was YES. [2024-06-14 16:10:02,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1271 conditions, 328 events. 162/328 cut-off events. For 1700/1700 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1363 event pairs, 36 based on Foata normal form. 14/338 useless extension candidates. Maximal degree in co-relation 1242. Up to 178 conditions per place. [2024-06-14 16:10:02,387 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 30 selfloop transitions, 22 changer transitions 7/63 dead transitions. [2024-06-14 16:10:02,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 63 transitions, 488 flow [2024-06-14 16:10:02,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:10:02,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:10:02,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 113 transitions. [2024-06-14 16:10:02,388 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45564516129032256 [2024-06-14 16:10:02,388 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 312 flow. Second operand 8 states and 113 transitions. [2024-06-14 16:10:02,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 63 transitions, 488 flow [2024-06-14 16:10:02,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 63 transitions, 437 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-14 16:10:02,394 INFO L231 Difference]: Finished difference. Result has 59 places, 46 transitions, 309 flow [2024-06-14 16:10:02,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=309, PETRI_PLACES=59, PETRI_TRANSITIONS=46} [2024-06-14 16:10:02,395 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 29 predicate places. [2024-06-14 16:10:02,395 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 46 transitions, 309 flow [2024-06-14 16:10:02,395 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 16:10:02,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:10:02,395 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:10:02,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-14 16:10:02,395 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 16:10:02,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:10:02,396 INFO L85 PathProgramCache]: Analyzing trace with hash 94762925, now seen corresponding path program 1 times [2024-06-14 16:10:02,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:10:02,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832205523] [2024-06-14 16:10:02,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:10:02,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:10:02,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:10:06,267 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 16:10:06,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:10:06,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832205523] [2024-06-14 16:10:06,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832205523] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:10:06,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:10:06,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 16:10:06,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069246059] [2024-06-14 16:10:06,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:10:06,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 16:10:06,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:10:06,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 16:10:06,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 16:10:06,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-14 16:10:06,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 309 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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 16:10:06,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:10:06,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-14 16:10:06,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:10:06,574 INFO L124 PetriNetUnfolderBase]: 148/307 cut-off events. [2024-06-14 16:10:06,574 INFO L125 PetriNetUnfolderBase]: For 1346/1346 co-relation queries the response was YES. [2024-06-14 16:10:06,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1242 conditions, 307 events. 148/307 cut-off events. For 1346/1346 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1282 event pairs, 34 based on Foata normal form. 1/307 useless extension candidates. Maximal degree in co-relation 1212. Up to 249 conditions per place. [2024-06-14 16:10:06,576 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 44 selfloop transitions, 12 changer transitions 0/60 dead transitions. [2024-06-14 16:10:06,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 60 transitions, 469 flow [2024-06-14 16:10:06,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:10:06,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:10:06,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2024-06-14 16:10:06,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4423963133640553 [2024-06-14 16:10:06,578 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 309 flow. Second operand 7 states and 96 transitions. [2024-06-14 16:10:06,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 60 transitions, 469 flow [2024-06-14 16:10:06,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 60 transitions, 420 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-14 16:10:06,580 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 307 flow [2024-06-14 16:10:06,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=307, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2024-06-14 16:10:06,581 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 30 predicate places. [2024-06-14 16:10:06,581 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 307 flow [2024-06-14 16:10:06,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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 16:10:06,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:10:06,581 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:10:06,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-14 16:10:06,582 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 16:10:06,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:10:06,582 INFO L85 PathProgramCache]: Analyzing trace with hash 582629231, now seen corresponding path program 1 times [2024-06-14 16:10:06,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:10:06,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565367072] [2024-06-14 16:10:06,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:10:06,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:10:06,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:10:10,758 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 16:10:10,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:10:10,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565367072] [2024-06-14 16:10:10,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565367072] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:10:10,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:10:10,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 16:10:10,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180046986] [2024-06-14 16:10:10,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:10:10,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 16:10:10,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:10:10,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 16:10:10,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 16:10:10,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-14 16:10:10,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 307 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:10:10,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:10:10,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-14 16:10:10,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:10:11,086 INFO L124 PetriNetUnfolderBase]: 154/317 cut-off events. [2024-06-14 16:10:11,086 INFO L125 PetriNetUnfolderBase]: For 1574/1574 co-relation queries the response was YES. [2024-06-14 16:10:11,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1278 conditions, 317 events. 154/317 cut-off events. For 1574/1574 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1317 event pairs, 36 based on Foata normal form. 2/315 useless extension candidates. Maximal degree in co-relation 1247. Up to 222 conditions per place. [2024-06-14 16:10:11,088 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 38 selfloop transitions, 18 changer transitions 0/60 dead transitions. [2024-06-14 16:10:11,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 60 transitions, 475 flow [2024-06-14 16:10:11,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:10:11,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:10:11,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2024-06-14 16:10:11,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4470046082949309 [2024-06-14 16:10:11,091 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 307 flow. Second operand 7 states and 97 transitions. [2024-06-14 16:10:11,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 60 transitions, 475 flow [2024-06-14 16:10:11,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 60 transitions, 444 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-14 16:10:11,094 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 346 flow [2024-06-14 16:10:11,094 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=346, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2024-06-14 16:10:11,095 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 32 predicate places. [2024-06-14 16:10:11,095 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 346 flow [2024-06-14 16:10:11,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:10:11,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:10:11,096 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:10:11,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-14 16:10:11,096 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 16:10:11,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:10:11,096 INFO L85 PathProgramCache]: Analyzing trace with hash 582925901, now seen corresponding path program 2 times [2024-06-14 16:10:11,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:10:11,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588018212] [2024-06-14 16:10:11,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:10:11,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:10:11,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:10:15,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:10:15,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:10:15,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588018212] [2024-06-14 16:10:15,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588018212] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:10:15,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:10:15,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 16:10:15,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077874870] [2024-06-14 16:10:15,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:10:15,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 16:10:15,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:10:15,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 16:10:15,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 16:10:15,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-14 16:10:15,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 346 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:10:15,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:10:15,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-14 16:10:15,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:10:15,551 INFO L124 PetriNetUnfolderBase]: 152/314 cut-off events. [2024-06-14 16:10:15,552 INFO L125 PetriNetUnfolderBase]: For 1747/1747 co-relation queries the response was YES. [2024-06-14 16:10:15,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1337 conditions, 314 events. 152/314 cut-off events. For 1747/1747 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1309 event pairs, 36 based on Foata normal form. 1/311 useless extension candidates. Maximal degree in co-relation 1305. Up to 207 conditions per place. [2024-06-14 16:10:15,554 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 37 selfloop transitions, 20 changer transitions 0/61 dead transitions. [2024-06-14 16:10:15,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 61 transitions, 504 flow [2024-06-14 16:10:15,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:10:15,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:10:15,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2024-06-14 16:10:15,555 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4423963133640553 [2024-06-14 16:10:15,555 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 346 flow. Second operand 7 states and 96 transitions. [2024-06-14 16:10:15,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 61 transitions, 504 flow [2024-06-14 16:10:15,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 61 transitions, 456 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-14 16:10:15,558 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 363 flow [2024-06-14 16:10:15,559 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=363, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2024-06-14 16:10:15,559 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 34 predicate places. [2024-06-14 16:10:15,559 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 363 flow [2024-06-14 16:10:15,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:10:15,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:10:15,560 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:10:15,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-14 16:10:15,560 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 16:10:15,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:10:15,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1310038016, now seen corresponding path program 1 times [2024-06-14 16:10:15,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:10:15,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775645250] [2024-06-14 16:10:15,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:10:15,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:10:15,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:10:18,758 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 16:10:18,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:10:18,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775645250] [2024-06-14 16:10:18,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775645250] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:10:18,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:10:18,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 16:10:18,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124462305] [2024-06-14 16:10:18,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:10:18,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 16:10:18,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:10:18,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 16:10:18,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 16:10:18,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-14 16:10:18,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 363 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:10:18,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:10:18,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-14 16:10:18,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:10:19,043 INFO L124 PetriNetUnfolderBase]: 150/308 cut-off events. [2024-06-14 16:10:19,043 INFO L125 PetriNetUnfolderBase]: For 1906/1906 co-relation queries the response was YES. [2024-06-14 16:10:19,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1347 conditions, 308 events. 150/308 cut-off events. For 1906/1906 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1288 event pairs, 37 based on Foata normal form. 1/303 useless extension candidates. Maximal degree in co-relation 1314. Up to 204 conditions per place. [2024-06-14 16:10:19,045 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 37 selfloop transitions, 21 changer transitions 1/63 dead transitions. [2024-06-14 16:10:19,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 63 transitions, 537 flow [2024-06-14 16:10:19,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 16:10:19,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 16:10:19,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2024-06-14 16:10:19,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46236559139784944 [2024-06-14 16:10:19,046 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 363 flow. Second operand 6 states and 86 transitions. [2024-06-14 16:10:19,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 63 transitions, 537 flow [2024-06-14 16:10:19,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 488 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-14 16:10:19,050 INFO L231 Difference]: Finished difference. Result has 65 places, 55 transitions, 387 flow [2024-06-14 16:10:19,050 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=387, PETRI_PLACES=65, PETRI_TRANSITIONS=55} [2024-06-14 16:10:19,051 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 35 predicate places. [2024-06-14 16:10:19,051 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 55 transitions, 387 flow [2024-06-14 16:10:19,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:10:19,052 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:10:19,052 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:10:19,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-14 16:10:19,052 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 16:10:19,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:10:19,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1824675192, now seen corresponding path program 1 times [2024-06-14 16:10:19,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:10:19,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218116236] [2024-06-14 16:10:19,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:10:19,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:10:19,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:10:23,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:10:23,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:10:23,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218116236] [2024-06-14 16:10:23,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218116236] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:10:23,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:10:23,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:10:23,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385531695] [2024-06-14 16:10:23,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:10:23,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:10:23,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:10:23,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:10:23,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:10:23,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-14 16:10:23,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 55 transitions, 387 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 16:10:23,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:10:23,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-14 16:10:23,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:10:23,657 INFO L124 PetriNetUnfolderBase]: 154/321 cut-off events. [2024-06-14 16:10:23,657 INFO L125 PetriNetUnfolderBase]: For 2298/2298 co-relation queries the response was YES. [2024-06-14 16:10:23,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1426 conditions, 321 events. 154/321 cut-off events. For 2298/2298 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1359 event pairs, 33 based on Foata normal form. 2/319 useless extension candidates. Maximal degree in co-relation 1392. Up to 242 conditions per place. [2024-06-14 16:10:23,661 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 48 selfloop transitions, 17 changer transitions 4/73 dead transitions. [2024-06-14 16:10:23,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 73 transitions, 641 flow [2024-06-14 16:10:23,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:10:23,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:10:23,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2024-06-14 16:10:23,663 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42338709677419356 [2024-06-14 16:10:23,663 INFO L175 Difference]: Start difference. First operand has 65 places, 55 transitions, 387 flow. Second operand 8 states and 105 transitions. [2024-06-14 16:10:23,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 73 transitions, 641 flow [2024-06-14 16:10:23,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 73 transitions, 586 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-14 16:10:23,666 INFO L231 Difference]: Finished difference. Result has 70 places, 60 transitions, 442 flow [2024-06-14 16:10:23,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=442, PETRI_PLACES=70, PETRI_TRANSITIONS=60} [2024-06-14 16:10:23,667 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 40 predicate places. [2024-06-14 16:10:23,667 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 60 transitions, 442 flow [2024-06-14 16:10:23,667 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 16:10:23,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:10:23,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:10:23,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-14 16:10:23,668 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 16:10:23,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:10:23,668 INFO L85 PathProgramCache]: Analyzing trace with hash -252074498, now seen corresponding path program 2 times [2024-06-14 16:10:23,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:10:23,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603139183] [2024-06-14 16:10:23,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:10:23,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:10:23,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:10:28,215 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 16:10:28,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:10:28,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603139183] [2024-06-14 16:10:28,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603139183] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:10:28,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:10:28,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:10:28,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215429] [2024-06-14 16:10:28,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:10:28,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:10:28,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:10:28,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:10:28,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:10:28,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-14 16:10:28,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 60 transitions, 442 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 16:10:28,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:10:28,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-14 16:10:28,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:10:28,628 INFO L124 PetriNetUnfolderBase]: 165/348 cut-off events. [2024-06-14 16:10:28,628 INFO L125 PetriNetUnfolderBase]: For 3505/3505 co-relation queries the response was YES. [2024-06-14 16:10:28,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1537 conditions, 348 events. 165/348 cut-off events. For 3505/3505 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1523 event pairs, 39 based on Foata normal form. 14/358 useless extension candidates. Maximal degree in co-relation 1501. Up to 182 conditions per place. [2024-06-14 16:10:28,630 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 41 selfloop transitions, 25 changer transitions 6/76 dead transitions. [2024-06-14 16:10:28,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 76 transitions, 662 flow [2024-06-14 16:10:28,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:10:28,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:10:28,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 125 transitions. [2024-06-14 16:10:28,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44802867383512546 [2024-06-14 16:10:28,633 INFO L175 Difference]: Start difference. First operand has 70 places, 60 transitions, 442 flow. Second operand 9 states and 125 transitions. [2024-06-14 16:10:28,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 76 transitions, 662 flow [2024-06-14 16:10:28,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 76 transitions, 620 flow, removed 17 selfloop flow, removed 2 redundant places. [2024-06-14 16:10:28,637 INFO L231 Difference]: Finished difference. Result has 77 places, 59 transitions, 464 flow [2024-06-14 16:10:28,637 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=464, PETRI_PLACES=77, PETRI_TRANSITIONS=59} [2024-06-14 16:10:28,638 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 47 predicate places. [2024-06-14 16:10:28,638 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 59 transitions, 464 flow [2024-06-14 16:10:28,638 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 16:10:28,638 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:10:28,638 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:10:28,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-14 16:10:28,638 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 16:10:28,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:10:28,639 INFO L85 PathProgramCache]: Analyzing trace with hash 891161544, now seen corresponding path program 3 times [2024-06-14 16:10:28,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:10:28,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890554212] [2024-06-14 16:10:28,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:10:28,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:10:28,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:10:32,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:10:32,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:10:32,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890554212] [2024-06-14 16:10:32,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890554212] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:10:32,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:10:32,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:10:32,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619678874] [2024-06-14 16:10:32,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:10:32,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:10:32,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:10:32,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:10:32,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:10:32,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-14 16:10:32,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 59 transitions, 464 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 16:10:32,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:10:32,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-14 16:10:32,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:10:32,981 INFO L124 PetriNetUnfolderBase]: 153/330 cut-off events. [2024-06-14 16:10:32,981 INFO L125 PetriNetUnfolderBase]: For 2213/2213 co-relation queries the response was YES. [2024-06-14 16:10:32,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1440 conditions, 330 events. 153/330 cut-off events. For 2213/2213 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1412 event pairs, 34 based on Foata normal form. 2/328 useless extension candidates. Maximal degree in co-relation 1402. Up to 212 conditions per place. [2024-06-14 16:10:32,983 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 43 selfloop transitions, 22 changer transitions 2/71 dead transitions. [2024-06-14 16:10:32,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 71 transitions, 642 flow [2024-06-14 16:10:32,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:10:32,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:10:32,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2024-06-14 16:10:32,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2024-06-14 16:10:32,989 INFO L175 Difference]: Start difference. First operand has 77 places, 59 transitions, 464 flow. Second operand 8 states and 104 transitions. [2024-06-14 16:10:32,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 71 transitions, 642 flow [2024-06-14 16:10:32,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 71 transitions, 569 flow, removed 8 selfloop flow, removed 11 redundant places. [2024-06-14 16:10:32,996 INFO L231 Difference]: Finished difference. Result has 74 places, 59 transitions, 439 flow [2024-06-14 16:10:32,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=439, PETRI_PLACES=74, PETRI_TRANSITIONS=59} [2024-06-14 16:10:32,997 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 44 predicate places. [2024-06-14 16:10:32,997 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 59 transitions, 439 flow [2024-06-14 16:10:32,998 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 16:10:32,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:10:32,998 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 16:10:32,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-14 16:10:32,998 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 16:10:32,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:10:32,999 INFO L85 PathProgramCache]: Analyzing trace with hash 870037580, now seen corresponding path program 1 times [2024-06-14 16:10:32,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:10:32,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667756902] [2024-06-14 16:10:32,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:10:32,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:10:33,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:10:36,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 16:10:36,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:10:36,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667756902] [2024-06-14 16:10:36,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667756902] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:10:36,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:10:36,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:10:36,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819161360] [2024-06-14 16:10:36,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:10:36,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:10:36,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:10:36,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:10:36,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:10:37,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-14 16:10:37,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 59 transitions, 439 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 16:10:37,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:10:37,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-14 16:10:37,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:10:37,306 INFO L124 PetriNetUnfolderBase]: 157/340 cut-off events. [2024-06-14 16:10:37,306 INFO L125 PetriNetUnfolderBase]: For 2192/2192 co-relation queries the response was YES. [2024-06-14 16:10:37,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1444 conditions, 340 events. 157/340 cut-off events. For 2192/2192 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1481 event pairs, 19 based on Foata normal form. 2/341 useless extension candidates. Maximal degree in co-relation 1408. Up to 251 conditions per place. [2024-06-14 16:10:37,309 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 59 selfloop transitions, 12 changer transitions 0/75 dead transitions. [2024-06-14 16:10:37,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 75 transitions, 631 flow [2024-06-14 16:10:37,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:10:37,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:10:37,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 106 transitions. [2024-06-14 16:10:37,312 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4274193548387097 [2024-06-14 16:10:37,325 INFO L175 Difference]: Start difference. First operand has 74 places, 59 transitions, 439 flow. Second operand 8 states and 106 transitions. [2024-06-14 16:10:37,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 75 transitions, 631 flow [2024-06-14 16:10:37,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 75 transitions, 576 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-14 16:10:37,337 INFO L231 Difference]: Finished difference. Result has 77 places, 60 transitions, 424 flow [2024-06-14 16:10:37,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=424, PETRI_PLACES=77, PETRI_TRANSITIONS=60} [2024-06-14 16:10:37,338 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 47 predicate places. [2024-06-14 16:10:37,338 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 60 transitions, 424 flow [2024-06-14 16:10:37,338 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 16:10:37,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:10:37,338 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 16:10:37,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-14 16:10:37,339 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 16:10:37,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:10:37,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1078969950, now seen corresponding path program 2 times [2024-06-14 16:10:37,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:10:37,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345514012] [2024-06-14 16:10:37,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:10:37,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:10:37,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:10:41,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 16:10:41,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:10:41,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345514012] [2024-06-14 16:10:41,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345514012] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:10:41,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:10:41,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:10:41,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172122520] [2024-06-14 16:10:41,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:10:41,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:10:41,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:10:41,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:10:41,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:10:41,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-14 16:10:41,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 60 transitions, 424 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 16:10:41,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:10:41,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-14 16:10:41,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:10:41,654 INFO L124 PetriNetUnfolderBase]: 161/348 cut-off events. [2024-06-14 16:10:41,655 INFO L125 PetriNetUnfolderBase]: For 2297/2297 co-relation queries the response was YES. [2024-06-14 16:10:41,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1446 conditions, 348 events. 161/348 cut-off events. For 2297/2297 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1521 event pairs, 33 based on Foata normal form. 2/349 useless extension candidates. Maximal degree in co-relation 1409. Up to 276 conditions per place. [2024-06-14 16:10:41,657 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 58 selfloop transitions, 13 changer transitions 0/75 dead transitions. [2024-06-14 16:10:41,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 75 transitions, 616 flow [2024-06-14 16:10:41,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:10:41,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:10:41,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2024-06-14 16:10:41,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4314516129032258 [2024-06-14 16:10:41,659 INFO L175 Difference]: Start difference. First operand has 77 places, 60 transitions, 424 flow. Second operand 8 states and 107 transitions. [2024-06-14 16:10:41,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 75 transitions, 616 flow [2024-06-14 16:10:41,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 75 transitions, 586 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-14 16:10:41,663 INFO L231 Difference]: Finished difference. Result has 79 places, 61 transitions, 438 flow [2024-06-14 16:10:41,663 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=438, PETRI_PLACES=79, PETRI_TRANSITIONS=61} [2024-06-14 16:10:41,664 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 49 predicate places. [2024-06-14 16:10:41,664 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 61 transitions, 438 flow [2024-06-14 16:10:41,664 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 16:10:41,664 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:10:41,664 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 16:10:41,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-14 16:10:41,665 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 16:10:41,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:10:41,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1078964990, now seen corresponding path program 1 times [2024-06-14 16:10:41,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:10:41,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47431844] [2024-06-14 16:10:41,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:10:41,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:10:41,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:10:45,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 16:10:45,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:10:45,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47431844] [2024-06-14 16:10:45,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47431844] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:10:45,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:10:45,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:10:45,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301695820] [2024-06-14 16:10:45,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:10:45,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:10:45,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:10:45,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:10:45,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:10:45,973 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-14 16:10:45,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 61 transitions, 438 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 16:10:45,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:10:45,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-14 16:10:45,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:10:46,181 INFO L124 PetriNetUnfolderBase]: 164/350 cut-off events. [2024-06-14 16:10:46,182 INFO L125 PetriNetUnfolderBase]: For 2539/2539 co-relation queries the response was YES. [2024-06-14 16:10:46,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1483 conditions, 350 events. 164/350 cut-off events. For 2539/2539 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1532 event pairs, 37 based on Foata normal form. 1/345 useless extension candidates. Maximal degree in co-relation 1445. Up to 250 conditions per place. [2024-06-14 16:10:46,184 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 41 selfloop transitions, 25 changer transitions 3/73 dead transitions. [2024-06-14 16:10:46,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 73 transitions, 640 flow [2024-06-14 16:10:46,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:10:46,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:10:46,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2024-06-14 16:10:46,190 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45622119815668205 [2024-06-14 16:10:46,190 INFO L175 Difference]: Start difference. First operand has 79 places, 61 transitions, 438 flow. Second operand 7 states and 99 transitions. [2024-06-14 16:10:46,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 73 transitions, 640 flow [2024-06-14 16:10:46,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 73 transitions, 606 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-14 16:10:46,195 INFO L231 Difference]: Finished difference. Result has 80 places, 63 transitions, 489 flow [2024-06-14 16:10:46,195 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=489, PETRI_PLACES=80, PETRI_TRANSITIONS=63} [2024-06-14 16:10:46,196 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 50 predicate places. [2024-06-14 16:10:46,196 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 63 transitions, 489 flow [2024-06-14 16:10:46,196 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 16:10:46,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:10:46,196 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 16:10:46,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-14 16:10:46,197 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 16:10:46,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:10:46,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1153824844, now seen corresponding path program 3 times [2024-06-14 16:10:46,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:10:46,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315401067] [2024-06-14 16:10:46,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:10:46,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:10:46,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:10:50,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:10:50,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:10:50,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315401067] [2024-06-14 16:10:50,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315401067] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:10:50,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:10:50,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:10:50,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208604156] [2024-06-14 16:10:50,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:10:50,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:10:50,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:10:50,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:10:50,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:10:50,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-14 16:10:50,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 63 transitions, 489 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 16:10:50,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:10:50,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-14 16:10:50,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:10:50,532 INFO L124 PetriNetUnfolderBase]: 156/341 cut-off events. [2024-06-14 16:10:50,533 INFO L125 PetriNetUnfolderBase]: For 2490/2490 co-relation queries the response was YES. [2024-06-14 16:10:50,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1445 conditions, 341 events. 156/341 cut-off events. For 2490/2490 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1483 event pairs, 29 based on Foata normal form. 2/342 useless extension candidates. Maximal degree in co-relation 1406. Up to 270 conditions per place. [2024-06-14 16:10:50,535 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 56 selfloop transitions, 14 changer transitions 0/74 dead transitions. [2024-06-14 16:10:50,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 74 transitions, 657 flow [2024-06-14 16:10:50,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:10:50,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:10:50,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-06-14 16:10:50,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4153225806451613 [2024-06-14 16:10:50,537 INFO L175 Difference]: Start difference. First operand has 80 places, 63 transitions, 489 flow. Second operand 8 states and 103 transitions. [2024-06-14 16:10:50,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 74 transitions, 657 flow [2024-06-14 16:10:50,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 74 transitions, 608 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-14 16:10:50,543 INFO L231 Difference]: Finished difference. Result has 84 places, 63 transitions, 473 flow [2024-06-14 16:10:50,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=473, PETRI_PLACES=84, PETRI_TRANSITIONS=63} [2024-06-14 16:10:50,543 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 54 predicate places. [2024-06-14 16:10:50,543 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 63 transitions, 473 flow [2024-06-14 16:10:50,543 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 16:10:50,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:10:50,544 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 16:10:50,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-14 16:10:50,544 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 16:10:50,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:10:50,544 INFO L85 PathProgramCache]: Analyzing trace with hash -2065474850, now seen corresponding path program 2 times [2024-06-14 16:10:50,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:10:50,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006673716] [2024-06-14 16:10:50,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:10:50,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:10:50,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:10:54,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:10:54,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:10:54,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006673716] [2024-06-14 16:10:54,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006673716] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:10:54,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:10:54,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:10:54,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47014354] [2024-06-14 16:10:54,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:10:54,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:10:54,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:10:54,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:10:54,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:10:54,612 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-14 16:10:54,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 63 transitions, 473 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 16:10:54,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:10:54,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-14 16:10:54,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:10:54,779 INFO L124 PetriNetUnfolderBase]: 159/343 cut-off events. [2024-06-14 16:10:54,780 INFO L125 PetriNetUnfolderBase]: For 2473/2473 co-relation queries the response was YES. [2024-06-14 16:10:54,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1433 conditions, 343 events. 159/343 cut-off events. For 2473/2473 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1509 event pairs, 36 based on Foata normal form. 1/338 useless extension candidates. Maximal degree in co-relation 1393. Up to 228 conditions per place. [2024-06-14 16:10:54,782 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 41 selfloop transitions, 28 changer transitions 0/73 dead transitions. [2024-06-14 16:10:54,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 73 transitions, 653 flow [2024-06-14 16:10:54,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:10:54,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:10:54,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2024-06-14 16:10:54,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43951612903225806 [2024-06-14 16:10:54,783 INFO L175 Difference]: Start difference. First operand has 84 places, 63 transitions, 473 flow. Second operand 8 states and 109 transitions. [2024-06-14 16:10:54,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 73 transitions, 653 flow [2024-06-14 16:10:54,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 73 transitions, 584 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-14 16:10:54,788 INFO L231 Difference]: Finished difference. Result has 84 places, 65 transitions, 491 flow [2024-06-14 16:10:54,788 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=491, PETRI_PLACES=84, PETRI_TRANSITIONS=65} [2024-06-14 16:10:54,788 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 54 predicate places. [2024-06-14 16:10:54,788 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 65 transitions, 491 flow [2024-06-14 16:10:54,788 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 16:10:54,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:10:54,789 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 16:10:54,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-14 16:10:54,789 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 16:10:54,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:10:54,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1560746718, now seen corresponding path program 3 times [2024-06-14 16:10:54,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:10:54,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121035544] [2024-06-14 16:10:54,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:10:54,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:10:54,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:10:59,376 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 16:10:59,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:10:59,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121035544] [2024-06-14 16:10:59,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121035544] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:10:59,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:10:59,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:10:59,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57596783] [2024-06-14 16:10:59,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:10:59,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:10:59,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:10:59,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:10:59,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:10:59,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-14 16:10:59,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 65 transitions, 491 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 16:10:59,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:10:59,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-14 16:10:59,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:10:59,660 INFO L124 PetriNetUnfolderBase]: 162/353 cut-off events. [2024-06-14 16:10:59,660 INFO L125 PetriNetUnfolderBase]: For 2665/2665 co-relation queries the response was YES. [2024-06-14 16:10:59,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1481 conditions, 353 events. 162/353 cut-off events. For 2665/2665 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1560 event pairs, 32 based on Foata normal form. 1/350 useless extension candidates. Maximal degree in co-relation 1441. Up to 257 conditions per place. [2024-06-14 16:10:59,662 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 52 selfloop transitions, 20 changer transitions 0/76 dead transitions. [2024-06-14 16:10:59,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 76 transitions, 683 flow [2024-06-14 16:10:59,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:10:59,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:10:59,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-14 16:10:59,664 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4157706093189964 [2024-06-14 16:10:59,664 INFO L175 Difference]: Start difference. First operand has 84 places, 65 transitions, 491 flow. Second operand 9 states and 116 transitions. [2024-06-14 16:10:59,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 76 transitions, 683 flow [2024-06-14 16:10:59,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 76 transitions, 612 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-14 16:10:59,669 INFO L231 Difference]: Finished difference. Result has 87 places, 67 transitions, 495 flow [2024-06-14 16:10:59,670 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=495, PETRI_PLACES=87, PETRI_TRANSITIONS=67} [2024-06-14 16:10:59,670 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 57 predicate places. [2024-06-14 16:10:59,670 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 67 transitions, 495 flow [2024-06-14 16:10:59,670 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 16:10:59,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:10:59,670 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 16:10:59,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-14 16:10:59,671 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 16:10:59,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:10:59,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1569020928, now seen corresponding path program 4 times [2024-06-14 16:10:59,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:10:59,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887055601] [2024-06-14 16:10:59,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:10:59,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:10:59,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:11:03,522 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 16:11:03,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:11:03,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887055601] [2024-06-14 16:11:03,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887055601] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:11:03,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:11:03,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:11:03,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407501199] [2024-06-14 16:11:03,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:11:03,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:11:03,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:11:03,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:11:03,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:11:03,612 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-14 16:11:03,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 67 transitions, 495 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 16:11:03,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:11:03,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-14 16:11:03,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:11:03,804 INFO L124 PetriNetUnfolderBase]: 160/347 cut-off events. [2024-06-14 16:11:03,804 INFO L125 PetriNetUnfolderBase]: For 2735/2735 co-relation queries the response was YES. [2024-06-14 16:11:03,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1446 conditions, 347 events. 160/347 cut-off events. For 2735/2735 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1534 event pairs, 36 based on Foata normal form. 1/342 useless extension candidates. Maximal degree in co-relation 1405. Up to 218 conditions per place. [2024-06-14 16:11:03,806 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 45 selfloop transitions, 28 changer transitions 0/77 dead transitions. [2024-06-14 16:11:03,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 77 transitions, 691 flow [2024-06-14 16:11:03,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:11:03,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:11:03,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 108 transitions. [2024-06-14 16:11:03,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43548387096774194 [2024-06-14 16:11:03,808 INFO L175 Difference]: Start difference. First operand has 87 places, 67 transitions, 495 flow. Second operand 8 states and 108 transitions. [2024-06-14 16:11:03,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 77 transitions, 691 flow [2024-06-14 16:11:03,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 77 transitions, 629 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-14 16:11:03,814 INFO L231 Difference]: Finished difference. Result has 88 places, 69 transitions, 528 flow [2024-06-14 16:11:03,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=528, PETRI_PLACES=88, PETRI_TRANSITIONS=69} [2024-06-14 16:11:03,814 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 58 predicate places. [2024-06-14 16:11:03,814 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 69 transitions, 528 flow [2024-06-14 16:11:03,814 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 16:11:03,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:11:03,815 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:11:03,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-14 16:11:03,815 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 16:11:03,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:11:03,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1354598209, now seen corresponding path program 1 times [2024-06-14 16:11:03,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:11:03,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471455884] [2024-06-14 16:11:03,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:11:03,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:11:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:11:08,173 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 16:11:08,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:11:08,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471455884] [2024-06-14 16:11:08,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471455884] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:11:08,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:11:08,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:11:08,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643895238] [2024-06-14 16:11:08,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:11:08,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:11:08,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:11:08,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:11:08,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:11:08,329 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-14 16:11:08,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 69 transitions, 528 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 16:11:08,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:11:08,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-14 16:11:08,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:11:08,559 INFO L124 PetriNetUnfolderBase]: 172/375 cut-off events. [2024-06-14 16:11:08,559 INFO L125 PetriNetUnfolderBase]: For 4344/4344 co-relation queries the response was YES. [2024-06-14 16:11:08,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1560 conditions, 375 events. 172/375 cut-off events. For 4344/4344 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1705 event pairs, 34 based on Foata normal form. 8/377 useless extension candidates. Maximal degree in co-relation 1518. Up to 255 conditions per place. [2024-06-14 16:11:08,562 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 57 selfloop transitions, 6 changer transitions 15/82 dead transitions. [2024-06-14 16:11:08,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 82 transitions, 730 flow [2024-06-14 16:11:08,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:11:08,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:11:08,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 93 transitions. [2024-06-14 16:11:08,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-14 16:11:08,563 INFO L175 Difference]: Start difference. First operand has 88 places, 69 transitions, 528 flow. Second operand 7 states and 93 transitions. [2024-06-14 16:11:08,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 82 transitions, 730 flow [2024-06-14 16:11:08,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 82 transitions, 651 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-14 16:11:08,568 INFO L231 Difference]: Finished difference. Result has 89 places, 66 transitions, 447 flow [2024-06-14 16:11:08,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=447, PETRI_PLACES=89, PETRI_TRANSITIONS=66} [2024-06-14 16:11:08,569 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 59 predicate places. [2024-06-14 16:11:08,569 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 66 transitions, 447 flow [2024-06-14 16:11:08,569 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 16:11:08,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:11:08,570 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:11:08,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-14 16:11:08,570 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 16:11:08,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:11:08,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1349747507, now seen corresponding path program 2 times [2024-06-14 16:11:08,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:11:08,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169422541] [2024-06-14 16:11:08,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:11:08,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:11:08,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:11:12,652 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 16:11:12,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:11:12,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169422541] [2024-06-14 16:11:12,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169422541] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:11:12,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:11:12,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:11:12,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203400849] [2024-06-14 16:11:12,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:11:12,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:11:12,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:11:12,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:11:12,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:11:12,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-14 16:11:12,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 66 transitions, 447 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 16:11:12,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:11:12,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-14 16:11:12,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:11:12,989 INFO L124 PetriNetUnfolderBase]: 148/325 cut-off events. [2024-06-14 16:11:12,989 INFO L125 PetriNetUnfolderBase]: For 3217/3217 co-relation queries the response was YES. [2024-06-14 16:11:12,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1342 conditions, 325 events. 148/325 cut-off events. For 3217/3217 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1424 event pairs, 15 based on Foata normal form. 2/322 useless extension candidates. Maximal degree in co-relation 1299. Up to 169 conditions per place. [2024-06-14 16:11:12,992 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 51 selfloop transitions, 19 changer transitions 0/74 dead transitions. [2024-06-14 16:11:12,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 74 transitions, 651 flow [2024-06-14 16:11:12,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:11:12,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:11:12,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2024-06-14 16:11:12,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4147465437788018 [2024-06-14 16:11:12,994 INFO L175 Difference]: Start difference. First operand has 89 places, 66 transitions, 447 flow. Second operand 7 states and 90 transitions. [2024-06-14 16:11:12,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 74 transitions, 651 flow [2024-06-14 16:11:12,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 74 transitions, 627 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-14 16:11:13,001 INFO L231 Difference]: Finished difference. Result has 85 places, 67 transitions, 479 flow [2024-06-14 16:11:13,001 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=479, PETRI_PLACES=85, PETRI_TRANSITIONS=67} [2024-06-14 16:11:13,002 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 55 predicate places. [2024-06-14 16:11:13,002 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 67 transitions, 479 flow [2024-06-14 16:11:13,002 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 16:11:13,002 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:11:13,002 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:11:13,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-14 16:11:13,003 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 16:11:13,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:11:13,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1349599637, now seen corresponding path program 3 times [2024-06-14 16:11:13,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:11:13,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268660749] [2024-06-14 16:11:13,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:11:13,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:11:13,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:11:17,784 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 16:11:17,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:11:17,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268660749] [2024-06-14 16:11:17,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268660749] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:11:17,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:11:17,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:11:17,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442175713] [2024-06-14 16:11:17,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:11:17,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:11:17,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:11:17,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:11:17,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:11:17,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-14 16:11:17,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 67 transitions, 479 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 16:11:17,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:11:17,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-14 16:11:17,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:11:18,101 INFO L124 PetriNetUnfolderBase]: 145/320 cut-off events. [2024-06-14 16:11:18,102 INFO L125 PetriNetUnfolderBase]: For 2413/2413 co-relation queries the response was YES. [2024-06-14 16:11:18,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1314 conditions, 320 events. 145/320 cut-off events. For 2413/2413 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1396 event pairs, 31 based on Foata normal form. 2/317 useless extension candidates. Maximal degree in co-relation 1273. Up to 209 conditions per place. [2024-06-14 16:11:18,104 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 47 selfloop transitions, 21 changer transitions 1/73 dead transitions. [2024-06-14 16:11:18,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 73 transitions, 635 flow [2024-06-14 16:11:18,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:11:18,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:11:18,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2024-06-14 16:11:18,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2024-06-14 16:11:18,105 INFO L175 Difference]: Start difference. First operand has 85 places, 67 transitions, 479 flow. Second operand 7 states and 91 transitions. [2024-06-14 16:11:18,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 73 transitions, 635 flow [2024-06-14 16:11:18,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 73 transitions, 597 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-14 16:11:18,110 INFO L231 Difference]: Finished difference. Result has 88 places, 67 transitions, 492 flow [2024-06-14 16:11:18,110 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=492, PETRI_PLACES=88, PETRI_TRANSITIONS=67} [2024-06-14 16:11:18,115 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 58 predicate places. [2024-06-14 16:11:18,115 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 67 transitions, 492 flow [2024-06-14 16:11:18,116 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 16:11:18,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:11:18,116 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:11:18,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-14 16:11:18,116 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 16:11:18,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:11:18,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1349593685, now seen corresponding path program 1 times [2024-06-14 16:11:18,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:11:18,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249622704] [2024-06-14 16:11:18,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:11:18,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:11:18,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:11:23,039 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 16:11:23,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:11:23,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249622704] [2024-06-14 16:11:23,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249622704] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:11:23,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:11:23,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:11:23,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767493981] [2024-06-14 16:11:23,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:11:23,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:11:23,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:11:23,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:11:23,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:11:23,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-14 16:11:23,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 67 transitions, 492 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 16:11:23,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:11:23,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-14 16:11:23,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:11:23,378 INFO L124 PetriNetUnfolderBase]: 145/328 cut-off events. [2024-06-14 16:11:23,378 INFO L125 PetriNetUnfolderBase]: For 3923/3923 co-relation queries the response was YES. [2024-06-14 16:11:23,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1367 conditions, 328 events. 145/328 cut-off events. For 3923/3923 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1465 event pairs, 26 based on Foata normal form. 8/331 useless extension candidates. Maximal degree in co-relation 1325. Up to 162 conditions per place. [2024-06-14 16:11:23,380 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 39 selfloop transitions, 23 changer transitions 9/75 dead transitions. [2024-06-14 16:11:23,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 75 transitions, 680 flow [2024-06-14 16:11:23,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:11:23,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:11:23,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2024-06-14 16:11:23,396 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45161290322580644 [2024-06-14 16:11:23,396 INFO L175 Difference]: Start difference. First operand has 88 places, 67 transitions, 492 flow. Second operand 7 states and 98 transitions. [2024-06-14 16:11:23,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 75 transitions, 680 flow [2024-06-14 16:11:23,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 75 transitions, 640 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-06-14 16:11:23,401 INFO L231 Difference]: Finished difference. Result has 90 places, 61 transitions, 463 flow [2024-06-14 16:11:23,402 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=463, PETRI_PLACES=90, PETRI_TRANSITIONS=61} [2024-06-14 16:11:23,404 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 60 predicate places. [2024-06-14 16:11:23,404 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 61 transitions, 463 flow [2024-06-14 16:11:23,404 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 16:11:23,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:11:23,404 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:11:23,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-14 16:11:23,405 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 16:11:23,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:11:23,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1615907273, now seen corresponding path program 2 times [2024-06-14 16:11:23,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:11:23,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971773490] [2024-06-14 16:11:23,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:11:23,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:11:23,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:11:28,164 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 16:11:28,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:11:28,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971773490] [2024-06-14 16:11:28,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971773490] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:11:28,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:11:28,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:11:28,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992546745] [2024-06-14 16:11:28,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:11:28,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:11:28,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:11:28,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:11:28,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:11:28,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-14 16:11:28,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 61 transitions, 463 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 16:11:28,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:11:28,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-14 16:11:28,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:11:28,483 INFO L124 PetriNetUnfolderBase]: 151/349 cut-off events. [2024-06-14 16:11:28,483 INFO L125 PetriNetUnfolderBase]: For 5530/5530 co-relation queries the response was YES. [2024-06-14 16:11:28,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1645 conditions, 349 events. 151/349 cut-off events. For 5530/5530 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1601 event pairs, 31 based on Foata normal form. 6/351 useless extension candidates. Maximal degree in co-relation 1602. Up to 160 conditions per place. [2024-06-14 16:11:28,486 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 47 selfloop transitions, 22 changer transitions 5/78 dead transitions. [2024-06-14 16:11:28,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 78 transitions, 741 flow [2024-06-14 16:11:28,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:11:28,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:11:28,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2024-06-14 16:11:28,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44086021505376344 [2024-06-14 16:11:28,487 INFO L175 Difference]: Start difference. First operand has 90 places, 61 transitions, 463 flow. Second operand 9 states and 123 transitions. [2024-06-14 16:11:28,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 78 transitions, 741 flow [2024-06-14 16:11:28,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 78 transitions, 670 flow, removed 4 selfloop flow, removed 11 redundant places. [2024-06-14 16:11:28,493 INFO L231 Difference]: Finished difference. Result has 87 places, 60 transitions, 437 flow [2024-06-14 16:11:28,493 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=437, PETRI_PLACES=87, PETRI_TRANSITIONS=60} [2024-06-14 16:11:28,493 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 57 predicate places. [2024-06-14 16:11:28,493 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 60 transitions, 437 flow [2024-06-14 16:11:28,494 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 16:11:28,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:11:28,494 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:11:28,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-14 16:11:28,494 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 16:11:28,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:11:28,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1615640363, now seen corresponding path program 3 times [2024-06-14 16:11:28,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:11:28,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282758366] [2024-06-14 16:11:28,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:11:28,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:11:28,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:11:32,658 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 16:11:32,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:11:32,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282758366] [2024-06-14 16:11:32,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282758366] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:11:32,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:11:32,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:11:32,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105118205] [2024-06-14 16:11:32,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:11:32,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:11:32,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:11:32,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:11:32,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:11:32,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-14 16:11:32,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 60 transitions, 437 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 16:11:32,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:11:32,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-14 16:11:32,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:11:32,913 INFO L124 PetriNetUnfolderBase]: 129/302 cut-off events. [2024-06-14 16:11:32,913 INFO L125 PetriNetUnfolderBase]: For 4010/4010 co-relation queries the response was YES. [2024-06-14 16:11:32,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1272 conditions, 302 events. 129/302 cut-off events. For 4010/4010 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1331 event pairs, 31 based on Foata normal form. 8/305 useless extension candidates. Maximal degree in co-relation 1231. Up to 157 conditions per place. [2024-06-14 16:11:32,915 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 38 selfloop transitions, 16 changer transitions 12/70 dead transitions. [2024-06-14 16:11:32,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 70 transitions, 619 flow [2024-06-14 16:11:32,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:11:32,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:11:32,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions. [2024-06-14 16:11:32,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121863799283154 [2024-06-14 16:11:32,917 INFO L175 Difference]: Start difference. First operand has 87 places, 60 transitions, 437 flow. Second operand 9 states and 115 transitions. [2024-06-14 16:11:32,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 70 transitions, 619 flow [2024-06-14 16:11:32,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 70 transitions, 573 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-14 16:11:32,921 INFO L231 Difference]: Finished difference. Result has 87 places, 54 transitions, 389 flow [2024-06-14 16:11:32,921 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=389, PETRI_PLACES=87, PETRI_TRANSITIONS=54} [2024-06-14 16:11:32,922 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 57 predicate places. [2024-06-14 16:11:32,922 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 54 transitions, 389 flow [2024-06-14 16:11:32,922 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 16:11:32,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:11:32,922 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:11:32,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-14 16:11:32,922 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 16:11:32,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:11:32,923 INFO L85 PathProgramCache]: Analyzing trace with hash -2058270101, now seen corresponding path program 4 times [2024-06-14 16:11:32,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:11:32,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393001888] [2024-06-14 16:11:32,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:11:32,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:11:32,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:11:37,690 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 16:11:37,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:11:37,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393001888] [2024-06-14 16:11:37,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393001888] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:11:37,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:11:37,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:11:37,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363928060] [2024-06-14 16:11:37,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:11:37,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:11:37,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:11:37,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:11:37,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:11:37,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-14 16:11:37,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 54 transitions, 389 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 16:11:37,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:11:37,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-14 16:11:37,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:11:38,049 INFO L124 PetriNetUnfolderBase]: 134/319 cut-off events. [2024-06-14 16:11:38,050 INFO L125 PetriNetUnfolderBase]: For 5094/5094 co-relation queries the response was YES. [2024-06-14 16:11:38,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1478 conditions, 319 events. 134/319 cut-off events. For 5094/5094 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1427 event pairs, 39 based on Foata normal form. 6/320 useless extension candidates. Maximal degree in co-relation 1437. Up to 134 conditions per place. [2024-06-14 16:11:38,052 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 42 selfloop transitions, 16 changer transitions 6/68 dead transitions. [2024-06-14 16:11:38,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 68 transitions, 635 flow [2024-06-14 16:11:38,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:11:38,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:11:38,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-14 16:11:38,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4265232974910394 [2024-06-14 16:11:38,053 INFO L175 Difference]: Start difference. First operand has 87 places, 54 transitions, 389 flow. Second operand 9 states and 119 transitions. [2024-06-14 16:11:38,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 68 transitions, 635 flow [2024-06-14 16:11:38,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 68 transitions, 585 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-14 16:11:38,058 INFO L231 Difference]: Finished difference. Result has 85 places, 52 transitions, 368 flow [2024-06-14 16:11:38,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=368, PETRI_PLACES=85, PETRI_TRANSITIONS=52} [2024-06-14 16:11:38,059 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 55 predicate places. [2024-06-14 16:11:38,059 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 52 transitions, 368 flow [2024-06-14 16:11:38,059 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 16:11:38,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:11:38,059 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:11:38,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-14 16:11:38,060 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 16:11:38,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:11:38,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1145659209, now seen corresponding path program 5 times [2024-06-14 16:11:38,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:11:38,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735115874] [2024-06-14 16:11:38,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:11:38,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:11:38,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:11:42,480 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 16:11:42,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:11:42,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735115874] [2024-06-14 16:11:42,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735115874] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:11:42,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:11:42,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:11:42,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820030650] [2024-06-14 16:11:42,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:11:42,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:11:42,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:11:42,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:11:42,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:11:42,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-14 16:11:42,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 52 transitions, 368 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 16:11:42,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:11:42,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-14 16:11:42,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:11:42,804 INFO L124 PetriNetUnfolderBase]: 110/270 cut-off events. [2024-06-14 16:11:42,804 INFO L125 PetriNetUnfolderBase]: For 3582/3582 co-relation queries the response was YES. [2024-06-14 16:11:42,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1102 conditions, 270 events. 110/270 cut-off events. For 3582/3582 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1158 event pairs, 27 based on Foata normal form. 8/274 useless extension candidates. Maximal degree in co-relation 1062. Up to 149 conditions per place. [2024-06-14 16:11:42,806 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 37 selfloop transitions, 12 changer transitions 12/65 dead transitions. [2024-06-14 16:11:42,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 65 transitions, 546 flow [2024-06-14 16:11:42,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:11:42,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:11:42,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-14 16:11:42,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4229390681003584 [2024-06-14 16:11:42,807 INFO L175 Difference]: Start difference. First operand has 85 places, 52 transitions, 368 flow. Second operand 9 states and 118 transitions. [2024-06-14 16:11:42,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 65 transitions, 546 flow [2024-06-14 16:11:42,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 65 transitions, 505 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-14 16:11:42,811 INFO L231 Difference]: Finished difference. Result has 84 places, 47 transitions, 324 flow [2024-06-14 16:11:42,811 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=324, PETRI_PLACES=84, PETRI_TRANSITIONS=47} [2024-06-14 16:11:42,811 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 54 predicate places. [2024-06-14 16:11:42,812 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 47 transitions, 324 flow [2024-06-14 16:11:42,812 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 16:11:42,812 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:11:42,812 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:11:42,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-14 16:11:42,812 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 16:11:42,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:11:42,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1394087497, now seen corresponding path program 6 times [2024-06-14 16:11:42,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:11:42,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424666008] [2024-06-14 16:11:42,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:11:42,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:11:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:11:46,929 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 16:11:46,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:11:46,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424666008] [2024-06-14 16:11:46,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424666008] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:11:46,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:11:46,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:11:46,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396198819] [2024-06-14 16:11:46,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:11:46,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:11:46,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:11:46,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:11:46,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:11:47,063 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-14 16:11:47,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 47 transitions, 324 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 16:11:47,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:11:47,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-14 16:11:47,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:11:47,241 INFO L124 PetriNetUnfolderBase]: 118/279 cut-off events. [2024-06-14 16:11:47,242 INFO L125 PetriNetUnfolderBase]: For 4609/4609 co-relation queries the response was YES. [2024-06-14 16:11:47,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1286 conditions, 279 events. 118/279 cut-off events. For 4609/4609 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1167 event pairs, 39 based on Foata normal form. 6/280 useless extension candidates. Maximal degree in co-relation 1247. Up to 105 conditions per place. [2024-06-14 16:11:47,244 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 36 selfloop transitions, 15 changer transitions 6/61 dead transitions. [2024-06-14 16:11:47,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 61 transitions, 548 flow [2024-06-14 16:11:47,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:11:47,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:11:47,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-14 16:11:47,245 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4229390681003584 [2024-06-14 16:11:47,245 INFO L175 Difference]: Start difference. First operand has 84 places, 47 transitions, 324 flow. Second operand 9 states and 118 transitions. [2024-06-14 16:11:47,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 61 transitions, 548 flow [2024-06-14 16:11:47,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 61 transitions, 478 flow, removed 16 selfloop flow, removed 10 redundant places. [2024-06-14 16:11:47,249 INFO L231 Difference]: Finished difference. Result has 77 places, 45 transitions, 292 flow [2024-06-14 16:11:47,249 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=292, PETRI_PLACES=77, PETRI_TRANSITIONS=45} [2024-06-14 16:11:47,249 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 47 predicate places. [2024-06-14 16:11:47,249 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 45 transitions, 292 flow [2024-06-14 16:11:47,250 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 16:11:47,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:11:47,250 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:11:47,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-14 16:11:47,250 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 16:11:47,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:11:47,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1393820587, now seen corresponding path program 7 times [2024-06-14 16:11:47,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:11:47,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535225647] [2024-06-14 16:11:47,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:11:47,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:11:47,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:11:52,680 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 16:11:52,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:11:52,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535225647] [2024-06-14 16:11:52,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535225647] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:11:52,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:11:52,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:11:52,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940133214] [2024-06-14 16:11:52,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:11:52,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:11:52,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:11:52,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:11:52,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:11:52,787 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-14 16:11:52,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 45 transitions, 292 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 16:11:52,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:11:52,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-14 16:11:52,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:11:52,960 INFO L124 PetriNetUnfolderBase]: 94/230 cut-off events. [2024-06-14 16:11:52,960 INFO L125 PetriNetUnfolderBase]: For 2783/2783 co-relation queries the response was YES. [2024-06-14 16:11:52,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 883 conditions, 230 events. 94/230 cut-off events. For 2783/2783 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 909 event pairs, 27 based on Foata normal form. 8/234 useless extension candidates. Maximal degree in co-relation 846. Up to 120 conditions per place. [2024-06-14 16:11:52,962 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 31 selfloop transitions, 12 changer transitions 11/58 dead transitions. [2024-06-14 16:11:52,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 58 transitions, 448 flow [2024-06-14 16:11:52,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:11:52,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:11:52,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-14 16:11:52,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2024-06-14 16:11:52,963 INFO L175 Difference]: Start difference. First operand has 77 places, 45 transitions, 292 flow. Second operand 9 states and 117 transitions. [2024-06-14 16:11:52,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 58 transitions, 448 flow [2024-06-14 16:11:52,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 58 transitions, 409 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-14 16:11:52,966 INFO L231 Difference]: Finished difference. Result has 76 places, 41 transitions, 257 flow [2024-06-14 16:11:52,966 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=257, PETRI_PLACES=76, PETRI_TRANSITIONS=41} [2024-06-14 16:11:52,966 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 46 predicate places. [2024-06-14 16:11:52,967 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 41 transitions, 257 flow [2024-06-14 16:11:52,967 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 16:11:52,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:11:52,967 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:11:52,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-14 16:11:52,967 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 16:11:52,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:11:52,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1411689925, now seen corresponding path program 8 times [2024-06-14 16:11:52,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:11:52,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560244985] [2024-06-14 16:11:52,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:11:52,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:11:53,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:11:57,527 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 16:11:57,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:11:57,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560244985] [2024-06-14 16:11:57,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560244985] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:11:57,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:11:57,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:11:57,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792489474] [2024-06-14 16:11:57,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:11:57,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:11:57,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:11:57,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:11:57,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:11:57,613 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-14 16:11:57,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 41 transitions, 257 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 16:11:57,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:11:57,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-14 16:11:57,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:11:57,749 INFO L124 PetriNetUnfolderBase]: 77/196 cut-off events. [2024-06-14 16:11:57,750 INFO L125 PetriNetUnfolderBase]: For 2014/2014 co-relation queries the response was YES. [2024-06-14 16:11:57,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 710 conditions, 196 events. 77/196 cut-off events. For 2014/2014 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 700 event pairs, 22 based on Foata normal form. 6/197 useless extension candidates. Maximal degree in co-relation 673. Up to 74 conditions per place. [2024-06-14 16:11:57,751 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 23 selfloop transitions, 10 changer transitions 14/51 dead transitions. [2024-06-14 16:11:57,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 51 transitions, 371 flow [2024-06-14 16:11:57,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:11:57,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:11:57,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-14 16:11:57,752 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3906810035842294 [2024-06-14 16:11:57,752 INFO L175 Difference]: Start difference. First operand has 76 places, 41 transitions, 257 flow. Second operand 9 states and 109 transitions. [2024-06-14 16:11:57,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 51 transitions, 371 flow [2024-06-14 16:11:57,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 51 transitions, 331 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-14 16:11:57,755 INFO L231 Difference]: Finished difference. Result has 71 places, 35 transitions, 205 flow [2024-06-14 16:11:57,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=205, PETRI_PLACES=71, PETRI_TRANSITIONS=35} [2024-06-14 16:11:57,755 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 41 predicate places. [2024-06-14 16:11:57,756 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 35 transitions, 205 flow [2024-06-14 16:11:57,756 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 16:11:57,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:11:57,756 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:11:57,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-14 16:11:57,756 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 16:11:57,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:11:57,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1195187911, now seen corresponding path program 1 times [2024-06-14 16:11:57,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:11:57,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080430081] [2024-06-14 16:11:57,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:11:57,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:11:57,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:12:02,329 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 16:12:02,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:12:02,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080430081] [2024-06-14 16:12:02,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080430081] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:12:02,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:12:02,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:12:02,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854691271] [2024-06-14 16:12:02,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:12:02,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:12:02,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:12:02,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:12:02,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:12:02,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-14 16:12:02,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 35 transitions, 205 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 16:12:02,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:12:02,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-14 16:12:02,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:12:02,674 INFO L124 PetriNetUnfolderBase]: 69/172 cut-off events. [2024-06-14 16:12:02,675 INFO L125 PetriNetUnfolderBase]: For 1673/1673 co-relation queries the response was YES. [2024-06-14 16:12:02,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 596 conditions, 172 events. 69/172 cut-off events. For 1673/1673 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 556 event pairs, 22 based on Foata normal form. 6/173 useless extension candidates. Maximal degree in co-relation 561. Up to 73 conditions per place. [2024-06-14 16:12:02,676 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 21 selfloop transitions, 7 changer transitions 14/46 dead transitions. [2024-06-14 16:12:02,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 46 transitions, 314 flow [2024-06-14 16:12:02,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:12:02,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:12:02,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2024-06-14 16:12:02,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3951612903225806 [2024-06-14 16:12:02,677 INFO L175 Difference]: Start difference. First operand has 71 places, 35 transitions, 205 flow. Second operand 8 states and 98 transitions. [2024-06-14 16:12:02,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 46 transitions, 314 flow [2024-06-14 16:12:02,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 46 transitions, 280 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-14 16:12:02,679 INFO L231 Difference]: Finished difference. Result has 63 places, 30 transitions, 161 flow [2024-06-14 16:12:02,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=161, PETRI_PLACES=63, PETRI_TRANSITIONS=30} [2024-06-14 16:12:02,679 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 33 predicate places. [2024-06-14 16:12:02,680 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 30 transitions, 161 flow [2024-06-14 16:12:02,680 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 16:12:02,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:12:02,680 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:12:02,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-14 16:12:02,680 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 16:12:02,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:12:02,681 INFO L85 PathProgramCache]: Analyzing trace with hash 724154507, now seen corresponding path program 2 times [2024-06-14 16:12:02,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:12:02,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229550894] [2024-06-14 16:12:02,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:12:02,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:12:02,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:12:07,558 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 16:12:07,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:12:07,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229550894] [2024-06-14 16:12:07,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229550894] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:12:07,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:12:07,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:12:07,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743320938] [2024-06-14 16:12:07,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:12:07,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:12:07,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:12:07,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:12:07,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:12:07,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-14 16:12:07,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 30 transitions, 161 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 16:12:07,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:12:07,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-14 16:12:07,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:12:07,792 INFO L124 PetriNetUnfolderBase]: 36/104 cut-off events. [2024-06-14 16:12:07,792 INFO L125 PetriNetUnfolderBase]: For 607/607 co-relation queries the response was YES. [2024-06-14 16:12:07,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305 conditions, 104 events. 36/104 cut-off events. For 607/607 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 272 event pairs, 3 based on Foata normal form. 6/107 useless extension candidates. Maximal degree in co-relation 286. Up to 24 conditions per place. [2024-06-14 16:12:07,793 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 0 selfloop transitions, 0 changer transitions 36/36 dead transitions. [2024-06-14 16:12:07,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 36 transitions, 211 flow [2024-06-14 16:12:07,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:12:07,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:12:07,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 89 transitions. [2024-06-14 16:12:07,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31899641577060933 [2024-06-14 16:12:07,797 INFO L175 Difference]: Start difference. First operand has 63 places, 30 transitions, 161 flow. Second operand 9 states and 89 transitions. [2024-06-14 16:12:07,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 36 transitions, 211 flow [2024-06-14 16:12:07,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 36 transitions, 171 flow, removed 2 selfloop flow, removed 14 redundant places. [2024-06-14 16:12:07,798 INFO L231 Difference]: Finished difference. Result has 50 places, 0 transitions, 0 flow [2024-06-14 16:12:07,798 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=0, PETRI_PLACES=50, PETRI_TRANSITIONS=0} [2024-06-14 16:12:07,798 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 20 predicate places. [2024-06-14 16:12:07,798 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 0 transitions, 0 flow [2024-06-14 16:12:07,798 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 16:12:07,802 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 4 remaining) [2024-06-14 16:12:07,802 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-14 16:12:07,802 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-06-14 16:12:07,803 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-14 16:12:07,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-14 16:12:07,804 INFO L445 BasicCegarLoop]: Path program histogram: [8, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:12:07,808 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-14 16:12:07,808 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-14 16:12:07,812 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-14 16:12:07,812 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-14 16:12:07,813 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.06 04:12:07 BasicIcfg [2024-06-14 16:12:07,813 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-14 16:12:07,813 INFO L158 Benchmark]: Toolchain (without parser) took 166217.71ms. Allocated memory was 184.5MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 156.7MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 424.3MB. Max. memory is 16.1GB. [2024-06-14 16:12:07,814 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 138.4MB. Free memory is still 89.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-14 16:12:07,814 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 138.4MB. Free memory is still 65.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-14 16:12:07,815 INFO L158 Benchmark]: CACSL2BoogieTranslator took 681.18ms. Allocated memory is still 184.5MB. Free memory was 156.7MB in the beginning and 106.4MB in the end (delta: 50.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-06-14 16:12:07,816 INFO L158 Benchmark]: Boogie Procedure Inliner took 119.07ms. Allocated memory is still 184.5MB. Free memory was 106.4MB in the beginning and 90.7MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-06-14 16:12:07,816 INFO L158 Benchmark]: Boogie Preprocessor took 114.39ms. Allocated memory is still 184.5MB. Free memory was 90.7MB in the beginning and 84.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-06-14 16:12:07,816 INFO L158 Benchmark]: RCFGBuilder took 951.48ms. Allocated memory is still 184.5MB. Free memory was 84.4MB in the beginning and 70.4MB in the end (delta: 13.9MB). Peak memory consumption was 65.3MB. Max. memory is 16.1GB. [2024-06-14 16:12:07,819 INFO L158 Benchmark]: TraceAbstraction took 164345.83ms. Allocated memory was 184.5MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 69.4MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 338.0MB. Max. memory is 16.1GB. [2024-06-14 16:12:07,825 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 138.4MB. Free memory is still 89.5MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.14ms. Allocated memory is still 138.4MB. Free memory is still 65.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 681.18ms. Allocated memory is still 184.5MB. Free memory was 156.7MB in the beginning and 106.4MB in the end (delta: 50.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 119.07ms. Allocated memory is still 184.5MB. Free memory was 106.4MB in the beginning and 90.7MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 114.39ms. Allocated memory is still 184.5MB. Free memory was 90.7MB in the beginning and 84.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 951.48ms. Allocated memory is still 184.5MB. Free memory was 84.4MB in the beginning and 70.4MB in the end (delta: 13.9MB). Peak memory consumption was 65.3MB. Max. memory is 16.1GB. * TraceAbstraction took 164345.83ms. Allocated memory was 184.5MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 69.4MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 338.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 806]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 807]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 49 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 164.2s, OverallIterations: 38, TraceHistogramMax: 1, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 11.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1849 SdHoareTripleChecker+Valid, 7.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1556 mSDsluCounter, 964 SdHoareTripleChecker+Invalid, 6.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 855 mSDsCounter, 274 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8461 IncrementalHoareTripleChecker+Invalid, 8735 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 274 mSolverCounterUnsat, 109 mSDtfsCounter, 8461 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 296 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 296 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 6.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=528occurred in iteration=25, InterpolantAutomatonStates: 279, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 150.4s InterpolantComputationTime, 589 NumberOfCodeBlocks, 589 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 551 ConstructedInterpolants, 0 QuantifiedInterpolants, 25356 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-06-14 16:12:07,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE