./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix034_pso.opt_tso.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/mix034_pso.opt_tso.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/mix034_pso.opt_tso.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix034_pso.opt_tso.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 15:08:33,717 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 15:08:33,778 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 15:08:33,783 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 15:08:33,784 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 15:08:33,807 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 15:08:33,807 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 15:08:33,808 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 15:08:33,808 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 15:08:33,811 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 15:08:33,811 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 15:08:33,811 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 15:08:33,812 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 15:08:33,813 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 15:08:33,813 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 15:08:33,814 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 15:08:33,814 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 15:08:33,814 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 15:08:33,814 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 15:08:33,814 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 15:08:33,815 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 15:08:33,815 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 15:08:33,815 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 15:08:33,816 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 15:08:33,816 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 15:08:33,816 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 15:08:33,816 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 15:08:33,816 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 15:08:33,817 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 15:08:33,817 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 15:08:33,818 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 15:08:33,818 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 15:08:33,818 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 15:08:33,818 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 15:08:33,819 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 15:08:33,819 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 15:08:33,819 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 15:08:33,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 15:08:33,819 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 15:08:33,819 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 15:08:33,820 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 15:08:33,820 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 15:08:33,820 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 15:08:33,820 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 15:08:34,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 15:08:34,028 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 15:08:34,030 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 15:08:34,031 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 15:08:34,032 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 15:08:34,033 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/mix034_pso.opt_tso.opt.yml/witness.yml [2024-06-14 15:08:34,136 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 15:08:34,136 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 15:08:34,137 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix034_pso.opt_tso.opt.i [2024-06-14 15:08:35,220 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 15:08:35,442 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 15:08:35,442 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_pso.opt_tso.opt.i [2024-06-14 15:08:35,454 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f98ab66b/dd9c62c95b6c425f9ce881aa1ffce65e/FLAG76c0f32a1 [2024-06-14 15:08:35,486 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f98ab66b/dd9c62c95b6c425f9ce881aa1ffce65e [2024-06-14 15:08:35,487 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 15:08:35,488 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 15:08:35,490 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 15:08:35,491 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 15:08:35,494 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 15:08:35,495 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:08:34" (1/2) ... [2024-06-14 15:08:35,497 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@417e1934 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:08:35, skipping insertion in model container [2024-06-14 15:08:35,497 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:08:34" (1/2) ... [2024-06-14 15:08:35,498 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@518d36e2 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:08:35, skipping insertion in model container [2024-06-14 15:08:35,498 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:08:35" (2/2) ... [2024-06-14 15:08:35,499 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@417e1934 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:08:35, skipping insertion in model container [2024-06-14 15:08:35,499 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:08:35" (2/2) ... [2024-06-14 15:08:35,500 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 15:08:35,554 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 15:08:35,555 INFO L97 edCorrectnessWitness]: Location invariant before [L816-L816] (((((((((((((((((! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 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 )__unbuffered_p1_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 )__unbuffered_p1_EAX >= 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 )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_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 )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )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 )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )z >= 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 )weak$$choice0) - (long long )z >= 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 )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_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 || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 1) && z <= 1) && 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)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 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)) && (z == 0 || z == 1)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1))) [2024-06-14 15:08:35,556 INFO L97 edCorrectnessWitness]: Location invariant before [L817-L817] (((((((((((((((((! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 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 )__unbuffered_p1_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 )__unbuffered_p1_EAX >= 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 )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_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 )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )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 )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )z >= 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 )weak$$choice0) - (long long )z >= 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 )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_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 || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 1) && z <= 1) && 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)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 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)) && (z == 0 || z == 1)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1))) [2024-06-14 15:08:35,556 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 15:08:35,557 INFO L106 edCorrectnessWitness]: ghost_update [L814-L814] multithreaded = 1; [2024-06-14 15:08:35,596 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 15:08:35,953 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 15:08:35,963 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-14 15:08:36,191 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 15:08:36,230 INFO L206 MainTranslator]: Completed translation [2024-06-14 15:08:36,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:08:36 WrapperNode [2024-06-14 15:08:36,231 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 15:08:36,232 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 15:08:36,232 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 15:08:36,232 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 15:08:36,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:08:36" (1/1) ... [2024-06-14 15:08:36,271 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:08:36" (1/1) ... [2024-06-14 15:08:36,348 INFO L138 Inliner]: procedures = 174, calls = 38, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 121 [2024-06-14 15:08:36,349 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 15:08:36,350 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 15:08:36,350 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 15:08:36,350 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 15:08:36,358 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:08:36" (1/1) ... [2024-06-14 15:08:36,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:08:36" (1/1) ... [2024-06-14 15:08:36,373 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:08:36" (1/1) ... [2024-06-14 15:08:36,418 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 15:08:36,419 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:08:36" (1/1) ... [2024-06-14 15:08:36,420 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:08:36" (1/1) ... [2024-06-14 15:08:36,449 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:08:36" (1/1) ... [2024-06-14 15:08:36,458 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:08:36" (1/1) ... [2024-06-14 15:08:36,470 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:08:36" (1/1) ... [2024-06-14 15:08:36,477 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:08:36" (1/1) ... [2024-06-14 15:08:36,540 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 15:08:36,541 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 15:08:36,541 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 15:08:36,541 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 15:08:36,542 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:08:36" (1/1) ... [2024-06-14 15:08:36,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 15:08:36,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 15:08:36,598 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 15:08:36,697 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 15:08:36,709 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-14 15:08:36,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 15:08:36,709 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-14 15:08:36,709 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-14 15:08:36,710 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-14 15:08:36,710 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-14 15:08:36,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 15:08:36,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-14 15:08:36,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 15:08:36,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 15:08:36,711 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 15:08:36,832 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 15:08:36,834 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 15:08:37,552 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 15:08:37,552 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 15:08:37,714 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 15:08:37,714 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-14 15:08:37,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:08:37 BoogieIcfgContainer [2024-06-14 15:08:37,720 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 15:08:37,722 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 15:08:37,722 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 15:08:37,724 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 15:08:37,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:08:34" (1/4) ... [2024-06-14 15:08:37,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4715efc8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 03:08:37, skipping insertion in model container [2024-06-14 15:08:37,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 03:08:35" (2/4) ... [2024-06-14 15:08:37,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4715efc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 03:08:37, skipping insertion in model container [2024-06-14 15:08:37,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:08:36" (3/4) ... [2024-06-14 15:08:37,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4715efc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 03:08:37, skipping insertion in model container [2024-06-14 15:08:37,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:08:37" (4/4) ... [2024-06-14 15:08:37,727 INFO L112 eAbstractionObserver]: Analyzing ICFG mix034_pso.opt_tso.opt.i [2024-06-14 15:08:37,740 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 15:08:37,740 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-14 15:08:37,740 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 15:08:37,815 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-14 15:08:37,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 32 transitions, 72 flow [2024-06-14 15:08:37,885 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2024-06-14 15:08:37,885 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 15:08:37,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 30 events. 0/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-14 15:08:37,887 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 32 transitions, 72 flow [2024-06-14 15:08:37,889 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 24 transitions, 54 flow [2024-06-14 15:08:37,901 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 15:08:37,908 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;@459f9db3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 15:08:37,908 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-14 15:08:37,915 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 15:08:37,915 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-14 15:08:37,915 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 15:08:37,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:08:37,916 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-14 15:08:37,916 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 15:08:37,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:08:37,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1491071914, now seen corresponding path program 1 times [2024-06-14 15:08:37,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:08:37,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61108981] [2024-06-14 15:08:37,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:08:37,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:08:38,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:08:41,649 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 15:08:41,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:08:41,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61108981] [2024-06-14 15:08:41,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61108981] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:08:41,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:08:41,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 15:08:41,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287071933] [2024-06-14 15:08:41,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:08:41,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 15:08:41,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:08:41,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 15:08:41,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 15:08:41,729 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2024-06-14 15:08:41,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:08:41,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:08:41,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2024-06-14 15:08:41,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:08:41,898 INFO L124 PetriNetUnfolderBase]: 131/265 cut-off events. [2024-06-14 15:08:41,898 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-14 15:08:41,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 523 conditions, 265 events. 131/265 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1002 event pairs, 75 based on Foata normal form. 1/253 useless extension candidates. Maximal degree in co-relation 509. Up to 235 conditions per place. [2024-06-14 15:08:41,902 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 22 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2024-06-14 15:08:41,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 119 flow [2024-06-14 15:08:41,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 15:08:41,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 15:08:41,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2024-06-14 15:08:41,911 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.59375 [2024-06-14 15:08:41,912 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 54 flow. Second operand 3 states and 57 transitions. [2024-06-14 15:08:41,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 119 flow [2024-06-14 15:08:41,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 30 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-14 15:08:41,916 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 73 flow [2024-06-14 15:08:41,917 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2024-06-14 15:08:41,920 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 1 predicate places. [2024-06-14 15:08:41,920 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 73 flow [2024-06-14 15:08:41,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:08:41,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:08:41,920 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:08:41,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 15:08:41,921 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 15:08:41,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:08:41,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1598758531, now seen corresponding path program 1 times [2024-06-14 15:08:41,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:08:41,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949651733] [2024-06-14 15:08:41,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:08:41,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:08:41,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:08:44,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:08:44,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:08:44,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949651733] [2024-06-14 15:08:44,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949651733] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:08:44,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:08:44,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 15:08:44,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292883216] [2024-06-14 15:08:44,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:08:44,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 15:08:44,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:08:44,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 15:08:44,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-14 15:08:44,371 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-14 15:08:44,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 73 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 15:08:44,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:08:44,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-14 15:08:44,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:08:44,562 INFO L124 PetriNetUnfolderBase]: 150/291 cut-off events. [2024-06-14 15:08:44,562 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2024-06-14 15:08:44,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 661 conditions, 291 events. 150/291 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1099 event pairs, 68 based on Foata normal form. 2/287 useless extension candidates. Maximal degree in co-relation 646. Up to 258 conditions per place. [2024-06-14 15:08:44,567 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 27 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2024-06-14 15:08:44,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 163 flow [2024-06-14 15:08:44,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 15:08:44,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 15:08:44,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2024-06-14 15:08:44,571 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.546875 [2024-06-14 15:08:44,572 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 73 flow. Second operand 4 states and 70 transitions. [2024-06-14 15:08:44,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 163 flow [2024-06-14 15:08:44,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 36 transitions, 160 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 15:08:44,575 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 97 flow [2024-06-14 15:08:44,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=97, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2024-06-14 15:08:44,575 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2024-06-14 15:08:44,576 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 97 flow [2024-06-14 15:08:44,577 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 15:08:44,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:08:44,577 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:08:44,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-14 15:08:44,578 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 15:08:44,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:08:44,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1972731897, now seen corresponding path program 1 times [2024-06-14 15:08:44,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:08:44,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361296584] [2024-06-14 15:08:44,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:08:44,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:08:44,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:08:48,018 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 15:08:48,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:08:48,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361296584] [2024-06-14 15:08:48,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361296584] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:08:48,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:08:48,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 15:08:48,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047840762] [2024-06-14 15:08:48,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:08:48,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 15:08:48,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:08:48,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 15:08:48,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-14 15:08:48,107 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-14 15:08:48,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 97 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 15:08:48,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:08:48,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-14 15:08:48,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:08:48,349 INFO L124 PetriNetUnfolderBase]: 147/288 cut-off events. [2024-06-14 15:08:48,349 INFO L125 PetriNetUnfolderBase]: For 166/166 co-relation queries the response was YES. [2024-06-14 15:08:48,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 288 events. 147/288 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1085 event pairs, 47 based on Foata normal form. 2/286 useless extension candidates. Maximal degree in co-relation 709. Up to 244 conditions per place. [2024-06-14 15:08:48,352 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 31 selfloop transitions, 7 changer transitions 0/42 dead transitions. [2024-06-14 15:08:48,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 42 transitions, 211 flow [2024-06-14 15:08:48,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:08:48,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:08:48,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2024-06-14 15:08:48,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.53125 [2024-06-14 15:08:48,356 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 97 flow. Second operand 5 states and 85 transitions. [2024-06-14 15:08:48,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 42 transitions, 211 flow [2024-06-14 15:08:48,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 202 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-14 15:08:48,359 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 121 flow [2024-06-14 15:08:48,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2024-06-14 15:08:48,361 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2024-06-14 15:08:48,361 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 121 flow [2024-06-14 15:08:48,361 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 15:08:48,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:08:48,361 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:08:48,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-14 15:08:48,362 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:08:48,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:08:48,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1714814456, now seen corresponding path program 1 times [2024-06-14 15:08:48,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:08:48,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786593244] [2024-06-14 15:08:48,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:08:48,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:08:48,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:08:51,547 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 15:08:51,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:08:51,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786593244] [2024-06-14 15:08:51,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786593244] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:08:51,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:08:51,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 15:08:51,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044196384] [2024-06-14 15:08:51,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:08:51,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 15:08:51,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:08:51,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 15:08:51,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-14 15:08:51,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-14 15:08:51,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 121 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 15:08:51,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:08:51,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-14 15:08:51,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:08:51,960 INFO L124 PetriNetUnfolderBase]: 143/278 cut-off events. [2024-06-14 15:08:51,960 INFO L125 PetriNetUnfolderBase]: For 274/274 co-relation queries the response was YES. [2024-06-14 15:08:51,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 766 conditions, 278 events. 143/278 cut-off events. For 274/274 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1021 event pairs, 25 based on Foata normal form. 4/276 useless extension candidates. Maximal degree in co-relation 748. Up to 218 conditions per place. [2024-06-14 15:08:51,962 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 31 selfloop transitions, 8 changer transitions 0/43 dead transitions. [2024-06-14 15:08:51,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 43 transitions, 225 flow [2024-06-14 15:08:51,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:08:51,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:08:51,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2024-06-14 15:08:51,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4947916666666667 [2024-06-14 15:08:51,966 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 121 flow. Second operand 6 states and 95 transitions. [2024-06-14 15:08:51,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 43 transitions, 225 flow [2024-06-14 15:08:51,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 210 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-14 15:08:51,968 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 118 flow [2024-06-14 15:08:51,969 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=118, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2024-06-14 15:08:51,970 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2024-06-14 15:08:51,970 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 118 flow [2024-06-14 15:08:51,970 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 15:08:51,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:08:51,971 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:08:51,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-14 15:08:51,971 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:08:51,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:08:51,971 INFO L85 PathProgramCache]: Analyzing trace with hash 983479153, now seen corresponding path program 1 times [2024-06-14 15:08:51,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:08:51,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635327281] [2024-06-14 15:08:51,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:08:51,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:08:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:08:56,427 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 15:08:56,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:08:56,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635327281] [2024-06-14 15:08:56,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635327281] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:08:56,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:08:56,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 15:08:56,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138877687] [2024-06-14 15:08:56,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:08:56,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 15:08:56,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:08:56,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 15:08:56,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-14 15:08:56,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-14 15:08:56,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 118 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:08:56,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:08:56,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-14 15:08:56,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:08:56,690 INFO L124 PetriNetUnfolderBase]: 119/248 cut-off events. [2024-06-14 15:08:56,690 INFO L125 PetriNetUnfolderBase]: For 340/340 co-relation queries the response was YES. [2024-06-14 15:08:56,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 702 conditions, 248 events. 119/248 cut-off events. For 340/340 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 915 event pairs, 34 based on Foata normal form. 1/243 useless extension candidates. Maximal degree in co-relation 683. Up to 211 conditions per place. [2024-06-14 15:08:56,692 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 25 selfloop transitions, 6 changer transitions 0/36 dead transitions. [2024-06-14 15:08:56,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 36 transitions, 198 flow [2024-06-14 15:08:56,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:08:56,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:08:56,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2024-06-14 15:08:56,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45625 [2024-06-14 15:08:56,693 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 118 flow. Second operand 5 states and 73 transitions. [2024-06-14 15:08:56,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 36 transitions, 198 flow [2024-06-14 15:08:56,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 36 transitions, 178 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-14 15:08:56,695 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 125 flow [2024-06-14 15:08:56,695 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=36, 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=125, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2024-06-14 15:08:56,696 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 10 predicate places. [2024-06-14 15:08:56,696 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 125 flow [2024-06-14 15:08:56,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:08:56,696 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:08:56,696 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:08:56,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-14 15:08:56,697 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 15:08:56,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:08:56,697 INFO L85 PathProgramCache]: Analyzing trace with hash 396271573, now seen corresponding path program 1 times [2024-06-14 15:08:56,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:08:56,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683469808] [2024-06-14 15:08:56,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:08:56,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:08:56,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:09:01,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:09:01,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:09:01,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683469808] [2024-06-14 15:09:01,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683469808] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:09:01,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:09:01,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:09:01,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996264929] [2024-06-14 15:09:01,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:09:01,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:09:01,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:09:01,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:09:01,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:09:01,481 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:09:01,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 125 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 15:09:01,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:09:01,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:09:01,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:09:01,700 INFO L124 PetriNetUnfolderBase]: 139/276 cut-off events. [2024-06-14 15:09:01,700 INFO L125 PetriNetUnfolderBase]: For 509/509 co-relation queries the response was YES. [2024-06-14 15:09:01,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 827 conditions, 276 events. 139/276 cut-off events. For 509/509 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1009 event pairs, 41 based on Foata normal form. 1/276 useless extension candidates. Maximal degree in co-relation 806. Up to 242 conditions per place. [2024-06-14 15:09:01,703 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 27 selfloop transitions, 8 changer transitions 0/39 dead transitions. [2024-06-14 15:09:01,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 39 transitions, 217 flow [2024-06-14 15:09:01,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:09:01,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:09:01,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2024-06-14 15:09:01,704 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-14 15:09:01,704 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 125 flow. Second operand 6 states and 80 transitions. [2024-06-14 15:09:01,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 39 transitions, 217 flow [2024-06-14 15:09:01,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 39 transitions, 206 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-14 15:09:01,707 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 147 flow [2024-06-14 15:09:01,707 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=147, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2024-06-14 15:09:01,709 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 13 predicate places. [2024-06-14 15:09:01,710 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 147 flow [2024-06-14 15:09:01,710 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 15:09:01,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:09:01,710 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:09:01,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-14 15:09:01,710 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 15:09:01,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:09:01,711 INFO L85 PathProgramCache]: Analyzing trace with hash -606204148, now seen corresponding path program 1 times [2024-06-14 15:09:01,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:09:01,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399761039] [2024-06-14 15:09:01,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:09:01,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:09:01,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:09:06,172 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 15:09:06,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:09:06,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399761039] [2024-06-14 15:09:06,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399761039] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:09:06,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:09:06,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:09:06,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247239443] [2024-06-14 15:09:06,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:09:06,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:09:06,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:09:06,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:09:06,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:09:06,250 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:09:06,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 147 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 15:09:06,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:09:06,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:09:06,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:09:06,564 INFO L124 PetriNetUnfolderBase]: 156/300 cut-off events. [2024-06-14 15:09:06,564 INFO L125 PetriNetUnfolderBase]: For 844/844 co-relation queries the response was YES. [2024-06-14 15:09:06,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 983 conditions, 300 events. 156/300 cut-off events. For 844/844 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1113 event pairs, 46 based on Foata normal form. 2/301 useless extension candidates. Maximal degree in co-relation 961. Up to 255 conditions per place. [2024-06-14 15:09:06,566 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 32 selfloop transitions, 8 changer transitions 0/45 dead transitions. [2024-06-14 15:09:06,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 45 transitions, 261 flow [2024-06-14 15:09:06,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:09:06,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:09:06,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2024-06-14 15:09:06,567 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-14 15:09:06,567 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 147 flow. Second operand 6 states and 84 transitions. [2024-06-14 15:09:06,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 45 transitions, 261 flow [2024-06-14 15:09:06,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 45 transitions, 244 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-14 15:09:06,569 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 163 flow [2024-06-14 15:09:06,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=163, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2024-06-14 15:09:06,569 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 15 predicate places. [2024-06-14 15:09:06,569 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 163 flow [2024-06-14 15:09:06,569 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 15:09:06,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:09:06,569 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:09:06,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-14 15:09:06,570 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 15:09:06,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:09:06,570 INFO L85 PathProgramCache]: Analyzing trace with hash 230678672, now seen corresponding path program 2 times [2024-06-14 15:09:06,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:09:06,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184348941] [2024-06-14 15:09:06,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:09:06,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:09:06,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:09:11,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:09:11,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:09:11,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184348941] [2024-06-14 15:09:11,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184348941] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:09:11,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:09:11,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:09:11,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880898926] [2024-06-14 15:09:11,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:09:11,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:09:11,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:09:11,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:09:11,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:09:11,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:09:11,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 163 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 15:09:11,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:09:11,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:09:11,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:09:11,622 INFO L124 PetriNetUnfolderBase]: 157/305 cut-off events. [2024-06-14 15:09:11,623 INFO L125 PetriNetUnfolderBase]: For 1121/1123 co-relation queries the response was YES. [2024-06-14 15:09:11,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1062 conditions, 305 events. 157/305 cut-off events. For 1121/1123 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1147 event pairs, 50 based on Foata normal form. 4/308 useless extension candidates. Maximal degree in co-relation 1039. Up to 248 conditions per place. [2024-06-14 15:09:11,624 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 29 selfloop transitions, 11 changer transitions 0/45 dead transitions. [2024-06-14 15:09:11,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 45 transitions, 277 flow [2024-06-14 15:09:11,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:09:11,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:09:11,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2024-06-14 15:09:11,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-14 15:09:11,627 INFO L175 Difference]: Start difference. First operand has 46 places, 35 transitions, 163 flow. Second operand 6 states and 84 transitions. [2024-06-14 15:09:11,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 45 transitions, 277 flow [2024-06-14 15:09:11,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 45 transitions, 260 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-14 15:09:11,630 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 189 flow [2024-06-14 15:09:11,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=189, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2024-06-14 15:09:11,633 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 17 predicate places. [2024-06-14 15:09:11,633 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 189 flow [2024-06-14 15:09:11,633 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 15:09:11,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:09:11,633 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:09:11,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-14 15:09:11,635 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 15:09:11,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:09:11,635 INFO L85 PathProgramCache]: Analyzing trace with hash 230686608, now seen corresponding path program 1 times [2024-06-14 15:09:11,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:09:11,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295614217] [2024-06-14 15:09:11,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:09:11,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:09:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:09:16,315 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 15:09:16,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:09:16,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295614217] [2024-06-14 15:09:16,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295614217] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:09:16,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:09:16,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:09:16,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472348360] [2024-06-14 15:09:16,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:09:16,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:09:16,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:09:16,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:09:16,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:09:16,428 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:09:16,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 189 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 15:09:16,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:09:16,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:09:16,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:09:16,712 INFO L124 PetriNetUnfolderBase]: 144/285 cut-off events. [2024-06-14 15:09:16,712 INFO L125 PetriNetUnfolderBase]: For 1084/1084 co-relation queries the response was YES. [2024-06-14 15:09:16,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1031 conditions, 285 events. 144/285 cut-off events. For 1084/1084 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1044 event pairs, 39 based on Foata normal form. 1/285 useless extension candidates. Maximal degree in co-relation 1007. Up to 248 conditions per place. [2024-06-14 15:09:16,720 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 32 selfloop transitions, 10 changer transitions 0/46 dead transitions. [2024-06-14 15:09:16,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 46 transitions, 299 flow [2024-06-14 15:09:16,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:09:16,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:09:16,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2024-06-14 15:09:16,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-14 15:09:16,721 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 189 flow. Second operand 7 states and 91 transitions. [2024-06-14 15:09:16,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 46 transitions, 299 flow [2024-06-14 15:09:16,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 46 transitions, 272 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-14 15:09:16,723 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 201 flow [2024-06-14 15:09:16,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=201, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2024-06-14 15:09:16,734 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 20 predicate places. [2024-06-14 15:09:16,734 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 201 flow [2024-06-14 15:09:16,734 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 15:09:16,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:09:16,734 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:09:16,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-14 15:09:16,735 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 15:09:16,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:09:16,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1612578758, now seen corresponding path program 1 times [2024-06-14 15:09:16,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:09:16,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153037555] [2024-06-14 15:09:16,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:09:16,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:09:16,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:09:21,645 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 15:09:21,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:09:21,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153037555] [2024-06-14 15:09:21,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153037555] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:09:21,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:09:21,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:09:21,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280803469] [2024-06-14 15:09:21,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:09:21,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:09:21,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:09:21,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:09:21,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:09:21,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:09:21,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 201 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:09:21,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:09:21,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:09:21,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:09:22,050 INFO L124 PetriNetUnfolderBase]: 150/294 cut-off events. [2024-06-14 15:09:22,050 INFO L125 PetriNetUnfolderBase]: For 1477/1477 co-relation queries the response was YES. [2024-06-14 15:09:22,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1116 conditions, 294 events. 150/294 cut-off events. For 1477/1477 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1089 event pairs, 42 based on Foata normal form. 1/294 useless extension candidates. Maximal degree in co-relation 1091. Up to 241 conditions per place. [2024-06-14 15:09:22,052 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 39 selfloop transitions, 10 changer transitions 0/54 dead transitions. [2024-06-14 15:09:22,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 54 transitions, 347 flow [2024-06-14 15:09:22,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:09:22,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:09:22,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2024-06-14 15:09:22,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4017857142857143 [2024-06-14 15:09:22,054 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 201 flow. Second operand 7 states and 90 transitions. [2024-06-14 15:09:22,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 54 transitions, 347 flow [2024-06-14 15:09:22,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 54 transitions, 324 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-14 15:09:22,056 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 223 flow [2024-06-14 15:09:22,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=223, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2024-06-14 15:09:22,057 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 22 predicate places. [2024-06-14 15:09:22,057 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 223 flow [2024-06-14 15:09:22,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:09:22,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:09:22,058 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:09:22,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-14 15:09:22,058 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 15:09:22,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:09:22,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1445324048, now seen corresponding path program 1 times [2024-06-14 15:09:22,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:09:22,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080602018] [2024-06-14 15:09:22,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:09:22,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:09:22,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:09:27,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:09:27,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:09:27,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080602018] [2024-06-14 15:09:27,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080602018] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:09:27,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:09:27,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:09:27,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543761083] [2024-06-14 15:09:27,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:09:27,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:09:27,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:09:27,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:09:27,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:09:27,162 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:09:27,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 223 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:09:27,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:09:27,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:09:27,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:09:27,452 INFO L124 PetriNetUnfolderBase]: 168/316 cut-off events. [2024-06-14 15:09:27,452 INFO L125 PetriNetUnfolderBase]: For 1820/1820 co-relation queries the response was YES. [2024-06-14 15:09:27,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1248 conditions, 316 events. 168/316 cut-off events. For 1820/1820 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1154 event pairs, 44 based on Foata normal form. 2/317 useless extension candidates. Maximal degree in co-relation 1222. Up to 275 conditions per place. [2024-06-14 15:09:27,454 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 42 selfloop transitions, 10 changer transitions 0/55 dead transitions. [2024-06-14 15:09:27,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 55 transitions, 373 flow [2024-06-14 15:09:27,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:09:27,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:09:27,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2024-06-14 15:09:27,456 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4017857142857143 [2024-06-14 15:09:27,456 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 223 flow. Second operand 7 states and 90 transitions. [2024-06-14 15:09:27,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 55 transitions, 373 flow [2024-06-14 15:09:27,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 55 transitions, 344 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-14 15:09:27,461 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 237 flow [2024-06-14 15:09:27,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=237, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2024-06-14 15:09:27,463 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 24 predicate places. [2024-06-14 15:09:27,463 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 237 flow [2024-06-14 15:09:27,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:09:27,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:09:27,464 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:09:27,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-14 15:09:27,464 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 15:09:27,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:09:27,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1438657808, now seen corresponding path program 2 times [2024-06-14 15:09:27,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:09:27,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102848677] [2024-06-14 15:09:27,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:09:27,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:09:27,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:09:32,116 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 15:09:32,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:09:32,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102848677] [2024-06-14 15:09:32,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102848677] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:09:32,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:09:32,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:09:32,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940616294] [2024-06-14 15:09:32,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:09:32,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:09:32,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:09:32,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:09:32,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:09:32,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:09:32,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 237 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:09:32,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:09:32,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:09:32,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:09:32,449 INFO L124 PetriNetUnfolderBase]: 171/322 cut-off events. [2024-06-14 15:09:32,449 INFO L125 PetriNetUnfolderBase]: For 2167/2169 co-relation queries the response was YES. [2024-06-14 15:09:32,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1322 conditions, 322 events. 171/322 cut-off events. For 2167/2169 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1203 event pairs, 48 based on Foata normal form. 3/324 useless extension candidates. Maximal degree in co-relation 1295. Up to 272 conditions per place. [2024-06-14 15:09:32,451 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 40 selfloop transitions, 16 changer transitions 0/59 dead transitions. [2024-06-14 15:09:32,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 59 transitions, 431 flow [2024-06-14 15:09:32,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:09:32,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:09:32,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2024-06-14 15:09:32,453 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39732142857142855 [2024-06-14 15:09:32,453 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 237 flow. Second operand 7 states and 89 transitions. [2024-06-14 15:09:32,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 59 transitions, 431 flow [2024-06-14 15:09:32,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 59 transitions, 400 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-14 15:09:32,459 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 309 flow [2024-06-14 15:09:32,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=309, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2024-06-14 15:09:32,460 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 28 predicate places. [2024-06-14 15:09:32,460 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 309 flow [2024-06-14 15:09:32,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:09:32,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:09:32,461 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:09:32,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-14 15:09:32,461 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 15:09:32,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:09:32,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1438894958, now seen corresponding path program 3 times [2024-06-14 15:09:32,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:09:32,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558807809] [2024-06-14 15:09:32,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:09:32,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:09:32,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:09:37,261 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 15:09:37,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:09:37,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558807809] [2024-06-14 15:09:37,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558807809] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:09:37,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:09:37,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:09:37,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060699405] [2024-06-14 15:09:37,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:09:37,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:09:37,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:09:37,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:09:37,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:09:37,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:09:37,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 309 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:09:37,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:09:37,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:09:37,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:09:37,548 INFO L124 PetriNetUnfolderBase]: 177/334 cut-off events. [2024-06-14 15:09:37,549 INFO L125 PetriNetUnfolderBase]: For 2665/2667 co-relation queries the response was YES. [2024-06-14 15:09:37,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1470 conditions, 334 events. 177/334 cut-off events. For 2665/2667 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1261 event pairs, 48 based on Foata normal form. 4/337 useless extension candidates. Maximal degree in co-relation 1440. Up to 263 conditions per place. [2024-06-14 15:09:37,551 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 41 selfloop transitions, 21 changer transitions 0/65 dead transitions. [2024-06-14 15:09:37,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 65 transitions, 529 flow [2024-06-14 15:09:37,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:09:37,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:09:37,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 93 transitions. [2024-06-14 15:09:37,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41517857142857145 [2024-06-14 15:09:37,552 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 309 flow. Second operand 7 states and 93 transitions. [2024-06-14 15:09:37,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 65 transitions, 529 flow [2024-06-14 15:09:37,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 65 transitions, 509 flow, removed 7 selfloop flow, removed 2 redundant places. [2024-06-14 15:09:37,555 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 386 flow [2024-06-14 15:09:37,555 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=386, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2024-06-14 15:09:37,556 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 33 predicate places. [2024-06-14 15:09:37,556 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 386 flow [2024-06-14 15:09:37,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:09:37,556 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:09:37,556 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:09:37,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-14 15:09:37,557 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 15:09:37,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:09:37,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1829894808, now seen corresponding path program 1 times [2024-06-14 15:09:37,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:09:37,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910763711] [2024-06-14 15:09:37,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:09:37,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:09:37,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:09:42,372 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 15:09:42,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:09:42,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910763711] [2024-06-14 15:09:42,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910763711] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:09:42,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:09:42,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:09:42,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309111410] [2024-06-14 15:09:42,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:09:42,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:09:42,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:09:42,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:09:42,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:09:42,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:09:42,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 386 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:09:42,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:09:42,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:09:42,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:09:42,775 INFO L124 PetriNetUnfolderBase]: 195/369 cut-off events. [2024-06-14 15:09:42,775 INFO L125 PetriNetUnfolderBase]: For 3203/3203 co-relation queries the response was YES. [2024-06-14 15:09:42,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1699 conditions, 369 events. 195/369 cut-off events. For 3203/3203 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1442 event pairs, 44 based on Foata normal form. 1/369 useless extension candidates. Maximal degree in co-relation 1667. Up to 311 conditions per place. [2024-06-14 15:09:42,777 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 58 selfloop transitions, 18 changer transitions 0/79 dead transitions. [2024-06-14 15:09:42,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 79 transitions, 649 flow [2024-06-14 15:09:42,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:09:42,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:09:42,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2024-06-14 15:09:42,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-06-14 15:09:42,778 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 386 flow. Second operand 9 states and 112 transitions. [2024-06-14 15:09:42,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 79 transitions, 649 flow [2024-06-14 15:09:42,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 79 transitions, 613 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-06-14 15:09:42,782 INFO L231 Difference]: Finished difference. Result has 73 places, 66 transitions, 493 flow [2024-06-14 15:09:42,782 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=493, PETRI_PLACES=73, PETRI_TRANSITIONS=66} [2024-06-14 15:09:42,783 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 42 predicate places. [2024-06-14 15:09:42,783 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 66 transitions, 493 flow [2024-06-14 15:09:42,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:09:42,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:09:42,783 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:09:42,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-14 15:09:42,783 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 15:09:42,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:09:42,784 INFO L85 PathProgramCache]: Analyzing trace with hash 238653906, now seen corresponding path program 2 times [2024-06-14 15:09:42,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:09:42,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992704470] [2024-06-14 15:09:42,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:09:42,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:09:42,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:09:48,472 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 15:09:48,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:09:48,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992704470] [2024-06-14 15:09:48,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992704470] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:09:48,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:09:48,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:09:48,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860161338] [2024-06-14 15:09:48,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:09:48,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:09:48,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:09:48,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:09:48,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:09:48,573 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:09:48,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 66 transitions, 493 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:09:48,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:09:48,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:09:48,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:09:48,882 INFO L124 PetriNetUnfolderBase]: 193/366 cut-off events. [2024-06-14 15:09:48,882 INFO L125 PetriNetUnfolderBase]: For 3603/3603 co-relation queries the response was YES. [2024-06-14 15:09:48,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1786 conditions, 366 events. 193/366 cut-off events. For 3603/3603 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1427 event pairs, 43 based on Foata normal form. 1/366 useless extension candidates. Maximal degree in co-relation 1749. Up to 300 conditions per place. [2024-06-14 15:09:48,885 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 56 selfloop transitions, 22 changer transitions 0/81 dead transitions. [2024-06-14 15:09:48,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 81 transitions, 715 flow [2024-06-14 15:09:48,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:09:48,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:09:48,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2024-06-14 15:09:48,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39453125 [2024-06-14 15:09:48,886 INFO L175 Difference]: Start difference. First operand has 73 places, 66 transitions, 493 flow. Second operand 8 states and 101 transitions. [2024-06-14 15:09:48,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 81 transitions, 715 flow [2024-06-14 15:09:48,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 81 transitions, 678 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-06-14 15:09:48,904 INFO L231 Difference]: Finished difference. Result has 78 places, 68 transitions, 540 flow [2024-06-14 15:09:48,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=540, PETRI_PLACES=78, PETRI_TRANSITIONS=68} [2024-06-14 15:09:48,905 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 47 predicate places. [2024-06-14 15:09:48,905 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 68 transitions, 540 flow [2024-06-14 15:09:48,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:09:48,905 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:09:48,905 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:09:48,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-14 15:09:48,906 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 15:09:48,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:09:48,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1553391723, now seen corresponding path program 1 times [2024-06-14 15:09:48,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:09:48,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739001793] [2024-06-14 15:09:48,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:09:48,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:09:48,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:09:53,823 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 15:09:53,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:09:53,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739001793] [2024-06-14 15:09:53,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739001793] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:09:53,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:09:53,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:09:53,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089614399] [2024-06-14 15:09:53,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:09:53,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:09:53,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:09:53,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:09:53,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:09:53,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:09:53,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 68 transitions, 540 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:09:53,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:09:53,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:09:53,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:09:54,217 INFO L124 PetriNetUnfolderBase]: 199/376 cut-off events. [2024-06-14 15:09:54,217 INFO L125 PetriNetUnfolderBase]: For 4192/4192 co-relation queries the response was YES. [2024-06-14 15:09:54,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1889 conditions, 376 events. 199/376 cut-off events. For 4192/4192 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1474 event pairs, 42 based on Foata normal form. 2/377 useless extension candidates. Maximal degree in co-relation 1851. Up to 316 conditions per place. [2024-06-14 15:09:54,220 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 65 selfloop transitions, 16 changer transitions 0/84 dead transitions. [2024-06-14 15:09:54,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 84 transitions, 770 flow [2024-06-14 15:09:54,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:09:54,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:09:54,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2024-06-14 15:09:54,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39453125 [2024-06-14 15:09:54,221 INFO L175 Difference]: Start difference. First operand has 78 places, 68 transitions, 540 flow. Second operand 8 states and 101 transitions. [2024-06-14 15:09:54,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 84 transitions, 770 flow [2024-06-14 15:09:54,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 84 transitions, 704 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-14 15:09:54,226 INFO L231 Difference]: Finished difference. Result has 80 places, 70 transitions, 536 flow [2024-06-14 15:09:54,227 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=536, PETRI_PLACES=80, PETRI_TRANSITIONS=70} [2024-06-14 15:09:54,227 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 49 predicate places. [2024-06-14 15:09:54,227 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 70 transitions, 536 flow [2024-06-14 15:09:54,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:09:54,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:09:54,228 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:09:54,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-14 15:09:54,228 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 15:09:54,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:09:54,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1537847189, now seen corresponding path program 2 times [2024-06-14 15:09:54,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:09:54,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334968856] [2024-06-14 15:09:54,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:09:54,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:09:54,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:09:59,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:09:59,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:09:59,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334968856] [2024-06-14 15:09:59,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334968856] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:09:59,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:09:59,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:09:59,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460030835] [2024-06-14 15:09:59,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:09:59,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:09:59,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:09:59,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:09:59,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:09:59,299 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:09:59,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 70 transitions, 536 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:09:59,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:09:59,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:09:59,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:09:59,557 INFO L124 PetriNetUnfolderBase]: 210/397 cut-off events. [2024-06-14 15:09:59,558 INFO L125 PetriNetUnfolderBase]: For 4372/4374 co-relation queries the response was YES. [2024-06-14 15:09:59,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1976 conditions, 397 events. 210/397 cut-off events. For 4372/4374 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1597 event pairs, 45 based on Foata normal form. 4/400 useless extension candidates. Maximal degree in co-relation 1937. Up to 282 conditions per place. [2024-06-14 15:09:59,561 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 54 selfloop transitions, 31 changer transitions 0/88 dead transitions. [2024-06-14 15:09:59,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 88 transitions, 856 flow [2024-06-14 15:09:59,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:09:59,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:09:59,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2024-06-14 15:09:59,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41015625 [2024-06-14 15:09:59,562 INFO L175 Difference]: Start difference. First operand has 80 places, 70 transitions, 536 flow. Second operand 8 states and 105 transitions. [2024-06-14 15:09:59,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 88 transitions, 856 flow [2024-06-14 15:09:59,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 88 transitions, 814 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-14 15:09:59,567 INFO L231 Difference]: Finished difference. Result has 83 places, 75 transitions, 627 flow [2024-06-14 15:09:59,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=627, PETRI_PLACES=83, PETRI_TRANSITIONS=75} [2024-06-14 15:09:59,568 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 52 predicate places. [2024-06-14 15:09:59,568 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 75 transitions, 627 flow [2024-06-14 15:09:59,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:09:59,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:09:59,568 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:09:59,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-14 15:09:59,568 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 15:09:59,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:09:59,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1538114316, now seen corresponding path program 3 times [2024-06-14 15:09:59,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:09:59,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456214846] [2024-06-14 15:09:59,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:09:59,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:09:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:10:04,509 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 15:10:04,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:10:04,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456214846] [2024-06-14 15:10:04,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456214846] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:10:04,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:10:04,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:10:04,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487039761] [2024-06-14 15:10:04,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:10:04,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:10:04,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:10:04,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:10:04,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:10:04,631 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:10:04,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 75 transitions, 627 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:10:04,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:10:04,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:10:04,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:10:04,826 INFO L124 PetriNetUnfolderBase]: 208/394 cut-off events. [2024-06-14 15:10:04,826 INFO L125 PetriNetUnfolderBase]: For 4721/4723 co-relation queries the response was YES. [2024-06-14 15:10:04,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2052 conditions, 394 events. 208/394 cut-off events. For 4721/4723 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1576 event pairs, 45 based on Foata normal form. 3/396 useless extension candidates. Maximal degree in co-relation 2011. Up to 313 conditions per place. [2024-06-14 15:10:04,829 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 55 selfloop transitions, 26 changer transitions 0/84 dead transitions. [2024-06-14 15:10:04,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 84 transitions, 815 flow [2024-06-14 15:10:04,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:10:04,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:10:04,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2024-06-14 15:10:04,830 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-14 15:10:04,830 INFO L175 Difference]: Start difference. First operand has 83 places, 75 transitions, 627 flow. Second operand 8 states and 100 transitions. [2024-06-14 15:10:04,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 84 transitions, 815 flow [2024-06-14 15:10:04,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 84 transitions, 763 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-06-14 15:10:04,851 INFO L231 Difference]: Finished difference. Result has 88 places, 75 transitions, 632 flow [2024-06-14 15:10:04,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=632, PETRI_PLACES=88, PETRI_TRANSITIONS=75} [2024-06-14 15:10:04,852 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 57 predicate places. [2024-06-14 15:10:04,852 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 75 transitions, 632 flow [2024-06-14 15:10:04,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:10:04,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:10:04,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:10:04,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-14 15:10:04,853 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 15:10:04,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:10:04,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1648718255, now seen corresponding path program 3 times [2024-06-14 15:10:04,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:10:04,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725409939] [2024-06-14 15:10:04,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:10:04,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:10:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:10:09,724 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 15:10:09,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:10:09,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725409939] [2024-06-14 15:10:09,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725409939] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:10:09,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:10:09,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:10:09,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557971241] [2024-06-14 15:10:09,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:10:09,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:10:09,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:10:09,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:10:09,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:10:09,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:10:09,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 75 transitions, 632 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:10:09,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:10:09,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:10:09,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:10:10,057 INFO L124 PetriNetUnfolderBase]: 214/404 cut-off events. [2024-06-14 15:10:10,057 INFO L125 PetriNetUnfolderBase]: For 5250/5252 co-relation queries the response was YES. [2024-06-14 15:10:10,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2149 conditions, 404 events. 214/404 cut-off events. For 5250/5252 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1619 event pairs, 45 based on Foata normal form. 4/407 useless extension candidates. Maximal degree in co-relation 2106. Up to 287 conditions per place. [2024-06-14 15:10:10,060 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 58 selfloop transitions, 29 changer transitions 0/90 dead transitions. [2024-06-14 15:10:10,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 90 transitions, 912 flow [2024-06-14 15:10:10,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:10:10,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:10:10,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2024-06-14 15:10:10,062 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41015625 [2024-06-14 15:10:10,062 INFO L175 Difference]: Start difference. First operand has 88 places, 75 transitions, 632 flow. Second operand 8 states and 105 transitions. [2024-06-14 15:10:10,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 90 transitions, 912 flow [2024-06-14 15:10:10,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 90 transitions, 838 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-14 15:10:10,068 INFO L231 Difference]: Finished difference. Result has 88 places, 77 transitions, 648 flow [2024-06-14 15:10:10,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=648, PETRI_PLACES=88, PETRI_TRANSITIONS=77} [2024-06-14 15:10:10,068 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 57 predicate places. [2024-06-14 15:10:10,068 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 77 transitions, 648 flow [2024-06-14 15:10:10,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:10:10,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:10:10,069 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:10:10,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-14 15:10:10,069 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 15:10:10,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:10:10,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1656069905, now seen corresponding path program 4 times [2024-06-14 15:10:10,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:10:10,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376094486] [2024-06-14 15:10:10,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:10:10,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:10:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:10:14,948 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 15:10:14,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:10:14,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376094486] [2024-06-14 15:10:14,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376094486] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:10:14,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:10:14,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:10:14,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147324342] [2024-06-14 15:10:14,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:10:14,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:10:14,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:10:14,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:10:14,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:10:15,053 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:10:15,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 77 transitions, 648 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:10:15,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:10:15,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:10:15,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:10:15,275 INFO L124 PetriNetUnfolderBase]: 210/400 cut-off events. [2024-06-14 15:10:15,275 INFO L125 PetriNetUnfolderBase]: For 5478/5480 co-relation queries the response was YES. [2024-06-14 15:10:15,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2123 conditions, 400 events. 210/400 cut-off events. For 5478/5480 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1622 event pairs, 45 based on Foata normal form. 4/403 useless extension candidates. Maximal degree in co-relation 2079. Up to 284 conditions per place. [2024-06-14 15:10:15,278 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 61 selfloop transitions, 28 changer transitions 0/92 dead transitions. [2024-06-14 15:10:15,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 92 transitions, 889 flow [2024-06-14 15:10:15,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:10:15,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:10:15,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2024-06-14 15:10:15,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41015625 [2024-06-14 15:10:15,285 INFO L175 Difference]: Start difference. First operand has 88 places, 77 transitions, 648 flow. Second operand 8 states and 105 transitions. [2024-06-14 15:10:15,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 92 transitions, 889 flow [2024-06-14 15:10:15,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 92 transitions, 819 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-06-14 15:10:15,292 INFO L231 Difference]: Finished difference. Result has 91 places, 78 transitions, 649 flow [2024-06-14 15:10:15,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=579, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=649, PETRI_PLACES=91, PETRI_TRANSITIONS=78} [2024-06-14 15:10:15,292 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 60 predicate places. [2024-06-14 15:10:15,293 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 78 transitions, 649 flow [2024-06-14 15:10:15,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:10:15,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:10:15,293 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:10:15,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-14 15:10:15,293 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 15:10:15,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:10:15,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1648441425, now seen corresponding path program 1 times [2024-06-14 15:10:15,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:10:15,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535223806] [2024-06-14 15:10:15,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:10:15,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:10:15,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:10:21,687 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 15:10:21,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:10:21,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535223806] [2024-06-14 15:10:21,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535223806] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:10:21,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:10:21,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:10:21,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33945059] [2024-06-14 15:10:21,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:10:21,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:10:21,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:10:21,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:10:21,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:10:21,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:10:21,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 78 transitions, 649 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:10:21,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:10:21,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:10:21,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:10:22,040 INFO L124 PetriNetUnfolderBase]: 208/395 cut-off events. [2024-06-14 15:10:22,041 INFO L125 PetriNetUnfolderBase]: For 5540/5542 co-relation queries the response was YES. [2024-06-14 15:10:22,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2105 conditions, 395 events. 208/395 cut-off events. For 5540/5542 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1570 event pairs, 45 based on Foata normal form. 1/395 useless extension candidates. Maximal degree in co-relation 2060. Up to 352 conditions per place. [2024-06-14 15:10:22,045 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 72 selfloop transitions, 14 changer transitions 0/89 dead transitions. [2024-06-14 15:10:22,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 89 transitions, 855 flow [2024-06-14 15:10:22,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:10:22,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:10:22,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2024-06-14 15:10:22,048 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3645833333333333 [2024-06-14 15:10:22,049 INFO L175 Difference]: Start difference. First operand has 91 places, 78 transitions, 649 flow. Second operand 9 states and 105 transitions. [2024-06-14 15:10:22,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 89 transitions, 855 flow [2024-06-14 15:10:22,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 89 transitions, 810 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-14 15:10:22,057 INFO L231 Difference]: Finished difference. Result has 95 places, 80 transitions, 653 flow [2024-06-14 15:10:22,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=653, PETRI_PLACES=95, PETRI_TRANSITIONS=80} [2024-06-14 15:10:22,058 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 64 predicate places. [2024-06-14 15:10:22,058 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 80 transitions, 653 flow [2024-06-14 15:10:22,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:10:22,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:10:22,058 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:10:22,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-14 15:10:22,059 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 15:10:22,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:10:22,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1686718291, now seen corresponding path program 1 times [2024-06-14 15:10:22,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:10:22,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936318974] [2024-06-14 15:10:22,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:10:22,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:10:22,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:10:27,114 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 15:10:27,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:10:27,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936318974] [2024-06-14 15:10:27,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936318974] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:10:27,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:10:27,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:10:27,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730271091] [2024-06-14 15:10:27,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:10:27,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:10:27,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:10:27,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:10:27,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:10:27,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:10:27,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 80 transitions, 653 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 15:10:27,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:10:27,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:10:27,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:10:27,555 INFO L124 PetriNetUnfolderBase]: 200/392 cut-off events. [2024-06-14 15:10:27,556 INFO L125 PetriNetUnfolderBase]: For 6256/6256 co-relation queries the response was YES. [2024-06-14 15:10:27,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2105 conditions, 392 events. 200/392 cut-off events. For 6256/6256 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1608 event pairs, 19 based on Foata normal form. 2/393 useless extension candidates. Maximal degree in co-relation 2059. Up to 280 conditions per place. [2024-06-14 15:10:27,559 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 67 selfloop transitions, 16 changer transitions 0/96 dead transitions. [2024-06-14 15:10:27,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 96 transitions, 871 flow [2024-06-14 15:10:27,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:10:27,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:10:27,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2024-06-14 15:10:27,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41796875 [2024-06-14 15:10:27,561 INFO L175 Difference]: Start difference. First operand has 95 places, 80 transitions, 653 flow. Second operand 8 states and 107 transitions. [2024-06-14 15:10:27,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 96 transitions, 871 flow [2024-06-14 15:10:27,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 96 transitions, 781 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-14 15:10:27,568 INFO L231 Difference]: Finished difference. Result has 93 places, 81 transitions, 611 flow [2024-06-14 15:10:27,568 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=611, PETRI_PLACES=93, PETRI_TRANSITIONS=81} [2024-06-14 15:10:27,569 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 62 predicate places. [2024-06-14 15:10:27,569 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 81 transitions, 611 flow [2024-06-14 15:10:27,569 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 15:10:27,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:10:27,569 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:10:27,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-14 15:10:27,570 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 15:10:27,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:10:27,570 INFO L85 PathProgramCache]: Analyzing trace with hash 792231643, now seen corresponding path program 2 times [2024-06-14 15:10:27,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:10:27,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294779787] [2024-06-14 15:10:27,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:10:27,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:10:27,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:10:32,259 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 15:10:32,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:10:32,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294779787] [2024-06-14 15:10:32,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294779787] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:10:32,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:10:32,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:10:32,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882164104] [2024-06-14 15:10:32,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:10:32,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:10:32,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:10:32,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:10:32,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:10:32,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:10:32,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 81 transitions, 611 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 15:10:32,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:10:32,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:10:32,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:10:32,743 INFO L124 PetriNetUnfolderBase]: 203/397 cut-off events. [2024-06-14 15:10:32,744 INFO L125 PetriNetUnfolderBase]: For 6820/6820 co-relation queries the response was YES. [2024-06-14 15:10:32,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2129 conditions, 397 events. 203/397 cut-off events. For 6820/6820 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1650 event pairs, 36 based on Foata normal form. 2/398 useless extension candidates. Maximal degree in co-relation 2083. Up to 303 conditions per place. [2024-06-14 15:10:32,747 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 64 selfloop transitions, 19 changer transitions 0/96 dead transitions. [2024-06-14 15:10:32,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 96 transitions, 829 flow [2024-06-14 15:10:32,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:10:32,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:10:32,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 108 transitions. [2024-06-14 15:10:32,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.421875 [2024-06-14 15:10:32,755 INFO L175 Difference]: Start difference. First operand has 93 places, 81 transitions, 611 flow. Second operand 8 states and 108 transitions. [2024-06-14 15:10:32,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 96 transitions, 829 flow [2024-06-14 15:10:32,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 96 transitions, 791 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-14 15:10:32,763 INFO L231 Difference]: Finished difference. Result has 95 places, 82 transitions, 630 flow [2024-06-14 15:10:32,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=630, PETRI_PLACES=95, PETRI_TRANSITIONS=82} [2024-06-14 15:10:32,764 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 64 predicate places. [2024-06-14 15:10:32,764 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 82 transitions, 630 flow [2024-06-14 15:10:32,765 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 15:10:32,765 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:10:32,765 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:10:32,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-14 15:10:32,765 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 15:10:32,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:10:32,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1191662673, now seen corresponding path program 1 times [2024-06-14 15:10:32,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:10:32,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529169056] [2024-06-14 15:10:32,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:10:32,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:10:32,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:10:37,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:10:37,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:10:37,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529169056] [2024-06-14 15:10:37,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529169056] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:10:37,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:10:37,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:10:37,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931019397] [2024-06-14 15:10:37,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:10:37,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:10:37,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:10:37,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:10:37,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:10:37,670 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:10:37,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 82 transitions, 630 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:10:37,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:10:37,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:10:37,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:10:37,937 INFO L124 PetriNetUnfolderBase]: 214/407 cut-off events. [2024-06-14 15:10:37,953 INFO L125 PetriNetUnfolderBase]: For 6945/6945 co-relation queries the response was YES. [2024-06-14 15:10:37,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2168 conditions, 407 events. 214/407 cut-off events. For 6945/6945 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1635 event pairs, 38 based on Foata normal form. 1/407 useless extension candidates. Maximal degree in co-relation 2121. Up to 334 conditions per place. [2024-06-14 15:10:37,956 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 71 selfloop transitions, 24 changer transitions 0/98 dead transitions. [2024-06-14 15:10:37,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 98 transitions, 886 flow [2024-06-14 15:10:37,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:10:37,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:10:37,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-14 15:10:37,971 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2024-06-14 15:10:37,971 INFO L175 Difference]: Start difference. First operand has 95 places, 82 transitions, 630 flow. Second operand 9 states and 111 transitions. [2024-06-14 15:10:37,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 98 transitions, 886 flow [2024-06-14 15:10:37,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 98 transitions, 841 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-14 15:10:37,978 INFO L231 Difference]: Finished difference. Result has 98 places, 84 transitions, 669 flow [2024-06-14 15:10:37,978 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=585, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=669, PETRI_PLACES=98, PETRI_TRANSITIONS=84} [2024-06-14 15:10:37,978 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 67 predicate places. [2024-06-14 15:10:37,979 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 84 transitions, 669 flow [2024-06-14 15:10:37,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:10:37,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:10:37,979 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:10:37,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-14 15:10:37,979 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 15:10:37,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:10:37,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1665358981, now seen corresponding path program 3 times [2024-06-14 15:10:37,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:10:37,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728107506] [2024-06-14 15:10:37,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:10:37,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:10:38,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:10:42,799 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 15:10:42,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:10:42,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728107506] [2024-06-14 15:10:42,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728107506] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:10:42,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:10:42,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:10:42,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690333466] [2024-06-14 15:10:42,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:10:42,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:10:42,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:10:42,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:10:42,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:10:42,933 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:10:42,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 84 transitions, 669 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 15:10:42,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:10:42,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:10:42,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:10:43,281 INFO L124 PetriNetUnfolderBase]: 206/405 cut-off events. [2024-06-14 15:10:43,281 INFO L125 PetriNetUnfolderBase]: For 7913/7913 co-relation queries the response was YES. [2024-06-14 15:10:43,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2201 conditions, 405 events. 206/405 cut-off events. For 7913/7913 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1694 event pairs, 36 based on Foata normal form. 2/406 useless extension candidates. Maximal degree in co-relation 2153. Up to 327 conditions per place. [2024-06-14 15:10:43,284 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 72 selfloop transitions, 13 changer transitions 0/98 dead transitions. [2024-06-14 15:10:43,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 98 transitions, 892 flow [2024-06-14 15:10:43,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:10:43,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:10:43,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2024-06-14 15:10:43,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41015625 [2024-06-14 15:10:43,286 INFO L175 Difference]: Start difference. First operand has 98 places, 84 transitions, 669 flow. Second operand 8 states and 105 transitions. [2024-06-14 15:10:43,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 98 transitions, 892 flow [2024-06-14 15:10:43,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 98 transitions, 826 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-14 15:10:43,293 INFO L231 Difference]: Finished difference. Result has 100 places, 86 transitions, 660 flow [2024-06-14 15:10:43,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=660, PETRI_PLACES=100, PETRI_TRANSITIONS=86} [2024-06-14 15:10:43,294 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 69 predicate places. [2024-06-14 15:10:43,294 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 86 transitions, 660 flow [2024-06-14 15:10:43,294 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 15:10:43,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:10:43,295 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:10:43,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-14 15:10:43,295 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 15:10:43,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:10:43,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1076191765, now seen corresponding path program 1 times [2024-06-14 15:10:43,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:10:43,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377641824] [2024-06-14 15:10:43,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:10:43,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:10:43,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:10:47,725 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 15:10:47,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:10:47,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377641824] [2024-06-14 15:10:47,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377641824] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:10:47,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:10:47,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:10:47,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089650502] [2024-06-14 15:10:47,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:10:47,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:10:47,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:10:47,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:10:47,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:10:47,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:10:47,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 86 transitions, 660 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:10:47,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:10:47,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:10:47,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:10:48,125 INFO L124 PetriNetUnfolderBase]: 224/433 cut-off events. [2024-06-14 15:10:48,126 INFO L125 PetriNetUnfolderBase]: For 8375/8375 co-relation queries the response was YES. [2024-06-14 15:10:48,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2302 conditions, 433 events. 224/433 cut-off events. For 8375/8375 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1821 event pairs, 37 based on Foata normal form. 2/434 useless extension candidates. Maximal degree in co-relation 2252. Up to 355 conditions per place. [2024-06-14 15:10:48,130 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 82 selfloop transitions, 18 changer transitions 0/103 dead transitions. [2024-06-14 15:10:48,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 103 transitions, 937 flow [2024-06-14 15:10:48,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:10:48,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:10:48,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2024-06-14 15:10:48,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-06-14 15:10:48,132 INFO L175 Difference]: Start difference. First operand has 100 places, 86 transitions, 660 flow. Second operand 9 states and 112 transitions. [2024-06-14 15:10:48,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 103 transitions, 937 flow [2024-06-14 15:10:48,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 103 transitions, 901 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-14 15:10:48,140 INFO L231 Difference]: Finished difference. Result has 104 places, 88 transitions, 695 flow [2024-06-14 15:10:48,140 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=695, PETRI_PLACES=104, PETRI_TRANSITIONS=88} [2024-06-14 15:10:48,141 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 73 predicate places. [2024-06-14 15:10:48,141 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 88 transitions, 695 flow [2024-06-14 15:10:48,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:10:48,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:10:48,141 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:10:48,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-14 15:10:48,141 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 15:10:48,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:10:48,142 INFO L85 PathProgramCache]: Analyzing trace with hash 201256663, now seen corresponding path program 4 times [2024-06-14 15:10:48,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:10:48,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020155056] [2024-06-14 15:10:48,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:10:48,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:10:48,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:10:53,293 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 15:10:53,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:10:53,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020155056] [2024-06-14 15:10:53,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020155056] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:10:53,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:10:53,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:10:53,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177763502] [2024-06-14 15:10:53,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:10:53,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:10:53,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:10:53,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:10:53,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:10:53,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:10:53,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 88 transitions, 695 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 15:10:53,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:10:53,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:10:53,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:10:53,600 INFO L124 PetriNetUnfolderBase]: 209/413 cut-off events. [2024-06-14 15:10:53,601 INFO L125 PetriNetUnfolderBase]: For 8443/8445 co-relation queries the response was YES. [2024-06-14 15:10:53,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2222 conditions, 413 events. 209/413 cut-off events. For 8443/8445 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1752 event pairs, 37 based on Foata normal form. 4/416 useless extension candidates. Maximal degree in co-relation 2171. Up to 323 conditions per place. [2024-06-14 15:10:53,604 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 68 selfloop transitions, 17 changer transitions 0/98 dead transitions. [2024-06-14 15:10:53,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 98 transitions, 893 flow [2024-06-14 15:10:53,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:10:53,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:10:53,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2024-06-14 15:10:53,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41015625 [2024-06-14 15:10:53,605 INFO L175 Difference]: Start difference. First operand has 104 places, 88 transitions, 695 flow. Second operand 8 states and 105 transitions. [2024-06-14 15:10:53,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 98 transitions, 893 flow [2024-06-14 15:10:53,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 98 transitions, 838 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-14 15:10:53,614 INFO L231 Difference]: Finished difference. Result has 105 places, 88 transitions, 678 flow [2024-06-14 15:10:53,614 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=678, PETRI_PLACES=105, PETRI_TRANSITIONS=88} [2024-06-14 15:10:53,614 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 74 predicate places. [2024-06-14 15:10:53,615 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 88 transitions, 678 flow [2024-06-14 15:10:53,615 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 15:10:53,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:10:53,615 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:10:53,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-14 15:10:53,615 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 15:10:53,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:10:53,616 INFO L85 PathProgramCache]: Analyzing trace with hash 437616721, now seen corresponding path program 2 times [2024-06-14 15:10:53,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:10:53,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163723781] [2024-06-14 15:10:53,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:10:53,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:10:53,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:10:59,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:10:59,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:10:59,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163723781] [2024-06-14 15:10:59,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163723781] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:10:59,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:10:59,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:10:59,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802426503] [2024-06-14 15:10:59,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:10:59,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:10:59,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:10:59,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:10:59,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:10:59,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:10:59,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 88 transitions, 678 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:10:59,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:10:59,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:10:59,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:10:59,518 INFO L124 PetriNetUnfolderBase]: 242/457 cut-off events. [2024-06-14 15:10:59,519 INFO L125 PetriNetUnfolderBase]: For 10225/10227 co-relation queries the response was YES. [2024-06-14 15:10:59,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2538 conditions, 457 events. 242/457 cut-off events. For 10225/10227 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1894 event pairs, 40 based on Foata normal form. 4/460 useless extension candidates. Maximal degree in co-relation 2486. Up to 298 conditions per place. [2024-06-14 15:10:59,523 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 66 selfloop transitions, 40 changer transitions 0/109 dead transitions. [2024-06-14 15:10:59,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 109 transitions, 1134 flow [2024-06-14 15:10:59,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:10:59,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:10:59,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-14 15:10:59,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4097222222222222 [2024-06-14 15:10:59,525 INFO L175 Difference]: Start difference. First operand has 105 places, 88 transitions, 678 flow. Second operand 9 states and 118 transitions. [2024-06-14 15:10:59,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 109 transitions, 1134 flow [2024-06-14 15:10:59,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 109 transitions, 1048 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-14 15:10:59,535 INFO L231 Difference]: Finished difference. Result has 105 places, 94 transitions, 771 flow [2024-06-14 15:10:59,535 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=771, PETRI_PLACES=105, PETRI_TRANSITIONS=94} [2024-06-14 15:10:59,535 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 74 predicate places. [2024-06-14 15:10:59,536 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 94 transitions, 771 flow [2024-06-14 15:10:59,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:10:59,536 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:10:59,536 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:10:59,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-14 15:10:59,536 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 15:10:59,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:10:59,537 INFO L85 PathProgramCache]: Analyzing trace with hash 201441361, now seen corresponding path program 3 times [2024-06-14 15:10:59,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:10:59,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136724417] [2024-06-14 15:10:59,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:10:59,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:10:59,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:11:04,871 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 15:11:04,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:11:04,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136724417] [2024-06-14 15:11:04,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136724417] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:11:04,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:11:04,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:11:04,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131476254] [2024-06-14 15:11:04,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:11:04,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:11:04,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:11:04,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:11:04,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:11:05,015 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:11:05,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 94 transitions, 771 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:11:05,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:11:05,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:11:05,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:11:05,278 INFO L124 PetriNetUnfolderBase]: 248/477 cut-off events. [2024-06-14 15:11:05,278 INFO L125 PetriNetUnfolderBase]: For 11192/11194 co-relation queries the response was YES. [2024-06-14 15:11:05,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2655 conditions, 477 events. 248/477 cut-off events. For 11192/11194 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2071 event pairs, 47 based on Foata normal form. 4/480 useless extension candidates. Maximal degree in co-relation 2604. Up to 304 conditions per place. [2024-06-14 15:11:05,283 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 73 selfloop transitions, 36 changer transitions 0/112 dead transitions. [2024-06-14 15:11:05,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 112 transitions, 1136 flow [2024-06-14 15:11:05,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:11:05,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:11:05,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-14 15:11:05,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4131944444444444 [2024-06-14 15:11:05,285 INFO L175 Difference]: Start difference. First operand has 105 places, 94 transitions, 771 flow. Second operand 9 states and 119 transitions. [2024-06-14 15:11:05,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 112 transitions, 1136 flow [2024-06-14 15:11:05,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 112 transitions, 1071 flow, removed 16 selfloop flow, removed 4 redundant places. [2024-06-14 15:11:05,297 INFO L231 Difference]: Finished difference. Result has 110 places, 96 transitions, 817 flow [2024-06-14 15:11:05,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=708, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=817, PETRI_PLACES=110, PETRI_TRANSITIONS=96} [2024-06-14 15:11:05,299 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 79 predicate places. [2024-06-14 15:11:05,299 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 96 transitions, 817 flow [2024-06-14 15:11:05,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:11:05,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:11:05,300 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:11:05,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-14 15:11:05,300 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 15:11:05,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:11:05,300 INFO L85 PathProgramCache]: Analyzing trace with hash 437625091, now seen corresponding path program 4 times [2024-06-14 15:11:05,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:11:05,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344029585] [2024-06-14 15:11:05,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:11:05,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:11:05,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:11:10,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:11:10,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:11:10,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344029585] [2024-06-14 15:11:10,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344029585] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:11:10,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:11:10,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:11:10,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798937253] [2024-06-14 15:11:10,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:11:10,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:11:10,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:11:10,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:11:10,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:11:10,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:11:10,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 96 transitions, 817 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:11:10,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:11:10,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:11:10,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:11:10,943 INFO L124 PetriNetUnfolderBase]: 244/461 cut-off events. [2024-06-14 15:11:10,943 INFO L125 PetriNetUnfolderBase]: For 10949/10951 co-relation queries the response was YES. [2024-06-14 15:11:10,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2624 conditions, 461 events. 244/461 cut-off events. For 10949/10951 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1927 event pairs, 42 based on Foata normal form. 2/462 useless extension candidates. Maximal degree in co-relation 2571. Up to 413 conditions per place. [2024-06-14 15:11:10,948 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 89 selfloop transitions, 14 changer transitions 0/106 dead transitions. [2024-06-14 15:11:10,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 106 transitions, 1051 flow [2024-06-14 15:11:10,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:11:10,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:11:10,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-14 15:11:10,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3680555555555556 [2024-06-14 15:11:10,949 INFO L175 Difference]: Start difference. First operand has 110 places, 96 transitions, 817 flow. Second operand 9 states and 106 transitions. [2024-06-14 15:11:10,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 106 transitions, 1051 flow [2024-06-14 15:11:10,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 106 transitions, 952 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-06-14 15:11:10,962 INFO L231 Difference]: Finished difference. Result has 113 places, 96 transitions, 751 flow [2024-06-14 15:11:10,963 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=751, PETRI_PLACES=113, PETRI_TRANSITIONS=96} [2024-06-14 15:11:10,963 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 82 predicate places. [2024-06-14 15:11:10,963 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 96 transitions, 751 flow [2024-06-14 15:11:10,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:11:10,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:11:10,964 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:11:10,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-14 15:11:10,964 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 15:11:10,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:11:10,964 INFO L85 PathProgramCache]: Analyzing trace with hash 429342511, now seen corresponding path program 5 times [2024-06-14 15:11:10,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:11:10,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048749830] [2024-06-14 15:11:10,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:11:10,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:11:10,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:11:16,384 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 15:11:16,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:11:16,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048749830] [2024-06-14 15:11:16,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048749830] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:11:16,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:11:16,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:11:16,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830726981] [2024-06-14 15:11:16,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:11:16,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:11:16,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:11:16,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:11:16,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:11:16,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:11:16,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 96 transitions, 751 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:11:16,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:11:16,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:11:16,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:11:16,778 INFO L124 PetriNetUnfolderBase]: 240/459 cut-off events. [2024-06-14 15:11:16,778 INFO L125 PetriNetUnfolderBase]: For 10529/10531 co-relation queries the response was YES. [2024-06-14 15:11:16,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2469 conditions, 459 events. 240/459 cut-off events. For 10529/10531 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1948 event pairs, 41 based on Foata normal form. 4/462 useless extension candidates. Maximal degree in co-relation 2415. Up to 298 conditions per place. [2024-06-14 15:11:16,791 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 69 selfloop transitions, 38 changer transitions 0/110 dead transitions. [2024-06-14 15:11:16,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 110 transitions, 1017 flow [2024-06-14 15:11:16,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:11:16,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:11:16,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-14 15:11:16,800 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-14 15:11:16,800 INFO L175 Difference]: Start difference. First operand has 113 places, 96 transitions, 751 flow. Second operand 9 states and 117 transitions. [2024-06-14 15:11:16,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 110 transitions, 1017 flow [2024-06-14 15:11:16,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 110 transitions, 962 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-14 15:11:16,818 INFO L231 Difference]: Finished difference. Result has 114 places, 96 transitions, 777 flow [2024-06-14 15:11:16,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=777, PETRI_PLACES=114, PETRI_TRANSITIONS=96} [2024-06-14 15:11:16,819 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 83 predicate places. [2024-06-14 15:11:16,819 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 96 transitions, 777 flow [2024-06-14 15:11:16,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:11:16,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:11:16,819 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:11:16,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-14 15:11:16,820 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 15:11:16,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:11:16,820 INFO L85 PathProgramCache]: Analyzing trace with hash 437924303, now seen corresponding path program 1 times [2024-06-14 15:11:16,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:11:16,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186990980] [2024-06-14 15:11:16,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:11:16,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:11:16,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:11:23,050 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 15:11:23,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:11:23,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186990980] [2024-06-14 15:11:23,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186990980] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:11:23,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:11:23,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:11:23,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382540498] [2024-06-14 15:11:23,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:11:23,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:11:23,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:11:23,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:11:23,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:11:23,180 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:11:23,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 96 transitions, 777 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:11:23,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:11:23,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:11:23,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:11:23,402 INFO L124 PetriNetUnfolderBase]: 237/456 cut-off events. [2024-06-14 15:11:23,403 INFO L125 PetriNetUnfolderBase]: For 10363/10365 co-relation queries the response was YES. [2024-06-14 15:11:23,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2448 conditions, 456 events. 237/456 cut-off events. For 10363/10365 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1938 event pairs, 45 based on Foata normal form. 2/457 useless extension candidates. Maximal degree in co-relation 2393. Up to 399 conditions per place. [2024-06-14 15:11:23,406 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 89 selfloop transitions, 15 changer transitions 0/107 dead transitions. [2024-06-14 15:11:23,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 107 transitions, 1011 flow [2024-06-14 15:11:23,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:11:23,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:11:23,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2024-06-14 15:11:23,407 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35625 [2024-06-14 15:11:23,407 INFO L175 Difference]: Start difference. First operand has 114 places, 96 transitions, 777 flow. Second operand 10 states and 114 transitions. [2024-06-14 15:11:23,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 107 transitions, 1011 flow [2024-06-14 15:11:23,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 107 transitions, 901 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-14 15:11:23,419 INFO L231 Difference]: Finished difference. Result has 115 places, 96 transitions, 701 flow [2024-06-14 15:11:23,420 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=667, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=701, PETRI_PLACES=115, PETRI_TRANSITIONS=96} [2024-06-14 15:11:23,420 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 84 predicate places. [2024-06-14 15:11:23,420 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 96 transitions, 701 flow [2024-06-14 15:11:23,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:11:23,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:11:23,421 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 15:11:23,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-14 15:11:23,421 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 15:11:23,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:11:23,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1212495991, now seen corresponding path program 1 times [2024-06-14 15:11:23,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:11:23,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652466837] [2024-06-14 15:11:23,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:11:23,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:11:23,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:11:28,737 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 15:11:28,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:11:28,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652466837] [2024-06-14 15:11:28,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652466837] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:11:28,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:11:28,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:11:28,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913507210] [2024-06-14 15:11:28,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:11:28,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:11:28,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:11:28,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:11:28,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:11:28,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:11:28,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 96 transitions, 701 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:11:28,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:11:28,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:11:28,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:11:29,233 INFO L124 PetriNetUnfolderBase]: 241/457 cut-off events. [2024-06-14 15:11:29,233 INFO L125 PetriNetUnfolderBase]: For 10738/10738 co-relation queries the response was YES. [2024-06-14 15:11:29,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2424 conditions, 457 events. 241/457 cut-off events. For 10738/10738 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1904 event pairs, 16 based on Foata normal form. 2/458 useless extension candidates. Maximal degree in co-relation 2368. Up to 361 conditions per place. [2024-06-14 15:11:29,236 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 94 selfloop transitions, 17 changer transitions 0/114 dead transitions. [2024-06-14 15:11:29,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 114 transitions, 981 flow [2024-06-14 15:11:29,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:11:29,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:11:29,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2024-06-14 15:11:29,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3819444444444444 [2024-06-14 15:11:29,238 INFO L175 Difference]: Start difference. First operand has 115 places, 96 transitions, 701 flow. Second operand 9 states and 110 transitions. [2024-06-14 15:11:29,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 114 transitions, 981 flow [2024-06-14 15:11:29,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 114 transitions, 943 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-14 15:11:29,251 INFO L231 Difference]: Finished difference. Result has 116 places, 97 transitions, 715 flow [2024-06-14 15:11:29,251 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=663, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=715, PETRI_PLACES=116, PETRI_TRANSITIONS=97} [2024-06-14 15:11:29,251 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 85 predicate places. [2024-06-14 15:11:29,251 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 97 transitions, 715 flow [2024-06-14 15:11:29,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:11:29,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:11:29,252 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 15:11:29,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-14 15:11:29,252 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 15:11:29,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:11:29,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1626321753, now seen corresponding path program 2 times [2024-06-14 15:11:29,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:11:29,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802285260] [2024-06-14 15:11:29,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:11:29,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:11:29,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:11:35,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 15:11:35,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:11:35,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802285260] [2024-06-14 15:11:35,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802285260] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:11:35,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:11:35,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:11:35,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721459293] [2024-06-14 15:11:35,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:11:35,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:11:35,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:11:35,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:11:35,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:11:35,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:11:35,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 97 transitions, 715 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:11:35,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:11:35,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:11:35,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:11:35,716 INFO L124 PetriNetUnfolderBase]: 245/465 cut-off events. [2024-06-14 15:11:35,717 INFO L125 PetriNetUnfolderBase]: For 11425/11425 co-relation queries the response was YES. [2024-06-14 15:11:35,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2493 conditions, 465 events. 245/465 cut-off events. For 11425/11425 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1970 event pairs, 37 based on Foata normal form. 2/466 useless extension candidates. Maximal degree in co-relation 2436. Up to 387 conditions per place. [2024-06-14 15:11:35,720 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 87 selfloop transitions, 23 changer transitions 0/113 dead transitions. [2024-06-14 15:11:35,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 113 transitions, 991 flow [2024-06-14 15:11:35,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:11:35,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:11:35,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2024-06-14 15:11:35,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-14 15:11:35,741 INFO L175 Difference]: Start difference. First operand has 116 places, 97 transitions, 715 flow. Second operand 9 states and 120 transitions. [2024-06-14 15:11:35,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 113 transitions, 991 flow [2024-06-14 15:11:35,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 113 transitions, 949 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-14 15:11:35,753 INFO L231 Difference]: Finished difference. Result has 118 places, 98 transitions, 740 flow [2024-06-14 15:11:35,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=740, PETRI_PLACES=118, PETRI_TRANSITIONS=98} [2024-06-14 15:11:35,754 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 87 predicate places. [2024-06-14 15:11:35,754 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 98 transitions, 740 flow [2024-06-14 15:11:35,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:11:35,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:11:35,755 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 15:11:35,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-14 15:11:35,755 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 15:11:35,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:11:35,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1123930231, now seen corresponding path program 3 times [2024-06-14 15:11:35,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:11:35,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358019980] [2024-06-14 15:11:35,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:11:35,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:11:35,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:11:41,434 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 15:11:41,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:11:41,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358019980] [2024-06-14 15:11:41,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358019980] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:11:41,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:11:41,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:11:41,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440680842] [2024-06-14 15:11:41,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:11:41,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:11:41,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:11:41,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:11:41,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:11:41,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:11:41,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 98 transitions, 740 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:11:41,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:11:41,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:11:41,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:11:41,825 INFO L124 PetriNetUnfolderBase]: 249/473 cut-off events. [2024-06-14 15:11:41,826 INFO L125 PetriNetUnfolderBase]: For 12361/12361 co-relation queries the response was YES. [2024-06-14 15:11:41,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2559 conditions, 473 events. 249/473 cut-off events. For 12361/12361 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2021 event pairs, 35 based on Foata normal form. 2/474 useless extension candidates. Maximal degree in co-relation 2501. Up to 379 conditions per place. [2024-06-14 15:11:41,829 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 89 selfloop transitions, 23 changer transitions 0/115 dead transitions. [2024-06-14 15:11:41,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 115 transitions, 1024 flow [2024-06-14 15:11:41,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:11:41,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:11:41,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-14 15:11:41,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3923611111111111 [2024-06-14 15:11:41,831 INFO L175 Difference]: Start difference. First operand has 118 places, 98 transitions, 740 flow. Second operand 9 states and 113 transitions. [2024-06-14 15:11:41,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 115 transitions, 1024 flow [2024-06-14 15:11:41,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 115 transitions, 969 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-14 15:11:41,846 INFO L231 Difference]: Finished difference. Result has 120 places, 99 transitions, 753 flow [2024-06-14 15:11:41,846 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=753, PETRI_PLACES=120, PETRI_TRANSITIONS=99} [2024-06-14 15:11:41,846 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 89 predicate places. [2024-06-14 15:11:41,846 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 99 transitions, 753 flow [2024-06-14 15:11:41,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:11:41,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:11:41,847 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 15:11:41,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-14 15:11:41,847 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 15:11:41,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:11:41,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1123776409, now seen corresponding path program 1 times [2024-06-14 15:11:41,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:11:41,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260662862] [2024-06-14 15:11:41,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:11:41,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:11:41,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:11:47,270 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 15:11:47,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:11:47,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260662862] [2024-06-14 15:11:47,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260662862] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:11:47,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:11:47,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:11:47,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63291385] [2024-06-14 15:11:47,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:11:47,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:11:47,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:11:47,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:11:47,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:11:47,394 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:11:47,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 99 transitions, 753 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:11:47,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:11:47,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:11:47,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:11:47,691 INFO L124 PetriNetUnfolderBase]: 247/470 cut-off events. [2024-06-14 15:11:47,691 INFO L125 PetriNetUnfolderBase]: For 11891/11891 co-relation queries the response was YES. [2024-06-14 15:11:47,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2518 conditions, 470 events. 247/470 cut-off events. For 11891/11891 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2000 event pairs, 36 based on Foata normal form. 1/470 useless extension candidates. Maximal degree in co-relation 2459. Up to 392 conditions per place. [2024-06-14 15:11:47,695 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 87 selfloop transitions, 26 changer transitions 0/116 dead transitions. [2024-06-14 15:11:47,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 116 transitions, 1055 flow [2024-06-14 15:11:47,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:11:47,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:11:47,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2024-06-14 15:11:47,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.378125 [2024-06-14 15:11:47,696 INFO L175 Difference]: Start difference. First operand has 120 places, 99 transitions, 753 flow. Second operand 10 states and 121 transitions. [2024-06-14 15:11:47,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 116 transitions, 1055 flow [2024-06-14 15:11:47,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 116 transitions, 997 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-14 15:11:47,712 INFO L231 Difference]: Finished difference. Result has 123 places, 101 transitions, 790 flow [2024-06-14 15:11:47,712 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=790, PETRI_PLACES=123, PETRI_TRANSITIONS=101} [2024-06-14 15:11:47,712 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 92 predicate places. [2024-06-14 15:11:47,712 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 101 transitions, 790 flow [2024-06-14 15:11:47,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:11:47,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:11:47,713 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 15:11:47,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-14 15:11:47,713 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 15:11:47,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:11:47,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1844723387, now seen corresponding path program 4 times [2024-06-14 15:11:47,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:11:47,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836730136] [2024-06-14 15:11:47,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:11:47,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:11:47,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:11:53,553 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 15:11:53,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:11:53,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836730136] [2024-06-14 15:11:53,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836730136] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:11:53,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:11:53,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:11:53,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163951253] [2024-06-14 15:11:53,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:11:53,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:11:53,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:11:53,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:11:53,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:11:53,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:11:53,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 101 transitions, 790 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:11:53,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:11:53,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:11:53,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:11:54,033 INFO L124 PetriNetUnfolderBase]: 254/485 cut-off events. [2024-06-14 15:11:54,034 INFO L125 PetriNetUnfolderBase]: For 13109/13109 co-relation queries the response was YES. [2024-06-14 15:11:54,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2608 conditions, 485 events. 254/485 cut-off events. For 13109/13109 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2095 event pairs, 38 based on Foata normal form. 2/486 useless extension candidates. Maximal degree in co-relation 2548. Up to 420 conditions per place. [2024-06-14 15:11:54,037 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 97 selfloop transitions, 18 changer transitions 0/118 dead transitions. [2024-06-14 15:11:54,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 118 transitions, 1095 flow [2024-06-14 15:11:54,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:11:54,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:11:54,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2024-06-14 15:11:54,062 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3819444444444444 [2024-06-14 15:11:54,062 INFO L175 Difference]: Start difference. First operand has 123 places, 101 transitions, 790 flow. Second operand 9 states and 110 transitions. [2024-06-14 15:11:54,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 118 transitions, 1095 flow [2024-06-14 15:11:54,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 118 transitions, 1016 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-14 15:11:54,078 INFO L231 Difference]: Finished difference. Result has 125 places, 105 transitions, 799 flow [2024-06-14 15:11:54,078 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=711, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=799, PETRI_PLACES=125, PETRI_TRANSITIONS=105} [2024-06-14 15:11:54,079 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 94 predicate places. [2024-06-14 15:11:54,079 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 105 transitions, 799 flow [2024-06-14 15:11:54,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:11:54,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:11:54,080 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 15:11:54,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-14 15:11:54,080 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 15:11:54,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:11:54,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1844871257, now seen corresponding path program 5 times [2024-06-14 15:11:54,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:11:54,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565288784] [2024-06-14 15:11:54,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:11:54,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:11:54,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:11:59,486 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 15:11:59,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:11:59,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565288784] [2024-06-14 15:11:59,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565288784] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:11:59,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:11:59,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:11:59,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589202831] [2024-06-14 15:11:59,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:11:59,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:11:59,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:11:59,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:11:59,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:11:59,624 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:11:59,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 105 transitions, 799 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:11:59,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:11:59,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:11:59,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:11:59,948 INFO L124 PetriNetUnfolderBase]: 265/509 cut-off events. [2024-06-14 15:11:59,948 INFO L125 PetriNetUnfolderBase]: For 15447/15449 co-relation queries the response was YES. [2024-06-14 15:11:59,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2806 conditions, 509 events. 265/509 cut-off events. For 15447/15449 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2265 event pairs, 41 based on Foata normal form. 2/510 useless extension candidates. Maximal degree in co-relation 2744. Up to 388 conditions per place. [2024-06-14 15:11:59,952 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 88 selfloop transitions, 30 changer transitions 0/121 dead transitions. [2024-06-14 15:11:59,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 121 transitions, 1181 flow [2024-06-14 15:11:59,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:11:59,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:11:59,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-14 15:11:59,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-14 15:11:59,979 INFO L175 Difference]: Start difference. First operand has 125 places, 105 transitions, 799 flow. Second operand 9 states and 114 transitions. [2024-06-14 15:11:59,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 121 transitions, 1181 flow [2024-06-14 15:12:00,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 121 transitions, 1132 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-14 15:12:00,004 INFO L231 Difference]: Finished difference. Result has 129 places, 107 transitions, 856 flow [2024-06-14 15:12:00,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=856, PETRI_PLACES=129, PETRI_TRANSITIONS=107} [2024-06-14 15:12:00,005 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 98 predicate places. [2024-06-14 15:12:00,005 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 107 transitions, 856 flow [2024-06-14 15:12:00,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:12:00,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:12:00,005 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 15:12:00,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-14 15:12:00,006 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:12:00,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:12:00,006 INFO L85 PathProgramCache]: Analyzing trace with hash 92031911, now seen corresponding path program 6 times [2024-06-14 15:12:00,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:12:00,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566684204] [2024-06-14 15:12:00,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:12:00,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:12:00,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:12:05,875 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 15:12:05,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:12:05,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566684204] [2024-06-14 15:12:05,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566684204] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:12:05,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:12:05,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:12:05,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253172174] [2024-06-14 15:12:05,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:12:05,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:12:05,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:12:05,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:12:05,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:12:05,968 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:12:05,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 107 transitions, 856 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:12:05,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:12:05,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:12:05,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:12:06,247 INFO L124 PetriNetUnfolderBase]: 262/505 cut-off events. [2024-06-14 15:12:06,247 INFO L125 PetriNetUnfolderBase]: For 14922/14922 co-relation queries the response was YES. [2024-06-14 15:12:06,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2730 conditions, 505 events. 262/505 cut-off events. For 14922/14922 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2236 event pairs, 40 based on Foata normal form. 2/506 useless extension candidates. Maximal degree in co-relation 2668. Up to 436 conditions per place. [2024-06-14 15:12:06,251 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 99 selfloop transitions, 18 changer transitions 0/120 dead transitions. [2024-06-14 15:12:06,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 120 transitions, 1126 flow [2024-06-14 15:12:06,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:12:06,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:12:06,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2024-06-14 15:12:06,253 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3819444444444444 [2024-06-14 15:12:06,253 INFO L175 Difference]: Start difference. First operand has 129 places, 107 transitions, 856 flow. Second operand 9 states and 110 transitions. [2024-06-14 15:12:06,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 120 transitions, 1126 flow [2024-06-14 15:12:06,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 120 transitions, 1057 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-14 15:12:06,276 INFO L231 Difference]: Finished difference. Result has 133 places, 107 transitions, 827 flow [2024-06-14 15:12:06,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=787, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=827, PETRI_PLACES=133, PETRI_TRANSITIONS=107} [2024-06-14 15:12:06,277 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 102 predicate places. [2024-06-14 15:12:06,278 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 107 transitions, 827 flow [2024-06-14 15:12:06,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:12:06,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:12:06,278 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 15:12:06,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-14 15:12:06,278 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:12:06,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:12:06,279 INFO L85 PathProgramCache]: Analyzing trace with hash 997794548, now seen corresponding path program 1 times [2024-06-14 15:12:06,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:12:06,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375087675] [2024-06-14 15:12:06,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:12:06,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:12:06,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:12:12,640 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 15:12:12,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:12:12,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375087675] [2024-06-14 15:12:12,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375087675] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:12:12,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:12:12,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:12:12,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331275169] [2024-06-14 15:12:12,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:12:12,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:12:12,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:12:12,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:12:12,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:12:12,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:12:12,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 107 transitions, 827 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:12:12,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:12:12,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:12:12,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:12:13,115 INFO L124 PetriNetUnfolderBase]: 268/513 cut-off events. [2024-06-14 15:12:13,116 INFO L125 PetriNetUnfolderBase]: For 15390/15390 co-relation queries the response was YES. [2024-06-14 15:12:13,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2760 conditions, 513 events. 268/513 cut-off events. For 15390/15390 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2282 event pairs, 37 based on Foata normal form. 2/514 useless extension candidates. Maximal degree in co-relation 2696. Up to 428 conditions per place. [2024-06-14 15:12:13,119 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 99 selfloop transitions, 23 changer transitions 0/125 dead transitions. [2024-06-14 15:12:13,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 125 transitions, 1157 flow [2024-06-14 15:12:13,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:12:13,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:12:13,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-14 15:12:13,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.384375 [2024-06-14 15:12:13,122 INFO L175 Difference]: Start difference. First operand has 133 places, 107 transitions, 827 flow. Second operand 10 states and 123 transitions. [2024-06-14 15:12:13,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 125 transitions, 1157 flow [2024-06-14 15:12:13,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 125 transitions, 1111 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-14 15:12:13,148 INFO L231 Difference]: Finished difference. Result has 135 places, 110 transitions, 877 flow [2024-06-14 15:12:13,148 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=877, PETRI_PLACES=135, PETRI_TRANSITIONS=110} [2024-06-14 15:12:13,148 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 104 predicate places. [2024-06-14 15:12:13,149 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 110 transitions, 877 flow [2024-06-14 15:12:13,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:12:13,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:12:13,149 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 15:12:13,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-14 15:12:13,149 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:12:13,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:12:13,150 INFO L85 PathProgramCache]: Analyzing trace with hash 424501367, now seen corresponding path program 7 times [2024-06-14 15:12:13,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:12:13,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578416557] [2024-06-14 15:12:13,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:12:13,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:12:13,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:12:18,669 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 15:12:18,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:12:18,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578416557] [2024-06-14 15:12:18,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578416557] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:12:18,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:12:18,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:12:18,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785227258] [2024-06-14 15:12:18,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:12:18,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:12:18,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:12:18,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:12:18,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:12:18,814 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:12:18,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 110 transitions, 877 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:12:18,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:12:18,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:12:18,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:12:19,114 INFO L124 PetriNetUnfolderBase]: 272/520 cut-off events. [2024-06-14 15:12:19,115 INFO L125 PetriNetUnfolderBase]: For 16368/16370 co-relation queries the response was YES. [2024-06-14 15:12:19,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2894 conditions, 520 events. 272/520 cut-off events. For 16368/16370 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2309 event pairs, 40 based on Foata normal form. 4/523 useless extension candidates. Maximal degree in co-relation 2829. Up to 428 conditions per place. [2024-06-14 15:12:19,118 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 90 selfloop transitions, 29 changer transitions 0/122 dead transitions. [2024-06-14 15:12:19,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 122 transitions, 1167 flow [2024-06-14 15:12:19,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:12:19,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:12:19,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2024-06-14 15:12:19,120 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3819444444444444 [2024-06-14 15:12:19,120 INFO L175 Difference]: Start difference. First operand has 135 places, 110 transitions, 877 flow. Second operand 9 states and 110 transitions. [2024-06-14 15:12:19,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 122 transitions, 1167 flow [2024-06-14 15:12:19,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 122 transitions, 1093 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-06-14 15:12:19,146 INFO L231 Difference]: Finished difference. Result has 136 places, 111 transitions, 889 flow [2024-06-14 15:12:19,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=889, PETRI_PLACES=136, PETRI_TRANSITIONS=111} [2024-06-14 15:12:19,148 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 105 predicate places. [2024-06-14 15:12:19,148 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 111 transitions, 889 flow [2024-06-14 15:12:19,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:12:19,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:12:19,148 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 15:12:19,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-14 15:12:19,149 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:12:19,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:12:19,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1596666291, now seen corresponding path program 8 times [2024-06-14 15:12:19,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:12:19,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759465116] [2024-06-14 15:12:19,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:12:19,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:12:19,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:12:23,990 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 15:12:23,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:12:23,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759465116] [2024-06-14 15:12:23,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759465116] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:12:23,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:12:23,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:12:23,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480715139] [2024-06-14 15:12:23,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:12:23,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:12:23,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:12:23,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:12:23,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:12:24,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:12:24,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 111 transitions, 889 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:12:24,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:12:24,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:12:24,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:12:24,488 INFO L124 PetriNetUnfolderBase]: 279/541 cut-off events. [2024-06-14 15:12:24,489 INFO L125 PetriNetUnfolderBase]: For 17332/17334 co-relation queries the response was YES. [2024-06-14 15:12:24,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2996 conditions, 541 events. 279/541 cut-off events. For 17332/17334 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2483 event pairs, 46 based on Foata normal form. 4/544 useless extension candidates. Maximal degree in co-relation 2930. Up to 440 conditions per place. [2024-06-14 15:12:24,493 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 92 selfloop transitions, 30 changer transitions 0/125 dead transitions. [2024-06-14 15:12:24,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 125 transitions, 1207 flow [2024-06-14 15:12:24,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:12:24,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:12:24,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-14 15:12:24,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2024-06-14 15:12:24,495 INFO L175 Difference]: Start difference. First operand has 136 places, 111 transitions, 889 flow. Second operand 9 states and 111 transitions. [2024-06-14 15:12:24,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 125 transitions, 1207 flow [2024-06-14 15:12:24,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 125 transitions, 1127 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-14 15:12:24,522 INFO L231 Difference]: Finished difference. Result has 138 places, 114 transitions, 919 flow [2024-06-14 15:12:24,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=813, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=919, PETRI_PLACES=138, PETRI_TRANSITIONS=114} [2024-06-14 15:12:24,525 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 107 predicate places. [2024-06-14 15:12:24,525 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 114 transitions, 919 flow [2024-06-14 15:12:24,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:12:24,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:12:24,526 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 15:12:24,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-14 15:12:24,529 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:12:24,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:12:24,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1596814161, now seen corresponding path program 9 times [2024-06-14 15:12:24,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:12:24,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329220387] [2024-06-14 15:12:24,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:12:24,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:12:24,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:12:29,757 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 15:12:29,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:12:29,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329220387] [2024-06-14 15:12:29,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329220387] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:12:29,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:12:29,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:12:29,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079545324] [2024-06-14 15:12:29,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:12:29,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:12:29,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:12:29,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:12:29,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:12:29,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:12:29,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 114 transitions, 919 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:12:29,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:12:29,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:12:29,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:12:30,182 INFO L124 PetriNetUnfolderBase]: 283/545 cut-off events. [2024-06-14 15:12:30,182 INFO L125 PetriNetUnfolderBase]: For 18264/18266 co-relation queries the response was YES. [2024-06-14 15:12:30,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3045 conditions, 545 events. 283/545 cut-off events. For 18264/18266 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2501 event pairs, 42 based on Foata normal form. 4/548 useless extension candidates. Maximal degree in co-relation 2978. Up to 419 conditions per place. [2024-06-14 15:12:30,186 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 92 selfloop transitions, 33 changer transitions 0/128 dead transitions. [2024-06-14 15:12:30,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 128 transitions, 1311 flow [2024-06-14 15:12:30,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:12:30,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:12:30,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-14 15:12:30,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3923611111111111 [2024-06-14 15:12:30,189 INFO L175 Difference]: Start difference. First operand has 138 places, 114 transitions, 919 flow. Second operand 9 states and 113 transitions. [2024-06-14 15:12:30,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 128 transitions, 1311 flow [2024-06-14 15:12:30,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 128 transitions, 1239 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-06-14 15:12:30,218 INFO L231 Difference]: Finished difference. Result has 142 places, 115 transitions, 943 flow [2024-06-14 15:12:30,218 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=847, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=943, PETRI_PLACES=142, PETRI_TRANSITIONS=115} [2024-06-14 15:12:30,219 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 111 predicate places. [2024-06-14 15:12:30,219 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 115 transitions, 943 flow [2024-06-14 15:12:30,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:12:30,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:12:30,219 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 15:12:30,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-14 15:12:30,220 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:12:30,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:12:30,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1949500309, now seen corresponding path program 10 times [2024-06-14 15:12:30,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:12:30,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888682791] [2024-06-14 15:12:30,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:12:30,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:12:30,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:12:35,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:12:35,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:12:35,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888682791] [2024-06-14 15:12:35,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888682791] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:12:35,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:12:35,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:12:35,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866911884] [2024-06-14 15:12:35,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:12:35,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:12:35,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:12:35,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:12:35,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:12:35,794 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:12:35,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 115 transitions, 943 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:12:35,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:12:35,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:12:35,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:12:36,080 INFO L124 PetriNetUnfolderBase]: 280/546 cut-off events. [2024-06-14 15:12:36,080 INFO L125 PetriNetUnfolderBase]: For 17152/17154 co-relation queries the response was YES. [2024-06-14 15:12:36,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2927 conditions, 546 events. 280/546 cut-off events. For 17152/17154 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2551 event pairs, 47 based on Foata normal form. 4/549 useless extension candidates. Maximal degree in co-relation 2860. Up to 443 conditions per place. [2024-06-14 15:12:36,084 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 94 selfloop transitions, 29 changer transitions 0/126 dead transitions. [2024-06-14 15:12:36,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 126 transitions, 1219 flow [2024-06-14 15:12:36,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:12:36,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:12:36,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2024-06-14 15:12:36,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-06-14 15:12:36,109 INFO L175 Difference]: Start difference. First operand has 142 places, 115 transitions, 943 flow. Second operand 9 states and 112 transitions. [2024-06-14 15:12:36,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 126 transitions, 1219 flow [2024-06-14 15:12:36,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 126 transitions, 1102 flow, removed 22 selfloop flow, removed 7 redundant places. [2024-06-14 15:12:36,139 INFO L231 Difference]: Finished difference. Result has 144 places, 115 transitions, 888 flow [2024-06-14 15:12:36,139 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=888, PETRI_PLACES=144, PETRI_TRANSITIONS=115} [2024-06-14 15:12:36,139 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 113 predicate places. [2024-06-14 15:12:36,139 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 115 transitions, 888 flow [2024-06-14 15:12:36,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:12:36,140 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:12:36,140 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 15:12:36,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-14 15:12:36,141 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:12:36,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:12:36,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1591088430, now seen corresponding path program 2 times [2024-06-14 15:12:36,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:12:36,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757411182] [2024-06-14 15:12:36,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:12:36,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:12:36,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:12:42,387 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 15:12:42,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:12:42,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757411182] [2024-06-14 15:12:42,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757411182] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:12:42,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:12:42,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:12:42,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730458462] [2024-06-14 15:12:42,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:12:42,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:12:42,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:12:42,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:12:42,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:12:42,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:12:42,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 115 transitions, 888 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:12:42,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:12:42,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:12:42,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:12:42,873 INFO L124 PetriNetUnfolderBase]: 286/554 cut-off events. [2024-06-14 15:12:42,873 INFO L125 PetriNetUnfolderBase]: For 17499/17501 co-relation queries the response was YES. [2024-06-14 15:12:42,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2872 conditions, 554 events. 286/554 cut-off events. For 17499/17501 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2582 event pairs, 43 based on Foata normal form. 4/557 useless extension candidates. Maximal degree in co-relation 2805. Up to 375 conditions per place. [2024-06-14 15:12:42,877 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 88 selfloop transitions, 42 changer transitions 0/133 dead transitions. [2024-06-14 15:12:42,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 133 transitions, 1254 flow [2024-06-14 15:12:42,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:12:42,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:12:42,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-14 15:12:42,878 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403125 [2024-06-14 15:12:42,879 INFO L175 Difference]: Start difference. First operand has 144 places, 115 transitions, 888 flow. Second operand 10 states and 129 transitions. [2024-06-14 15:12:42,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 133 transitions, 1254 flow [2024-06-14 15:12:42,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 133 transitions, 1124 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-14 15:12:42,906 INFO L231 Difference]: Finished difference. Result has 144 places, 118 transitions, 898 flow [2024-06-14 15:12:42,906 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=898, PETRI_PLACES=144, PETRI_TRANSITIONS=118} [2024-06-14 15:12:42,907 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 113 predicate places. [2024-06-14 15:12:42,907 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 118 transitions, 898 flow [2024-06-14 15:12:42,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:12:42,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:12:42,907 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 15:12:42,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-14 15:12:42,907 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:12:42,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:12:42,908 INFO L85 PathProgramCache]: Analyzing trace with hash 424716848, now seen corresponding path program 3 times [2024-06-14 15:12:42,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:12:42,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666375601] [2024-06-14 15:12:42,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:12:42,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:12:42,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:12:49,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:12:49,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:12:49,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666375601] [2024-06-14 15:12:49,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666375601] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:12:49,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:12:49,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:12:49,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497633554] [2024-06-14 15:12:49,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:12:49,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:12:49,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:12:49,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:12:49,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:12:49,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:12:49,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 118 transitions, 898 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:12:49,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:12:49,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:12:49,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:12:49,905 INFO L124 PetriNetUnfolderBase]: 292/560 cut-off events. [2024-06-14 15:12:49,906 INFO L125 PetriNetUnfolderBase]: For 18327/18329 co-relation queries the response was YES. [2024-06-14 15:12:49,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2947 conditions, 560 events. 292/560 cut-off events. For 18327/18329 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2583 event pairs, 41 based on Foata normal form. 4/563 useless extension candidates. Maximal degree in co-relation 2880. Up to 385 conditions per place. [2024-06-14 15:12:49,909 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 90 selfloop transitions, 43 changer transitions 0/136 dead transitions. [2024-06-14 15:12:49,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 136 transitions, 1282 flow [2024-06-14 15:12:49,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:12:49,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:12:49,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2024-06-14 15:12:49,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-14 15:12:49,911 INFO L175 Difference]: Start difference. First operand has 144 places, 118 transitions, 898 flow. Second operand 10 states and 128 transitions. [2024-06-14 15:12:49,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 136 transitions, 1282 flow [2024-06-14 15:12:49,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 136 transitions, 1166 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-06-14 15:12:49,942 INFO L231 Difference]: Finished difference. Result has 146 places, 121 transitions, 928 flow [2024-06-14 15:12:49,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=928, PETRI_PLACES=146, PETRI_TRANSITIONS=121} [2024-06-14 15:12:49,942 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 115 predicate places. [2024-06-14 15:12:49,943 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 121 transitions, 928 flow [2024-06-14 15:12:49,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:12:49,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:12:49,943 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 15:12:49,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-14 15:12:49,943 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:12:49,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:12:49,944 INFO L85 PathProgramCache]: Analyzing trace with hash 681217358, now seen corresponding path program 4 times [2024-06-14 15:12:49,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:12:49,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204470753] [2024-06-14 15:12:49,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:12:49,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:12:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:12:56,482 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 15:12:56,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:12:56,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204470753] [2024-06-14 15:12:56,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204470753] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:12:56,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:12:56,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:12:56,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412289584] [2024-06-14 15:12:56,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:12:56,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:12:56,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:12:56,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:12:56,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:12:56,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:12:56,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 121 transitions, 928 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:12:56,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:12:56,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:12:56,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:12:56,918 INFO L124 PetriNetUnfolderBase]: 298/570 cut-off events. [2024-06-14 15:12:56,918 INFO L125 PetriNetUnfolderBase]: For 19281/19283 co-relation queries the response was YES. [2024-06-14 15:12:56,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3062 conditions, 570 events. 298/570 cut-off events. For 19281/19283 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2634 event pairs, 41 based on Foata normal form. 4/573 useless extension candidates. Maximal degree in co-relation 2994. Up to 395 conditions per place. [2024-06-14 15:12:56,922 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 86 selfloop transitions, 49 changer transitions 0/138 dead transitions. [2024-06-14 15:12:56,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 138 transitions, 1318 flow [2024-06-14 15:12:56,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:12:56,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:12:56,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-14 15:12:56,924 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.396875 [2024-06-14 15:12:56,924 INFO L175 Difference]: Start difference. First operand has 146 places, 121 transitions, 928 flow. Second operand 10 states and 127 transitions. [2024-06-14 15:12:56,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 138 transitions, 1318 flow [2024-06-14 15:12:56,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 138 transitions, 1194 flow, removed 21 selfloop flow, removed 8 redundant places. [2024-06-14 15:12:56,954 INFO L231 Difference]: Finished difference. Result has 148 places, 124 transitions, 968 flow [2024-06-14 15:12:56,954 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=968, PETRI_PLACES=148, PETRI_TRANSITIONS=124} [2024-06-14 15:12:56,955 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 117 predicate places. [2024-06-14 15:12:56,955 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 124 transitions, 968 flow [2024-06-14 15:12:56,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:12:56,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:12:56,956 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 15:12:56,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-14 15:12:56,960 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:12:56,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:12:56,960 INFO L85 PathProgramCache]: Analyzing trace with hash 432126158, now seen corresponding path program 5 times [2024-06-14 15:12:56,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:12:56,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102221462] [2024-06-14 15:12:56,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:12:56,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:12:57,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:13:03,335 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 15:13:03,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:13:03,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102221462] [2024-06-14 15:13:03,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102221462] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:13:03,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:13:03,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:13:03,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572835094] [2024-06-14 15:13:03,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:13:03,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:13:03,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:13:03,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:13:03,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:13:03,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:13:03,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 124 transitions, 968 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:13:03,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:13:03,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:13:03,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:13:03,870 INFO L124 PetriNetUnfolderBase]: 301/573 cut-off events. [2024-06-14 15:13:03,870 INFO L125 PetriNetUnfolderBase]: For 18962/18964 co-relation queries the response was YES. [2024-06-14 15:13:03,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3133 conditions, 573 events. 301/573 cut-off events. For 18962/18964 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2638 event pairs, 44 based on Foata normal form. 1/573 useless extension candidates. Maximal degree in co-relation 3064. Up to 521 conditions per place. [2024-06-14 15:13:03,874 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 119 selfloop transitions, 16 changer transitions 0/138 dead transitions. [2024-06-14 15:13:03,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 138 transitions, 1309 flow [2024-06-14 15:13:03,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:13:03,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:13:03,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-14 15:13:03,875 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.359375 [2024-06-14 15:13:03,875 INFO L175 Difference]: Start difference. First operand has 148 places, 124 transitions, 968 flow. Second operand 10 states and 115 transitions. [2024-06-14 15:13:03,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 138 transitions, 1309 flow [2024-06-14 15:13:03,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 138 transitions, 1165 flow, removed 24 selfloop flow, removed 8 redundant places. [2024-06-14 15:13:03,907 INFO L231 Difference]: Finished difference. Result has 151 places, 128 transitions, 917 flow [2024-06-14 15:13:03,907 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=917, PETRI_PLACES=151, PETRI_TRANSITIONS=128} [2024-06-14 15:13:03,907 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 120 predicate places. [2024-06-14 15:13:03,908 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 128 transitions, 917 flow [2024-06-14 15:13:03,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:13:03,908 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:13:03,908 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 15:13:03,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-14 15:13:03,908 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:13:03,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:13:03,909 INFO L85 PathProgramCache]: Analyzing trace with hash 690740558, now seen corresponding path program 6 times [2024-06-14 15:13:03,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:13:03,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494387555] [2024-06-14 15:13:03,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:13:03,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:13:03,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:13:10,006 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 15:13:10,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:13:10,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494387555] [2024-06-14 15:13:10,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494387555] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:13:10,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:13:10,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:13:10,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711023025] [2024-06-14 15:13:10,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:13:10,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:13:10,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:13:10,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:13:10,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:13:10,209 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:13:10,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 128 transitions, 917 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:13:10,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:13:10,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:13:10,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:13:10,514 INFO L124 PetriNetUnfolderBase]: 299/572 cut-off events. [2024-06-14 15:13:10,514 INFO L125 PetriNetUnfolderBase]: For 18352/18354 co-relation queries the response was YES. [2024-06-14 15:13:10,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3001 conditions, 572 events. 299/572 cut-off events. For 18352/18354 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2636 event pairs, 46 based on Foata normal form. 1/572 useless extension candidates. Maximal degree in co-relation 2930. Up to 512 conditions per place. [2024-06-14 15:13:10,519 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 118 selfloop transitions, 20 changer transitions 0/141 dead transitions. [2024-06-14 15:13:10,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 141 transitions, 1249 flow [2024-06-14 15:13:10,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:13:10,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:13:10,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 126 transitions. [2024-06-14 15:13:10,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35795454545454547 [2024-06-14 15:13:10,520 INFO L175 Difference]: Start difference. First operand has 151 places, 128 transitions, 917 flow. Second operand 11 states and 126 transitions. [2024-06-14 15:13:10,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 141 transitions, 1249 flow [2024-06-14 15:13:10,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 141 transitions, 1198 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-06-14 15:13:10,552 INFO L231 Difference]: Finished difference. Result has 156 places, 130 transitions, 945 flow [2024-06-14 15:13:10,552 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=866, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=945, PETRI_PLACES=156, PETRI_TRANSITIONS=130} [2024-06-14 15:13:10,553 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 125 predicate places. [2024-06-14 15:13:10,553 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 130 transitions, 945 flow [2024-06-14 15:13:10,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:13:10,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:13:10,553 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 15:13:10,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-14 15:13:10,554 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:13:10,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:13:10,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1067330776, now seen corresponding path program 1 times [2024-06-14 15:13:10,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:13:10,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116221519] [2024-06-14 15:13:10,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:13:10,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:13:10,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:13:15,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:13:15,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:13:15,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116221519] [2024-06-14 15:13:15,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116221519] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:13:15,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:13:15,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:13:15,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709548119] [2024-06-14 15:13:15,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:13:15,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:13:15,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:13:15,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:13:15,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:13:15,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:13:15,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 130 transitions, 945 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:13:15,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:13:15,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:13:15,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:13:16,104 INFO L124 PetriNetUnfolderBase]: 303/581 cut-off events. [2024-06-14 15:13:16,105 INFO L125 PetriNetUnfolderBase]: For 20196/20196 co-relation queries the response was YES. [2024-06-14 15:13:16,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3079 conditions, 581 events. 303/581 cut-off events. For 20196/20196 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2701 event pairs, 24 based on Foata normal form. 2/582 useless extension candidates. Maximal degree in co-relation 3006. Up to 469 conditions per place. [2024-06-14 15:13:16,109 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 129 selfloop transitions, 18 changer transitions 0/150 dead transitions. [2024-06-14 15:13:16,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 150 transitions, 1297 flow [2024-06-14 15:13:16,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:13:16,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:13:16,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-14 15:13:16,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-14 15:13:16,110 INFO L175 Difference]: Start difference. First operand has 156 places, 130 transitions, 945 flow. Second operand 10 states and 120 transitions. [2024-06-14 15:13:16,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 150 transitions, 1297 flow [2024-06-14 15:13:16,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 150 transitions, 1234 flow, removed 13 selfloop flow, removed 9 redundant places. [2024-06-14 15:13:16,148 INFO L231 Difference]: Finished difference. Result has 157 places, 131 transitions, 932 flow [2024-06-14 15:13:16,148 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=932, PETRI_PLACES=157, PETRI_TRANSITIONS=131} [2024-06-14 15:13:16,148 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 126 predicate places. [2024-06-14 15:13:16,149 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 131 transitions, 932 flow [2024-06-14 15:13:16,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:13:16,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:13:16,149 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 15:13:16,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-14 15:13:16,149 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:13:16,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:13:16,150 INFO L85 PathProgramCache]: Analyzing trace with hash -477513990, now seen corresponding path program 2 times [2024-06-14 15:13:16,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:13:16,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610581600] [2024-06-14 15:13:16,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:13:16,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:13:16,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:13:21,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:13:21,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:13:21,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610581600] [2024-06-14 15:13:21,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610581600] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:13:21,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:13:21,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:13:21,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825278527] [2024-06-14 15:13:21,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:13:21,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:13:21,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:13:21,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:13:21,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:13:21,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:13:21,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 131 transitions, 932 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:13:21,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:13:21,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:13:21,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:13:21,796 INFO L124 PetriNetUnfolderBase]: 314/602 cut-off events. [2024-06-14 15:13:21,797 INFO L125 PetriNetUnfolderBase]: For 23373/23373 co-relation queries the response was YES. [2024-06-14 15:13:21,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3274 conditions, 602 events. 314/602 cut-off events. For 23373/23373 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2831 event pairs, 43 based on Foata normal form. 2/603 useless extension candidates. Maximal degree in co-relation 3200. Up to 494 conditions per place. [2024-06-14 15:13:21,801 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 123 selfloop transitions, 25 changer transitions 0/151 dead transitions. [2024-06-14 15:13:21,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 151 transitions, 1394 flow [2024-06-14 15:13:21,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:13:21,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:13:21,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-14 15:13:21,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-14 15:13:21,803 INFO L175 Difference]: Start difference. First operand has 157 places, 131 transitions, 932 flow. Second operand 10 states and 124 transitions. [2024-06-14 15:13:21,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 151 transitions, 1394 flow [2024-06-14 15:13:21,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 151 transitions, 1354 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-14 15:13:21,853 INFO L231 Difference]: Finished difference. Result has 159 places, 133 transitions, 968 flow [2024-06-14 15:13:21,853 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=968, PETRI_PLACES=159, PETRI_TRANSITIONS=133} [2024-06-14 15:13:21,854 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 128 predicate places. [2024-06-14 15:13:21,854 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 133 transitions, 968 flow [2024-06-14 15:13:21,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:13:21,854 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:13:21,854 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 15:13:21,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-14 15:13:21,855 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:13:21,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:13:21,855 INFO L85 PathProgramCache]: Analyzing trace with hash -846820690, now seen corresponding path program 3 times [2024-06-14 15:13:21,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:13:21,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133008089] [2024-06-14 15:13:21,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:13:21,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:13:21,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:13:27,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:13:27,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:13:27,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133008089] [2024-06-14 15:13:27,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133008089] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:13:27,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:13:27,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:13:27,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134720546] [2024-06-14 15:13:27,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:13:27,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:13:27,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:13:27,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:13:27,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:13:27,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:13:27,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 133 transitions, 968 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:13:27,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:13:27,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:13:27,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:13:27,785 INFO L124 PetriNetUnfolderBase]: 311/597 cut-off events. [2024-06-14 15:13:27,786 INFO L125 PetriNetUnfolderBase]: For 22047/22047 co-relation queries the response was YES. [2024-06-14 15:13:27,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3188 conditions, 597 events. 311/597 cut-off events. For 22047/22047 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2807 event pairs, 44 based on Foata normal form. 2/598 useless extension candidates. Maximal degree in co-relation 3113. Up to 508 conditions per place. [2024-06-14 15:13:27,790 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 121 selfloop transitions, 25 changer transitions 0/149 dead transitions. [2024-06-14 15:13:27,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 149 transitions, 1304 flow [2024-06-14 15:13:27,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:13:27,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:13:27,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2024-06-14 15:13:27,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.378125 [2024-06-14 15:13:27,791 INFO L175 Difference]: Start difference. First operand has 159 places, 133 transitions, 968 flow. Second operand 10 states and 121 transitions. [2024-06-14 15:13:27,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 149 transitions, 1304 flow [2024-06-14 15:13:27,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 149 transitions, 1257 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-14 15:13:27,839 INFO L231 Difference]: Finished difference. Result has 163 places, 133 transitions, 975 flow [2024-06-14 15:13:27,839 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=921, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=975, PETRI_PLACES=163, PETRI_TRANSITIONS=133} [2024-06-14 15:13:27,839 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 132 predicate places. [2024-06-14 15:13:27,839 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 133 transitions, 975 flow [2024-06-14 15:13:27,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:13:27,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:13:27,840 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 15:13:27,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-14 15:13:27,840 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:13:27,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:13:27,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1620077654, now seen corresponding path program 4 times [2024-06-14 15:13:27,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:13:27,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251490507] [2024-06-14 15:13:27,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:13:27,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:13:27,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:13:34,066 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 15:13:34,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:13:34,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251490507] [2024-06-14 15:13:34,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251490507] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:13:34,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:13:34,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:13:34,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164017358] [2024-06-14 15:13:34,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:13:34,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:13:34,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:13:34,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:13:34,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:13:34,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:13:34,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 133 transitions, 975 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:13:34,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:13:34,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:13:34,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:13:34,522 INFO L124 PetriNetUnfolderBase]: 315/605 cut-off events. [2024-06-14 15:13:34,522 INFO L125 PetriNetUnfolderBase]: For 22860/22860 co-relation queries the response was YES. [2024-06-14 15:13:34,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3250 conditions, 605 events. 315/605 cut-off events. For 22860/22860 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2848 event pairs, 40 based on Foata normal form. 2/606 useless extension candidates. Maximal degree in co-relation 3173. Up to 476 conditions per place. [2024-06-14 15:13:34,527 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 124 selfloop transitions, 25 changer transitions 0/152 dead transitions. [2024-06-14 15:13:34,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 152 transitions, 1333 flow [2024-06-14 15:13:34,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:13:34,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:13:34,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-14 15:13:34,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-14 15:13:34,529 INFO L175 Difference]: Start difference. First operand has 163 places, 133 transitions, 975 flow. Second operand 10 states and 125 transitions. [2024-06-14 15:13:34,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 152 transitions, 1333 flow [2024-06-14 15:13:34,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 152 transitions, 1280 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-14 15:13:34,573 INFO L231 Difference]: Finished difference. Result has 164 places, 134 transitions, 990 flow [2024-06-14 15:13:34,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=922, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=990, PETRI_PLACES=164, PETRI_TRANSITIONS=134} [2024-06-14 15:13:34,573 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 133 predicate places. [2024-06-14 15:13:34,573 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 134 transitions, 990 flow [2024-06-14 15:13:34,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:13:34,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:13:34,574 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 15:13:34,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-14 15:13:34,575 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:13:34,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:13:34,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1351070096, now seen corresponding path program 1 times [2024-06-14 15:13:34,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:13:34,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566360057] [2024-06-14 15:13:34,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:13:34,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:13:34,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:13:41,144 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 15:13:41,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:13:41,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566360057] [2024-06-14 15:13:41,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566360057] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:13:41,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:13:41,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:13:41,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206662189] [2024-06-14 15:13:41,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:13:41,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:13:41,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:13:41,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:13:41,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:13:41,338 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:13:41,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 134 transitions, 990 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:13:41,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:13:41,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:13:41,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:13:41,618 INFO L124 PetriNetUnfolderBase]: 318/612 cut-off events. [2024-06-14 15:13:41,618 INFO L125 PetriNetUnfolderBase]: For 22692/22692 co-relation queries the response was YES. [2024-06-14 15:13:41,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3338 conditions, 612 events. 318/612 cut-off events. For 22692/22692 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 2897 event pairs, 43 based on Foata normal form. 1/612 useless extension candidates. Maximal degree in co-relation 3260. Up to 521 conditions per place. [2024-06-14 15:13:41,623 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 121 selfloop transitions, 28 changer transitions 0/152 dead transitions. [2024-06-14 15:13:41,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 152 transitions, 1382 flow [2024-06-14 15:13:41,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:13:41,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:13:41,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 131 transitions. [2024-06-14 15:13:41,624 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3721590909090909 [2024-06-14 15:13:41,624 INFO L175 Difference]: Start difference. First operand has 164 places, 134 transitions, 990 flow. Second operand 11 states and 131 transitions. [2024-06-14 15:13:41,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 152 transitions, 1382 flow [2024-06-14 15:13:41,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 152 transitions, 1324 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-14 15:13:41,676 INFO L231 Difference]: Finished difference. Result has 167 places, 136 transitions, 1047 flow [2024-06-14 15:13:41,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=932, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1047, PETRI_PLACES=167, PETRI_TRANSITIONS=136} [2024-06-14 15:13:41,676 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 136 predicate places. [2024-06-14 15:13:41,676 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 136 transitions, 1047 flow [2024-06-14 15:13:41,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:13:41,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:13:41,677 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 15:13:41,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-14 15:13:41,677 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:13:41,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:13:41,677 INFO L85 PathProgramCache]: Analyzing trace with hash 860358468, now seen corresponding path program 5 times [2024-06-14 15:13:41,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:13:41,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790717644] [2024-06-14 15:13:41,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:13:41,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:13:41,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:13:46,918 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 15:13:46,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:13:46,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790717644] [2024-06-14 15:13:46,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790717644] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:13:46,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:13:46,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:13:46,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474450776] [2024-06-14 15:13:46,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:13:46,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:13:46,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:13:46,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:13:46,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:13:47,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:13:47,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 136 transitions, 1047 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:13:47,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:13:47,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:13:47,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:13:47,439 INFO L124 PetriNetUnfolderBase]: 328/632 cut-off events. [2024-06-14 15:13:47,439 INFO L125 PetriNetUnfolderBase]: For 24861/24861 co-relation queries the response was YES. [2024-06-14 15:13:47,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3442 conditions, 632 events. 328/632 cut-off events. For 24861/24861 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3031 event pairs, 45 based on Foata normal form. 2/633 useless extension candidates. Maximal degree in co-relation 3363. Up to 545 conditions per place. [2024-06-14 15:13:47,444 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 130 selfloop transitions, 23 changer transitions 0/156 dead transitions. [2024-06-14 15:13:47,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 156 transitions, 1449 flow [2024-06-14 15:13:47,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:13:47,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:13:47,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-14 15:13:47,445 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38125 [2024-06-14 15:13:47,445 INFO L175 Difference]: Start difference. First operand has 167 places, 136 transitions, 1047 flow. Second operand 10 states and 122 transitions. [2024-06-14 15:13:47,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 156 transitions, 1449 flow [2024-06-14 15:13:47,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 156 transitions, 1350 flow, removed 23 selfloop flow, removed 9 redundant places. [2024-06-14 15:13:47,501 INFO L231 Difference]: Finished difference. Result has 169 places, 142 transitions, 1067 flow [2024-06-14 15:13:47,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=948, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1067, PETRI_PLACES=169, PETRI_TRANSITIONS=142} [2024-06-14 15:13:47,502 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 138 predicate places. [2024-06-14 15:13:47,502 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 142 transitions, 1067 flow [2024-06-14 15:13:47,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:13:47,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:13:47,502 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 15:13:47,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-14 15:13:47,503 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:13:47,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:13:47,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1185615536, now seen corresponding path program 6 times [2024-06-14 15:13:47,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:13:47,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938605969] [2024-06-14 15:13:47,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:13:47,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:13:47,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:13:53,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 15:13:53,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:13:53,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938605969] [2024-06-14 15:13:53,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938605969] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:13:53,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:13:53,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:13:53,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3227960] [2024-06-14 15:13:53,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:13:53,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:13:53,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:13:53,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:13:53,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:13:53,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:13:53,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 142 transitions, 1067 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:13:53,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:13:53,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:13:53,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:13:54,028 INFO L124 PetriNetUnfolderBase]: 339/655 cut-off events. [2024-06-14 15:13:54,028 INFO L125 PetriNetUnfolderBase]: For 29199/29199 co-relation queries the response was YES. [2024-06-14 15:13:54,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3668 conditions, 655 events. 339/655 cut-off events. For 29199/29199 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3192 event pairs, 44 based on Foata normal form. 2/656 useless extension candidates. Maximal degree in co-relation 3587. Up to 543 conditions per place. [2024-06-14 15:13:54,033 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 132 selfloop transitions, 25 changer transitions 0/160 dead transitions. [2024-06-14 15:13:54,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 160 transitions, 1563 flow [2024-06-14 15:13:54,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:13:54,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:13:54,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-14 15:13:54,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-14 15:13:54,034 INFO L175 Difference]: Start difference. First operand has 169 places, 142 transitions, 1067 flow. Second operand 10 states and 124 transitions. [2024-06-14 15:13:54,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 160 transitions, 1563 flow [2024-06-14 15:13:54,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 160 transitions, 1509 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-06-14 15:13:54,097 INFO L231 Difference]: Finished difference. Result has 174 places, 144 transitions, 1101 flow [2024-06-14 15:13:54,097 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1013, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1101, PETRI_PLACES=174, PETRI_TRANSITIONS=144} [2024-06-14 15:13:54,098 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 143 predicate places. [2024-06-14 15:13:54,098 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 144 transitions, 1101 flow [2024-06-14 15:13:54,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:13:54,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:13:54,098 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 15:13:54,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-14 15:13:54,098 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:13:54,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:13:54,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1179181796, now seen corresponding path program 7 times [2024-06-14 15:13:54,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:13:54,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553362761] [2024-06-14 15:13:54,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:13:54,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:13:54,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:13:59,718 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 15:13:59,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:13:59,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553362761] [2024-06-14 15:13:59,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553362761] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:13:59,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:13:59,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:13:59,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245329142] [2024-06-14 15:13:59,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:13:59,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:13:59,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:13:59,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:13:59,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:13:59,840 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:13:59,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 144 transitions, 1101 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:13:59,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:13:59,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:13:59,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:14:00,094 INFO L124 PetriNetUnfolderBase]: 336/650 cut-off events. [2024-06-14 15:14:00,095 INFO L125 PetriNetUnfolderBase]: For 27177/27177 co-relation queries the response was YES. [2024-06-14 15:14:00,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3546 conditions, 650 events. 336/650 cut-off events. For 27177/27177 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3173 event pairs, 45 based on Foata normal form. 2/651 useless extension candidates. Maximal degree in co-relation 3464. Up to 561 conditions per place. [2024-06-14 15:14:00,100 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 131 selfloop transitions, 24 changer transitions 0/158 dead transitions. [2024-06-14 15:14:00,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 158 transitions, 1449 flow [2024-06-14 15:14:00,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:14:00,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:14:00,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2024-06-14 15:14:00,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.378125 [2024-06-14 15:14:00,101 INFO L175 Difference]: Start difference. First operand has 174 places, 144 transitions, 1101 flow. Second operand 10 states and 121 transitions. [2024-06-14 15:14:00,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 158 transitions, 1449 flow [2024-06-14 15:14:00,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 158 transitions, 1394 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-14 15:14:00,165 INFO L231 Difference]: Finished difference. Result has 178 places, 144 transitions, 1098 flow [2024-06-14 15:14:00,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1046, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1098, PETRI_PLACES=178, PETRI_TRANSITIONS=144} [2024-06-14 15:14:00,166 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 147 predicate places. [2024-06-14 15:14:00,166 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 144 transitions, 1098 flow [2024-06-14 15:14:00,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:14:00,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:14:00,167 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 15:14:00,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-14 15:14:00,167 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:14:00,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:14:00,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1351671686, now seen corresponding path program 8 times [2024-06-14 15:14:00,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:14:00,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140272652] [2024-06-14 15:14:00,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:14:00,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:14:00,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:14:05,546 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 15:14:05,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:14:05,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140272652] [2024-06-14 15:14:05,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140272652] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:14:05,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:14:05,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:14:05,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134961295] [2024-06-14 15:14:05,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:14:05,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:14:05,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:14:05,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:14:05,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:14:05,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:14:05,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 144 transitions, 1098 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:14:05,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:14:05,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:14:05,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:14:05,918 INFO L124 PetriNetUnfolderBase]: 340/658 cut-off events. [2024-06-14 15:14:05,918 INFO L125 PetriNetUnfolderBase]: For 27972/27972 co-relation queries the response was YES. [2024-06-14 15:14:05,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3601 conditions, 658 events. 340/658 cut-off events. For 27972/27972 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3217 event pairs, 47 based on Foata normal form. 2/659 useless extension candidates. Maximal degree in co-relation 3517. Up to 569 conditions per place. [2024-06-14 15:14:05,923 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 133 selfloop transitions, 24 changer transitions 0/160 dead transitions. [2024-06-14 15:14:05,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 160 transitions, 1480 flow [2024-06-14 15:14:05,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:14:05,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:14:05,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-14 15:14:05,924 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38125 [2024-06-14 15:14:05,925 INFO L175 Difference]: Start difference. First operand has 178 places, 144 transitions, 1098 flow. Second operand 10 states and 122 transitions. [2024-06-14 15:14:05,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 160 transitions, 1480 flow [2024-06-14 15:14:05,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 160 transitions, 1418 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-14 15:14:05,986 INFO L231 Difference]: Finished difference. Result has 179 places, 146 transitions, 1120 flow [2024-06-14 15:14:05,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1038, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1120, PETRI_PLACES=179, PETRI_TRANSITIONS=146} [2024-06-14 15:14:05,987 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 148 predicate places. [2024-06-14 15:14:05,987 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 146 transitions, 1120 flow [2024-06-14 15:14:05,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:14:05,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:14:05,987 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 15:14:05,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-14 15:14:05,988 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:14:05,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:14:05,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1351849316, now seen corresponding path program 9 times [2024-06-14 15:14:05,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:14:05,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716042933] [2024-06-14 15:14:05,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:14:05,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:14:06,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:14:12,248 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 15:14:12,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:14:12,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716042933] [2024-06-14 15:14:12,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716042933] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:14:12,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:14:12,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:14:12,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291945329] [2024-06-14 15:14:12,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:14:12,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:14:12,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:14:12,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:14:12,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:14:12,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:14:12,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 146 transitions, 1120 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:14:12,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:14:12,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:14:12,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:14:12,786 INFO L124 PetriNetUnfolderBase]: 344/666 cut-off events. [2024-06-14 15:14:12,787 INFO L125 PetriNetUnfolderBase]: For 29024/29024 co-relation queries the response was YES. [2024-06-14 15:14:12,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3665 conditions, 666 events. 344/666 cut-off events. For 29024/29024 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3277 event pairs, 47 based on Foata normal form. 2/667 useless extension candidates. Maximal degree in co-relation 3580. Up to 563 conditions per place. [2024-06-14 15:14:12,792 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 134 selfloop transitions, 25 changer transitions 0/162 dead transitions. [2024-06-14 15:14:12,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 162 transitions, 1498 flow [2024-06-14 15:14:12,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:14:12,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:14:12,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-14 15:14:12,793 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-14 15:14:12,793 INFO L175 Difference]: Start difference. First operand has 179 places, 146 transitions, 1120 flow. Second operand 10 states and 124 transitions. [2024-06-14 15:14:12,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 162 transitions, 1498 flow [2024-06-14 15:14:12,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 162 transitions, 1445 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-14 15:14:12,856 INFO L231 Difference]: Finished difference. Result has 183 places, 147 transitions, 1143 flow [2024-06-14 15:14:12,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1067, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1143, PETRI_PLACES=183, PETRI_TRANSITIONS=147} [2024-06-14 15:14:12,856 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 152 predicate places. [2024-06-14 15:14:12,856 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 147 transitions, 1143 flow [2024-06-14 15:14:12,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:14:12,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:14:12,857 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 15:14:12,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-14 15:14:12,857 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:14:12,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:14:12,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1356433286, now seen corresponding path program 10 times [2024-06-14 15:14:12,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:14:12,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534713728] [2024-06-14 15:14:12,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:14:12,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:14:12,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:14:18,443 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 15:14:18,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:14:18,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534713728] [2024-06-14 15:14:18,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534713728] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:14:18,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:14:18,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:14:18,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259632074] [2024-06-14 15:14:18,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:14:18,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:14:18,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:14:18,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:14:18,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:14:18,606 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:14:18,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 147 transitions, 1143 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:14:18,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:14:18,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:14:18,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:14:18,946 INFO L124 PetriNetUnfolderBase]: 348/673 cut-off events. [2024-06-14 15:14:18,947 INFO L125 PetriNetUnfolderBase]: For 30204/30206 co-relation queries the response was YES. [2024-06-14 15:14:18,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3728 conditions, 673 events. 348/673 cut-off events. For 30204/30206 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3326 event pairs, 47 based on Foata normal form. 2/674 useless extension candidates. Maximal degree in co-relation 3642. Up to 488 conditions per place. [2024-06-14 15:14:18,952 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 121 selfloop transitions, 39 changer transitions 0/163 dead transitions. [2024-06-14 15:14:18,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 163 transitions, 1521 flow [2024-06-14 15:14:18,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:14:18,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:14:18,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-14 15:14:18,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39375 [2024-06-14 15:14:18,953 INFO L175 Difference]: Start difference. First operand has 183 places, 147 transitions, 1143 flow. Second operand 10 states and 126 transitions. [2024-06-14 15:14:18,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 163 transitions, 1521 flow [2024-06-14 15:14:19,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 163 transitions, 1455 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-14 15:14:19,020 INFO L231 Difference]: Finished difference. Result has 185 places, 148 transitions, 1183 flow [2024-06-14 15:14:19,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1077, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1183, PETRI_PLACES=185, PETRI_TRANSITIONS=148} [2024-06-14 15:14:19,021 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 154 predicate places. [2024-06-14 15:14:19,021 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 148 transitions, 1183 flow [2024-06-14 15:14:19,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:14:19,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:14:19,021 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 15:14:19,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-14 15:14:19,021 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:14:19,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:14:19,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1178935532, now seen corresponding path program 1 times [2024-06-14 15:14:19,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:14:19,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287898422] [2024-06-14 15:14:19,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:14:19,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:14:19,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:14:25,855 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 15:14:25,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:14:25,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287898422] [2024-06-14 15:14:25,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287898422] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:14:25,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:14:25,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:14:25,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169544871] [2024-06-14 15:14:25,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:14:25,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:14:25,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:14:25,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:14:25,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:14:25,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:14:25,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 148 transitions, 1183 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:14:25,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:14:25,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:14:25,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:14:26,422 INFO L124 PetriNetUnfolderBase]: 368/718 cut-off events. [2024-06-14 15:14:26,422 INFO L125 PetriNetUnfolderBase]: For 48060/48060 co-relation queries the response was YES. [2024-06-14 15:14:26,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4002 conditions, 718 events. 368/718 cut-off events. For 48060/48060 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3623 event pairs, 53 based on Foata normal form. 12/729 useless extension candidates. Maximal degree in co-relation 3915. Up to 569 conditions per place. [2024-06-14 15:14:26,428 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 132 selfloop transitions, 24 changer transitions 10/169 dead transitions. [2024-06-14 15:14:26,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 169 transitions, 1661 flow [2024-06-14 15:14:26,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:14:26,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:14:26,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 137 transitions. [2024-06-14 15:14:26,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38920454545454547 [2024-06-14 15:14:26,429 INFO L175 Difference]: Start difference. First operand has 185 places, 148 transitions, 1183 flow. Second operand 11 states and 137 transitions. [2024-06-14 15:14:26,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 169 transitions, 1661 flow [2024-06-14 15:14:26,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 169 transitions, 1565 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-14 15:14:26,505 INFO L231 Difference]: Finished difference. Result has 188 places, 144 transitions, 1124 flow [2024-06-14 15:14:26,505 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1087, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1124, PETRI_PLACES=188, PETRI_TRANSITIONS=144} [2024-06-14 15:14:26,506 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 157 predicate places. [2024-06-14 15:14:26,506 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 144 transitions, 1124 flow [2024-06-14 15:14:26,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:14:26,506 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:14:26,506 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 15:14:26,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-14 15:14:26,506 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:14:26,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:14:26,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1178935842, now seen corresponding path program 2 times [2024-06-14 15:14:26,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:14:26,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194198947] [2024-06-14 15:14:26,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:14:26,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:14:26,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:14:32,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:14:32,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:14:32,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194198947] [2024-06-14 15:14:32,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194198947] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:14:32,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:14:32,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:14:32,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515949462] [2024-06-14 15:14:32,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:14:32,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:14:32,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:14:32,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:14:32,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:14:32,576 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:14:32,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 144 transitions, 1124 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:14:32,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:14:32,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:14:32,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:14:32,953 INFO L124 PetriNetUnfolderBase]: 353/700 cut-off events. [2024-06-14 15:14:32,954 INFO L125 PetriNetUnfolderBase]: For 31371/31373 co-relation queries the response was YES. [2024-06-14 15:14:32,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3896 conditions, 700 events. 353/700 cut-off events. For 31371/31373 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3576 event pairs, 55 based on Foata normal form. 1/700 useless extension candidates. Maximal degree in co-relation 3808. Up to 558 conditions per place. [2024-06-14 15:14:32,959 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 113 selfloop transitions, 43 changer transitions 1/160 dead transitions. [2024-06-14 15:14:32,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 160 transitions, 1546 flow [2024-06-14 15:14:32,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:14:32,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:14:32,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2024-06-14 15:14:32,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3806818181818182 [2024-06-14 15:14:32,960 INFO L175 Difference]: Start difference. First operand has 188 places, 144 transitions, 1124 flow. Second operand 11 states and 134 transitions. [2024-06-14 15:14:32,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 160 transitions, 1546 flow [2024-06-14 15:14:33,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 160 transitions, 1490 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-06-14 15:14:33,038 INFO L231 Difference]: Finished difference. Result has 190 places, 146 transitions, 1217 flow [2024-06-14 15:14:33,038 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1068, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1217, PETRI_PLACES=190, PETRI_TRANSITIONS=146} [2024-06-14 15:14:33,039 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 159 predicate places. [2024-06-14 15:14:33,039 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 146 transitions, 1217 flow [2024-06-14 15:14:33,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:14:33,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:14:33,039 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 15:14:33,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-14 15:14:33,040 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:14:33,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:14:33,040 INFO L85 PathProgramCache]: Analyzing trace with hash 281075062, now seen corresponding path program 11 times [2024-06-14 15:14:33,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:14:33,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349650627] [2024-06-14 15:14:33,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:14:33,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:14:33,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:14:38,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:14:38,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:14:38,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349650627] [2024-06-14 15:14:38,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349650627] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:14:38,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:14:38,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:14:38,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195751964] [2024-06-14 15:14:38,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:14:38,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:14:38,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:14:38,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:14:38,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:14:38,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:14:38,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 146 transitions, 1217 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:14:38,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:14:38,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:14:38,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:14:39,098 INFO L124 PetriNetUnfolderBase]: 360/715 cut-off events. [2024-06-14 15:14:39,099 INFO L125 PetriNetUnfolderBase]: For 34547/34549 co-relation queries the response was YES. [2024-06-14 15:14:39,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4043 conditions, 715 events. 360/715 cut-off events. For 34547/34549 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3700 event pairs, 50 based on Foata normal form. 4/718 useless extension candidates. Maximal degree in co-relation 3954. Up to 566 conditions per place. [2024-06-14 15:14:39,104 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 123 selfloop transitions, 38 changer transitions 0/164 dead transitions. [2024-06-14 15:14:39,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 164 transitions, 1674 flow [2024-06-14 15:14:39,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:14:39,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:14:39,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-14 15:14:39,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-14 15:14:39,106 INFO L175 Difference]: Start difference. First operand has 190 places, 146 transitions, 1217 flow. Second operand 10 states and 124 transitions. [2024-06-14 15:14:39,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 164 transitions, 1674 flow [2024-06-14 15:14:39,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 164 transitions, 1541 flow, removed 25 selfloop flow, removed 9 redundant places. [2024-06-14 15:14:39,192 INFO L231 Difference]: Finished difference. Result has 192 places, 150 transitions, 1232 flow [2024-06-14 15:14:39,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1084, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1232, PETRI_PLACES=192, PETRI_TRANSITIONS=150} [2024-06-14 15:14:39,193 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 161 predicate places. [2024-06-14 15:14:39,193 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 150 transitions, 1232 flow [2024-06-14 15:14:39,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:14:39,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:14:39,193 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 15:14:39,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-14 15:14:39,193 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:14:39,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:14:39,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1043314316, now seen corresponding path program 12 times [2024-06-14 15:14:39,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:14:39,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739335230] [2024-06-14 15:14:39,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:14:39,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:14:39,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:14:45,043 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 15:14:45,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:14:45,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739335230] [2024-06-14 15:14:45,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739335230] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:14:45,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:14:45,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:14:45,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025829537] [2024-06-14 15:14:45,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:14:45,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:14:45,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:14:45,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:14:45,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:14:45,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:14:45,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 150 transitions, 1232 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:14:45,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:14:45,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:14:45,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:14:45,661 INFO L124 PetriNetUnfolderBase]: 364/725 cut-off events. [2024-06-14 15:14:45,661 INFO L125 PetriNetUnfolderBase]: For 35622/35624 co-relation queries the response was YES. [2024-06-14 15:14:45,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4104 conditions, 725 events. 364/725 cut-off events. For 35622/35624 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3774 event pairs, 52 based on Foata normal form. 4/728 useless extension candidates. Maximal degree in co-relation 4013. Up to 574 conditions per place. [2024-06-14 15:14:45,667 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 123 selfloop transitions, 41 changer transitions 0/167 dead transitions. [2024-06-14 15:14:45,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 167 transitions, 1685 flow [2024-06-14 15:14:45,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:14:45,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:14:45,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-14 15:14:45,668 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.384375 [2024-06-14 15:14:45,669 INFO L175 Difference]: Start difference. First operand has 192 places, 150 transitions, 1232 flow. Second operand 10 states and 123 transitions. [2024-06-14 15:14:45,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 167 transitions, 1685 flow [2024-06-14 15:14:45,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 167 transitions, 1567 flow, removed 21 selfloop flow, removed 7 redundant places. [2024-06-14 15:14:45,756 INFO L231 Difference]: Finished difference. Result has 196 places, 154 transitions, 1280 flow [2024-06-14 15:14:45,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1118, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1280, PETRI_PLACES=196, PETRI_TRANSITIONS=154} [2024-06-14 15:14:45,757 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 165 predicate places. [2024-06-14 15:14:45,757 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 154 transitions, 1280 flow [2024-06-14 15:14:45,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:14:45,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:14:45,757 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 15:14:45,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-14 15:14:45,758 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:14:45,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:14:45,758 INFO L85 PathProgramCache]: Analyzing trace with hash 274641322, now seen corresponding path program 13 times [2024-06-14 15:14:45,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:14:45,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434555299] [2024-06-14 15:14:45,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:14:45,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:14:45,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:14:51,899 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 15:14:51,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:14:51,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434555299] [2024-06-14 15:14:51,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434555299] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:14:51,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:14:51,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:14:51,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075317781] [2024-06-14 15:14:51,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:14:51,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:14:51,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:14:51,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:14:51,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:14:52,053 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:14:52,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 154 transitions, 1280 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:14:52,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:14:52,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:14:52,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:14:52,268 INFO L124 PetriNetUnfolderBase]: 375/744 cut-off events. [2024-06-14 15:14:52,268 INFO L125 PetriNetUnfolderBase]: For 41061/41063 co-relation queries the response was YES. [2024-06-14 15:14:52,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4395 conditions, 744 events. 375/744 cut-off events. For 41061/41063 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 3865 event pairs, 53 based on Foata normal form. 4/747 useless extension candidates. Maximal degree in co-relation 4302. Up to 566 conditions per place. [2024-06-14 15:14:52,273 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 124 selfloop transitions, 44 changer transitions 0/171 dead transitions. [2024-06-14 15:14:52,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 171 transitions, 1860 flow [2024-06-14 15:14:52,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:14:52,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:14:52,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-14 15:14:52,275 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-14 15:14:52,276 INFO L175 Difference]: Start difference. First operand has 196 places, 154 transitions, 1280 flow. Second operand 10 states and 125 transitions. [2024-06-14 15:14:52,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 171 transitions, 1860 flow [2024-06-14 15:14:52,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 171 transitions, 1757 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-06-14 15:14:52,364 INFO L231 Difference]: Finished difference. Result has 201 places, 156 transitions, 1327 flow [2024-06-14 15:14:52,365 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1177, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1327, PETRI_PLACES=201, PETRI_TRANSITIONS=156} [2024-06-14 15:14:52,365 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 170 predicate places. [2024-06-14 15:14:52,365 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 156 transitions, 1327 flow [2024-06-14 15:14:52,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:14:52,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:14:52,365 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 15:14:52,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-14 15:14:52,366 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:14:52,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:14:52,366 INFO L85 PathProgramCache]: Analyzing trace with hash -357343720, now seen corresponding path program 14 times [2024-06-14 15:14:52,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:14:52,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557849050] [2024-06-14 15:14:52,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:14:52,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:14:52,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:14:57,854 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 15:14:57,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:14:57,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557849050] [2024-06-14 15:14:57,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557849050] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:14:57,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:14:57,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:14:57,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205969351] [2024-06-14 15:14:57,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:14:57,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:14:57,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:14:57,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:14:57,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:14:57,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:14:57,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 156 transitions, 1327 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:14:57,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:14:57,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:14:57,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:14:58,228 INFO L124 PetriNetUnfolderBase]: 372/737 cut-off events. [2024-06-14 15:14:58,228 INFO L125 PetriNetUnfolderBase]: For 37933/37935 co-relation queries the response was YES. [2024-06-14 15:14:58,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4219 conditions, 737 events. 372/737 cut-off events. For 37933/37935 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3833 event pairs, 54 based on Foata normal form. 4/740 useless extension candidates. Maximal degree in co-relation 4125. Up to 590 conditions per place. [2024-06-14 15:14:58,234 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 120 selfloop transitions, 46 changer transitions 0/169 dead transitions. [2024-06-14 15:14:58,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 169 transitions, 1717 flow [2024-06-14 15:14:58,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:14:58,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:14:58,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-14 15:14:58,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38125 [2024-06-14 15:14:58,235 INFO L175 Difference]: Start difference. First operand has 201 places, 156 transitions, 1327 flow. Second operand 10 states and 122 transitions. [2024-06-14 15:14:58,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 169 transitions, 1717 flow [2024-06-14 15:14:58,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 169 transitions, 1616 flow, removed 24 selfloop flow, removed 6 redundant places. [2024-06-14 15:14:58,324 INFO L231 Difference]: Finished difference. Result has 205 places, 156 transitions, 1322 flow [2024-06-14 15:14:58,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1226, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1322, PETRI_PLACES=205, PETRI_TRANSITIONS=156} [2024-06-14 15:14:58,324 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 174 predicate places. [2024-06-14 15:14:58,325 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 156 transitions, 1322 flow [2024-06-14 15:14:58,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:14:58,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:14:58,325 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 15:14:58,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-14 15:14:58,325 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:14:58,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:14:58,326 INFO L85 PathProgramCache]: Analyzing trace with hash 2038484714, now seen corresponding path program 15 times [2024-06-14 15:14:58,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:14:58,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752216881] [2024-06-14 15:14:58,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:14:58,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:14:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:15:03,796 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 15:15:03,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:15:03,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752216881] [2024-06-14 15:15:03,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752216881] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:15:03,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:15:03,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:15:03,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90726180] [2024-06-14 15:15:03,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:15:03,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:15:03,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:15:03,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:15:03,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:15:03,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:15:03,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 156 transitions, 1322 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:15:03,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:15:03,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:15:03,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:15:04,298 INFO L124 PetriNetUnfolderBase]: 386/765 cut-off events. [2024-06-14 15:15:04,298 INFO L125 PetriNetUnfolderBase]: For 43331/43333 co-relation queries the response was YES. [2024-06-14 15:15:04,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4558 conditions, 765 events. 386/765 cut-off events. For 43331/43333 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4039 event pairs, 53 based on Foata normal form. 4/768 useless extension candidates. Maximal degree in co-relation 4462. Up to 598 conditions per place. [2024-06-14 15:15:04,304 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 128 selfloop transitions, 45 changer transitions 0/176 dead transitions. [2024-06-14 15:15:04,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 176 transitions, 1949 flow [2024-06-14 15:15:04,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:15:04,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:15:04,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-14 15:15:04,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.396875 [2024-06-14 15:15:04,306 INFO L175 Difference]: Start difference. First operand has 205 places, 156 transitions, 1322 flow. Second operand 10 states and 127 transitions. [2024-06-14 15:15:04,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 176 transitions, 1949 flow [2024-06-14 15:15:04,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 176 transitions, 1830 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-14 15:15:04,398 INFO L231 Difference]: Finished difference. Result has 207 places, 162 transitions, 1428 flow [2024-06-14 15:15:04,399 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1209, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1428, PETRI_PLACES=207, PETRI_TRANSITIONS=162} [2024-06-14 15:15:04,399 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 176 predicate places. [2024-06-14 15:15:04,399 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 162 transitions, 1428 flow [2024-06-14 15:15:04,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:15:04,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:15:04,399 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 15:15:04,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-14 15:15:04,400 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:15:04,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:15:04,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1132032400, now seen corresponding path program 16 times [2024-06-14 15:15:04,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:15:04,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444381050] [2024-06-14 15:15:04,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:15:04,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:15:04,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:15:10,707 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 15:15:10,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:15:10,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444381050] [2024-06-14 15:15:10,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444381050] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:15:10,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:15:10,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:15:10,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674774449] [2024-06-14 15:15:10,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:15:10,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:15:10,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:15:10,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:15:10,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:15:10,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:15:10,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 162 transitions, 1428 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:15:10,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:15:10,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:15:10,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:15:11,210 INFO L124 PetriNetUnfolderBase]: 393/778 cut-off events. [2024-06-14 15:15:11,210 INFO L125 PetriNetUnfolderBase]: For 45194/45196 co-relation queries the response was YES. [2024-06-14 15:15:11,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4701 conditions, 778 events. 393/778 cut-off events. For 45194/45196 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4112 event pairs, 55 based on Foata normal form. 4/781 useless extension candidates. Maximal degree in co-relation 4603. Up to 627 conditions per place. [2024-06-14 15:15:11,216 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 130 selfloop transitions, 44 changer transitions 0/177 dead transitions. [2024-06-14 15:15:11,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 177 transitions, 1859 flow [2024-06-14 15:15:11,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:15:11,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:15:11,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-14 15:15:11,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-14 15:15:11,218 INFO L175 Difference]: Start difference. First operand has 207 places, 162 transitions, 1428 flow. Second operand 10 states and 125 transitions. [2024-06-14 15:15:11,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 177 transitions, 1859 flow [2024-06-14 15:15:11,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 177 transitions, 1781 flow, removed 28 selfloop flow, removed 3 redundant places. [2024-06-14 15:15:11,324 INFO L231 Difference]: Finished difference. Result has 214 places, 165 transitions, 1495 flow [2024-06-14 15:15:11,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1350, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1495, PETRI_PLACES=214, PETRI_TRANSITIONS=165} [2024-06-14 15:15:11,325 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 183 predicate places. [2024-06-14 15:15:11,325 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 165 transitions, 1495 flow [2024-06-14 15:15:11,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:15:11,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:15:11,325 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 15:15:11,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-14 15:15:11,325 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:15:11,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:15:11,326 INFO L85 PathProgramCache]: Analyzing trace with hash -2085602522, now seen corresponding path program 17 times [2024-06-14 15:15:11,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:15:11,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189653438] [2024-06-14 15:15:11,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:15:11,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:15:11,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:15:16,836 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 15:15:16,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:15:16,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189653438] [2024-06-14 15:15:16,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189653438] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:15:16,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:15:16,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:15:16,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428834224] [2024-06-14 15:15:16,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:15:16,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:15:16,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:15:16,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:15:16,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:15:17,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:15:17,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 165 transitions, 1495 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:15:17,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:15:17,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:15:17,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:15:17,463 INFO L124 PetriNetUnfolderBase]: 397/786 cut-off events. [2024-06-14 15:15:17,464 INFO L125 PetriNetUnfolderBase]: For 46220/46222 co-relation queries the response was YES. [2024-06-14 15:15:17,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4782 conditions, 786 events. 397/786 cut-off events. For 46220/46222 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4181 event pairs, 57 based on Foata normal form. 4/789 useless extension candidates. Maximal degree in co-relation 4682. Up to 635 conditions per place. [2024-06-14 15:15:17,470 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 132 selfloop transitions, 43 changer transitions 0/178 dead transitions. [2024-06-14 15:15:17,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 178 transitions, 1911 flow [2024-06-14 15:15:17,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:15:17,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:15:17,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-14 15:15:17,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39375 [2024-06-14 15:15:17,471 INFO L175 Difference]: Start difference. First operand has 214 places, 165 transitions, 1495 flow. Second operand 10 states and 126 transitions. [2024-06-14 15:15:17,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 178 transitions, 1911 flow [2024-06-14 15:15:17,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 178 transitions, 1784 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-06-14 15:15:17,578 INFO L231 Difference]: Finished difference. Result has 216 places, 166 transitions, 1494 flow [2024-06-14 15:15:17,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1368, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1494, PETRI_PLACES=216, PETRI_TRANSITIONS=166} [2024-06-14 15:15:17,578 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 185 predicate places. [2024-06-14 15:15:17,579 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 166 transitions, 1494 flow [2024-06-14 15:15:17,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:15:17,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:15:17,579 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 15:15:17,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-14 15:15:17,579 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:15:17,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:15:17,580 INFO L85 PathProgramCache]: Analyzing trace with hash 304968268, now seen corresponding path program 18 times [2024-06-14 15:15:17,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:15:17,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418535847] [2024-06-14 15:15:17,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:15:17,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:15:17,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:15:23,553 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 15:15:23,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:15:23,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418535847] [2024-06-14 15:15:23,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418535847] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:15:23,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:15:23,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:15:23,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868140848] [2024-06-14 15:15:23,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:15:23,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:15:23,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:15:23,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:15:23,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:15:23,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:15:23,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 166 transitions, 1494 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:15:23,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:15:23,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:15:23,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:15:23,938 INFO L124 PetriNetUnfolderBase]: 401/792 cut-off events. [2024-06-14 15:15:23,939 INFO L125 PetriNetUnfolderBase]: For 47611/47613 co-relation queries the response was YES. [2024-06-14 15:15:23,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4817 conditions, 792 events. 401/792 cut-off events. For 47611/47613 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4173 event pairs, 57 based on Foata normal form. 4/795 useless extension candidates. Maximal degree in co-relation 4717. Up to 623 conditions per place. [2024-06-14 15:15:23,946 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 132 selfloop transitions, 45 changer transitions 0/180 dead transitions. [2024-06-14 15:15:23,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 180 transitions, 1918 flow [2024-06-14 15:15:23,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:15:23,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:15:23,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-14 15:15:23,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.396875 [2024-06-14 15:15:23,948 INFO L175 Difference]: Start difference. First operand has 216 places, 166 transitions, 1494 flow. Second operand 10 states and 127 transitions. [2024-06-14 15:15:23,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 180 transitions, 1918 flow [2024-06-14 15:15:24,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 180 transitions, 1793 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-14 15:15:24,055 INFO L231 Difference]: Finished difference. Result has 219 places, 167 transitions, 1501 flow [2024-06-14 15:15:24,055 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1369, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1501, PETRI_PLACES=219, PETRI_TRANSITIONS=167} [2024-06-14 15:15:24,055 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 188 predicate places. [2024-06-14 15:15:24,055 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 167 transitions, 1501 flow [2024-06-14 15:15:24,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:15:24,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:15:24,056 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 15:15:24,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-14 15:15:24,056 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:15:24,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:15:24,056 INFO L85 PathProgramCache]: Analyzing trace with hash 2043130994, now seen corresponding path program 19 times [2024-06-14 15:15:24,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:15:24,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937774492] [2024-06-14 15:15:24,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:15:24,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:15:24,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:15:29,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 15:15:29,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:15:29,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937774492] [2024-06-14 15:15:29,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937774492] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:15:29,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:15:29,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:15:29,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399088137] [2024-06-14 15:15:29,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:15:29,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:15:29,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:15:29,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:15:29,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:15:29,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:15:29,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 167 transitions, 1501 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 15:15:29,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:15:29,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:15:29,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:15:29,694 INFO L124 PetriNetUnfolderBase]: 398/789 cut-off events. [2024-06-14 15:15:29,694 INFO L125 PetriNetUnfolderBase]: For 43760/43762 co-relation queries the response was YES. [2024-06-14 15:15:29,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4619 conditions, 789 events. 398/789 cut-off events. For 43760/43762 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4197 event pairs, 58 based on Foata normal form. 4/792 useless extension candidates. Maximal degree in co-relation 4518. Up to 638 conditions per place. [2024-06-14 15:15:29,701 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 130 selfloop transitions, 46 changer transitions 0/179 dead transitions. [2024-06-14 15:15:29,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 179 transitions, 1885 flow [2024-06-14 15:15:29,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:15:29,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:15:29,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2024-06-14 15:15:29,702 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41875 [2024-06-14 15:15:29,703 INFO L175 Difference]: Start difference. First operand has 219 places, 167 transitions, 1501 flow. Second operand 10 states and 134 transitions. [2024-06-14 15:15:29,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 179 transitions, 1885 flow [2024-06-14 15:15:29,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 179 transitions, 1743 flow, removed 27 selfloop flow, removed 8 redundant places. [2024-06-14 15:15:29,831 INFO L231 Difference]: Finished difference. Result has 221 places, 167 transitions, 1455 flow [2024-06-14 15:15:29,831 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1359, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1455, PETRI_PLACES=221, PETRI_TRANSITIONS=167} [2024-06-14 15:15:29,831 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 190 predicate places. [2024-06-14 15:15:29,831 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 167 transitions, 1455 flow [2024-06-14 15:15:29,831 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 15:15:29,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:15:29,832 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 15:15:29,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-14 15:15:29,832 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:15:29,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:15:29,832 INFO L85 PathProgramCache]: Analyzing trace with hash 134150518, now seen corresponding path program 20 times [2024-06-14 15:15:29,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:15:29,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791961072] [2024-06-14 15:15:29,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:15:29,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:15:29,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:15:34,847 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 15:15:34,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:15:34,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791961072] [2024-06-14 15:15:34,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791961072] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:15:34,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:15:34,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:15:34,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166914757] [2024-06-14 15:15:34,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:15:34,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:15:34,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:15:34,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:15:34,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:15:34,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:15:34,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 167 transitions, 1455 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:15:34,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:15:34,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:15:34,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:15:35,303 INFO L124 PetriNetUnfolderBase]: 395/784 cut-off events. [2024-06-14 15:15:35,304 INFO L125 PetriNetUnfolderBase]: For 39192/39194 co-relation queries the response was YES. [2024-06-14 15:15:35,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4345 conditions, 784 events. 395/784 cut-off events. For 39192/39194 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4191 event pairs, 53 based on Foata normal form. 4/787 useless extension candidates. Maximal degree in co-relation 4243. Up to 539 conditions per place. [2024-06-14 15:15:35,310 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 123 selfloop transitions, 55 changer transitions 0/181 dead transitions. [2024-06-14 15:15:35,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 181 transitions, 1847 flow [2024-06-14 15:15:35,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:15:35,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:15:35,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-14 15:15:35,312 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39375 [2024-06-14 15:15:35,312 INFO L175 Difference]: Start difference. First operand has 221 places, 167 transitions, 1455 flow. Second operand 10 states and 126 transitions. [2024-06-14 15:15:35,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 181 transitions, 1847 flow [2024-06-14 15:15:35,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 181 transitions, 1752 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-14 15:15:35,437 INFO L231 Difference]: Finished difference. Result has 222 places, 167 transitions, 1474 flow [2024-06-14 15:15:35,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1360, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1474, PETRI_PLACES=222, PETRI_TRANSITIONS=167} [2024-06-14 15:15:35,438 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 191 predicate places. [2024-06-14 15:15:35,438 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 167 transitions, 1474 flow [2024-06-14 15:15:35,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:15:35,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:15:35,439 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 15:15:35,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-14 15:15:35,439 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:15:35,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:15:35,439 INFO L85 PathProgramCache]: Analyzing trace with hash 311647962, now seen corresponding path program 3 times [2024-06-14 15:15:35,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:15:35,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307605671] [2024-06-14 15:15:35,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:15:35,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:15:35,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:15:41,594 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 15:15:41,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:15:41,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307605671] [2024-06-14 15:15:41,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307605671] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:15:41,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:15:41,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:15:41,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591617574] [2024-06-14 15:15:41,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:15:41,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:15:41,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:15:41,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:15:41,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:15:41,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:15:41,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 167 transitions, 1474 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:15:41,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:15:41,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:15:41,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:15:42,117 INFO L124 PetriNetUnfolderBase]: 398/793 cut-off events. [2024-06-14 15:15:42,117 INFO L125 PetriNetUnfolderBase]: For 38183/38185 co-relation queries the response was YES. [2024-06-14 15:15:42,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4469 conditions, 793 events. 398/793 cut-off events. For 38183/38185 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4271 event pairs, 57 based on Foata normal form. 3/795 useless extension candidates. Maximal degree in co-relation 4366. Up to 590 conditions per place. [2024-06-14 15:15:42,126 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 128 selfloop transitions, 52 changer transitions 1/184 dead transitions. [2024-06-14 15:15:42,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 184 transitions, 2004 flow [2024-06-14 15:15:42,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:15:42,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:15:42,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 139 transitions. [2024-06-14 15:15:42,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39488636363636365 [2024-06-14 15:15:42,127 INFO L175 Difference]: Start difference. First operand has 222 places, 167 transitions, 1474 flow. Second operand 11 states and 139 transitions. [2024-06-14 15:15:42,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 184 transitions, 2004 flow [2024-06-14 15:15:42,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 184 transitions, 1724 flow, removed 18 selfloop flow, removed 13 redundant places. [2024-06-14 15:15:42,249 INFO L231 Difference]: Finished difference. Result has 220 places, 169 transitions, 1365 flow [2024-06-14 15:15:42,249 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1194, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1365, PETRI_PLACES=220, PETRI_TRANSITIONS=169} [2024-06-14 15:15:42,250 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 189 predicate places. [2024-06-14 15:15:42,250 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 169 transitions, 1365 flow [2024-06-14 15:15:42,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:15:42,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:15:42,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 15:15:42,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-14 15:15:42,250 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:15:42,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:15:42,251 INFO L85 PathProgramCache]: Analyzing trace with hash 311648272, now seen corresponding path program 2 times [2024-06-14 15:15:42,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:15:42,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376391664] [2024-06-14 15:15:42,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:15:42,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:15:42,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:15:49,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:15:49,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:15:49,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376391664] [2024-06-14 15:15:49,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376391664] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:15:49,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:15:49,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:15:49,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971243319] [2024-06-14 15:15:49,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:15:49,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:15:49,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:15:49,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:15:49,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:15:49,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:15:49,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 169 transitions, 1365 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:15:49,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:15:49,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:15:49,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:15:49,704 INFO L124 PetriNetUnfolderBase]: 414/825 cut-off events. [2024-06-14 15:15:49,704 INFO L125 PetriNetUnfolderBase]: For 61163/61165 co-relation queries the response was YES. [2024-06-14 15:15:49,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4390 conditions, 825 events. 414/825 cut-off events. For 61163/61165 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4435 event pairs, 61 based on Foata normal form. 12/836 useless extension candidates. Maximal degree in co-relation 4290. Up to 591 conditions per place. [2024-06-14 15:15:49,710 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 131 selfloop transitions, 50 changer transitions 5/189 dead transitions. [2024-06-14 15:15:49,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 189 transitions, 1939 flow [2024-06-14 15:15:49,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:15:49,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:15:49,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 142 transitions. [2024-06-14 15:15:49,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4034090909090909 [2024-06-14 15:15:49,712 INFO L175 Difference]: Start difference. First operand has 220 places, 169 transitions, 1365 flow. Second operand 11 states and 142 transitions. [2024-06-14 15:15:49,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 189 transitions, 1939 flow [2024-06-14 15:15:49,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 189 transitions, 1750 flow, removed 29 selfloop flow, removed 10 redundant places. [2024-06-14 15:15:49,823 INFO L231 Difference]: Finished difference. Result has 221 places, 169 transitions, 1306 flow [2024-06-14 15:15:49,824 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1178, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1306, PETRI_PLACES=221, PETRI_TRANSITIONS=169} [2024-06-14 15:15:49,824 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 190 predicate places. [2024-06-14 15:15:49,824 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 169 transitions, 1306 flow [2024-06-14 15:15:49,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:15:49,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:15:49,824 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 15:15:49,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-14 15:15:49,825 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:15:49,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:15:49,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1049816380, now seen corresponding path program 4 times [2024-06-14 15:15:49,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:15:49,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814871249] [2024-06-14 15:15:49,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:15:49,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:15:49,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:15:55,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:15:55,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:15:55,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814871249] [2024-06-14 15:15:55,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814871249] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:15:55,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:15:55,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:15:55,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853813395] [2024-06-14 15:15:55,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:15:55,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:15:55,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:15:55,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:15:55,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:15:55,845 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:15:55,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 169 transitions, 1306 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:15:55,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:15:55,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:15:55,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:15:56,208 INFO L124 PetriNetUnfolderBase]: 411/822 cut-off events. [2024-06-14 15:15:56,208 INFO L125 PetriNetUnfolderBase]: For 40507/40509 co-relation queries the response was YES. [2024-06-14 15:15:56,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4294 conditions, 822 events. 411/822 cut-off events. For 40507/40509 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4447 event pairs, 61 based on Foata normal form. 3/824 useless extension candidates. Maximal degree in co-relation 4194. Up to 621 conditions per place. [2024-06-14 15:15:56,214 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 131 selfloop transitions, 52 changer transitions 0/186 dead transitions. [2024-06-14 15:15:56,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 186 transitions, 1848 flow [2024-06-14 15:15:56,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:15:56,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:15:56,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2024-06-14 15:15:56,215 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39204545454545453 [2024-06-14 15:15:56,215 INFO L175 Difference]: Start difference. First operand has 221 places, 169 transitions, 1306 flow. Second operand 11 states and 138 transitions. [2024-06-14 15:15:56,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 186 transitions, 1848 flow [2024-06-14 15:15:56,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 186 transitions, 1734 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-14 15:15:56,310 INFO L231 Difference]: Finished difference. Result has 223 places, 171 transitions, 1365 flow [2024-06-14 15:15:56,311 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1192, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1365, PETRI_PLACES=223, PETRI_TRANSITIONS=171} [2024-06-14 15:15:56,311 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 192 predicate places. [2024-06-14 15:15:56,311 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 171 transitions, 1365 flow [2024-06-14 15:15:56,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:15:56,311 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:15:56,312 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 15:15:56,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-14 15:15:56,312 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:15:56,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:15:56,312 INFO L85 PathProgramCache]: Analyzing trace with hash 281321326, now seen corresponding path program 3 times [2024-06-14 15:15:56,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:15:56,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279425236] [2024-06-14 15:15:56,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:15:56,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:15:56,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:16:03,018 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 15:16:03,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:16:03,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279425236] [2024-06-14 15:16:03,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279425236] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:16:03,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:16:03,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:16:03,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696887277] [2024-06-14 15:16:03,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:16:03,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:16:03,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:16:03,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:16:03,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:16:03,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:16:03,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 171 transitions, 1365 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:16:03,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:16:03,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:16:03,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:16:03,558 INFO L124 PetriNetUnfolderBase]: 427/858 cut-off events. [2024-06-14 15:16:03,559 INFO L125 PetriNetUnfolderBase]: For 65246/65248 co-relation queries the response was YES. [2024-06-14 15:16:03,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4556 conditions, 858 events. 427/858 cut-off events. For 65246/65248 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4701 event pairs, 65 based on Foata normal form. 12/869 useless extension candidates. Maximal degree in co-relation 4455. Up to 622 conditions per place. [2024-06-14 15:16:03,566 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 134 selfloop transitions, 50 changer transitions 4/191 dead transitions. [2024-06-14 15:16:03,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 191 transitions, 1953 flow [2024-06-14 15:16:03,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:16:03,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:16:03,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 141 transitions. [2024-06-14 15:16:03,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4005681818181818 [2024-06-14 15:16:03,568 INFO L175 Difference]: Start difference. First operand has 223 places, 171 transitions, 1365 flow. Second operand 11 states and 141 transitions. [2024-06-14 15:16:03,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 191 transitions, 1953 flow [2024-06-14 15:16:03,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 191 transitions, 1796 flow, removed 28 selfloop flow, removed 9 redundant places. [2024-06-14 15:16:03,684 INFO L231 Difference]: Finished difference. Result has 225 places, 171 transitions, 1338 flow [2024-06-14 15:16:03,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1208, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1338, PETRI_PLACES=225, PETRI_TRANSITIONS=171} [2024-06-14 15:16:03,685 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 194 predicate places. [2024-06-14 15:16:03,685 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 171 transitions, 1338 flow [2024-06-14 15:16:03,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:16:03,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:16:03,686 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 15:16:03,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-14 15:16:03,686 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:16:03,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:16:03,686 INFO L85 PathProgramCache]: Analyzing trace with hash -357097456, now seen corresponding path program 4 times [2024-06-14 15:16:03,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:16:03,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69683595] [2024-06-14 15:16:03,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:16:03,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:16:03,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:16:10,565 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 15:16:10,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:16:10,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69683595] [2024-06-14 15:16:10,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69683595] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:16:10,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:16:10,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:16:10,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974241527] [2024-06-14 15:16:10,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:16:10,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:16:10,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:16:10,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:16:10,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:16:10,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:16:10,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 171 transitions, 1338 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:16:10,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:16:10,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:16:10,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:16:11,130 INFO L124 PetriNetUnfolderBase]: 437/886 cut-off events. [2024-06-14 15:16:11,131 INFO L125 PetriNetUnfolderBase]: For 67741/67743 co-relation queries the response was YES. [2024-06-14 15:16:11,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4716 conditions, 886 events. 437/886 cut-off events. For 67741/67743 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4916 event pairs, 69 based on Foata normal form. 12/897 useless extension candidates. Maximal degree in co-relation 4614. Up to 648 conditions per place. [2024-06-14 15:16:11,137 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 128 selfloop transitions, 55 changer transitions 4/190 dead transitions. [2024-06-14 15:16:11,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 190 transitions, 1902 flow [2024-06-14 15:16:11,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:16:11,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:16:11,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 140 transitions. [2024-06-14 15:16:11,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3977272727272727 [2024-06-14 15:16:11,139 INFO L175 Difference]: Start difference. First operand has 225 places, 171 transitions, 1338 flow. Second operand 11 states and 140 transitions. [2024-06-14 15:16:11,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 190 transitions, 1902 flow [2024-06-14 15:16:11,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 190 transitions, 1786 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-14 15:16:11,249 INFO L231 Difference]: Finished difference. Result has 227 places, 171 transitions, 1364 flow [2024-06-14 15:16:11,249 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1222, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1364, PETRI_PLACES=227, PETRI_TRANSITIONS=171} [2024-06-14 15:16:11,250 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 196 predicate places. [2024-06-14 15:16:11,250 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 171 transitions, 1364 flow [2024-06-14 15:16:11,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:16:11,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:16:11,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 15:16:11,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-14 15:16:11,250 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:16:11,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:16:11,251 INFO L85 PathProgramCache]: Analyzing trace with hash 411397598, now seen corresponding path program 5 times [2024-06-14 15:16:11,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:16:11,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568841286] [2024-06-14 15:16:11,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:16:11,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:16:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:16:17,046 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 15:16:17,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:16:17,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568841286] [2024-06-14 15:16:17,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568841286] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:16:17,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:16:17,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:16:17,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845979980] [2024-06-14 15:16:17,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:16:17,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:16:17,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:16:17,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:16:17,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:16:17,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:16:17,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 171 transitions, 1364 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:16:17,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:16:17,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:16:17,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:16:17,454 INFO L124 PetriNetUnfolderBase]: 434/883 cut-off events. [2024-06-14 15:16:17,454 INFO L125 PetriNetUnfolderBase]: For 45765/45767 co-relation queries the response was YES. [2024-06-14 15:16:17,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4732 conditions, 883 events. 434/883 cut-off events. For 45765/45767 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4926 event pairs, 69 based on Foata normal form. 3/885 useless extension candidates. Maximal degree in co-relation 4629. Up to 678 conditions per place. [2024-06-14 15:16:17,461 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 128 selfloop transitions, 56 changer transitions 0/187 dead transitions. [2024-06-14 15:16:17,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 187 transitions, 1892 flow [2024-06-14 15:16:17,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:16:17,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:16:17,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2024-06-14 15:16:17,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2024-06-14 15:16:17,462 INFO L175 Difference]: Start difference. First operand has 227 places, 171 transitions, 1364 flow. Second operand 11 states and 136 transitions. [2024-06-14 15:16:17,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 187 transitions, 1892 flow [2024-06-14 15:16:17,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 187 transitions, 1764 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-14 15:16:17,601 INFO L231 Difference]: Finished difference. Result has 229 places, 173 transitions, 1421 flow [2024-06-14 15:16:17,601 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1236, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1421, PETRI_PLACES=229, PETRI_TRANSITIONS=173} [2024-06-14 15:16:17,602 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 198 predicate places. [2024-06-14 15:16:17,602 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 173 transitions, 1421 flow [2024-06-14 15:16:17,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:16:17,602 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:16:17,602 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 15:16:17,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-14 15:16:17,603 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:16:17,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:16:17,603 INFO L85 PathProgramCache]: Analyzing trace with hash 696497778, now seen corresponding path program 5 times [2024-06-14 15:16:17,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:16:17,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897436994] [2024-06-14 15:16:17,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:16:17,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:16:17,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:16:24,669 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 15:16:24,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:16:24,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897436994] [2024-06-14 15:16:24,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897436994] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:16:24,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:16:24,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:16:24,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549060176] [2024-06-14 15:16:24,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:16:24,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:16:24,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:16:24,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:16:24,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:16:24,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:16:24,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 173 transitions, 1421 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:16:24,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:16:24,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:16:24,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:16:25,273 INFO L124 PetriNetUnfolderBase]: 457/930 cut-off events. [2024-06-14 15:16:25,273 INFO L125 PetriNetUnfolderBase]: For 79668/79670 co-relation queries the response was YES. [2024-06-14 15:16:25,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5112 conditions, 930 events. 457/930 cut-off events. For 79668/79670 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 5253 event pairs, 74 based on Foata normal form. 13/942 useless extension candidates. Maximal degree in co-relation 5008. Up to 806 conditions per place. [2024-06-14 15:16:25,280 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 164 selfloop transitions, 16 changer transitions 9/192 dead transitions. [2024-06-14 15:16:25,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 192 transitions, 2007 flow [2024-06-14 15:16:25,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:16:25,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:16:25,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2024-06-14 15:16:25,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-14 15:16:25,281 INFO L175 Difference]: Start difference. First operand has 229 places, 173 transitions, 1421 flow. Second operand 11 states and 132 transitions. [2024-06-14 15:16:25,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 192 transitions, 2007 flow [2024-06-14 15:16:25,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 192 transitions, 1838 flow, removed 30 selfloop flow, removed 9 redundant places. [2024-06-14 15:16:25,424 INFO L231 Difference]: Finished difference. Result has 232 places, 171 transitions, 1314 flow [2024-06-14 15:16:25,425 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1252, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1314, PETRI_PLACES=232, PETRI_TRANSITIONS=171} [2024-06-14 15:16:25,425 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 201 predicate places. [2024-06-14 15:16:25,425 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 171 transitions, 1314 flow [2024-06-14 15:16:25,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:16:25,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:16:25,425 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 15:16:25,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-14 15:16:25,426 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:16:25,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:16:25,426 INFO L85 PathProgramCache]: Analyzing trace with hash 696497468, now seen corresponding path program 6 times [2024-06-14 15:16:25,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:16:25,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889351075] [2024-06-14 15:16:25,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:16:25,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:16:25,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:16:30,717 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 15:16:30,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:16:30,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889351075] [2024-06-14 15:16:30,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889351075] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:16:30,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:16:30,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:16:30,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089414961] [2024-06-14 15:16:30,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:16:30,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:16:30,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:16:30,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:16:30,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:16:30,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:16:30,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 171 transitions, 1314 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:16:30,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:16:30,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:16:30,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:16:31,213 INFO L124 PetriNetUnfolderBase]: 436/885 cut-off events. [2024-06-14 15:16:31,213 INFO L125 PetriNetUnfolderBase]: For 49840/49842 co-relation queries the response was YES. [2024-06-14 15:16:31,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4807 conditions, 885 events. 436/885 cut-off events. For 49840/49842 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4941 event pairs, 70 based on Foata normal form. 1/885 useless extension candidates. Maximal degree in co-relation 4701. Up to 814 conditions per place. [2024-06-14 15:16:31,220 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 164 selfloop transitions, 17 changer transitions 0/184 dead transitions. [2024-06-14 15:16:31,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 184 transitions, 1774 flow [2024-06-14 15:16:31,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:16:31,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:16:31,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2024-06-14 15:16:31,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3522727272727273 [2024-06-14 15:16:31,221 INFO L175 Difference]: Start difference. First operand has 232 places, 171 transitions, 1314 flow. Second operand 11 states and 124 transitions. [2024-06-14 15:16:31,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 184 transitions, 1774 flow [2024-06-14 15:16:31,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 184 transitions, 1701 flow, removed 18 selfloop flow, removed 12 redundant places. [2024-06-14 15:16:31,371 INFO L231 Difference]: Finished difference. Result has 231 places, 173 transitions, 1356 flow [2024-06-14 15:16:31,372 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1243, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1356, PETRI_PLACES=231, PETRI_TRANSITIONS=173} [2024-06-14 15:16:31,372 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 200 predicate places. [2024-06-14 15:16:31,372 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 173 transitions, 1356 flow [2024-06-14 15:16:31,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:16:31,372 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:16:31,372 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 15:16:31,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-14 15:16:31,373 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:16:31,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:16:31,373 INFO L85 PathProgramCache]: Analyzing trace with hash -131969134, now seen corresponding path program 7 times [2024-06-14 15:16:31,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:16:31,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744518058] [2024-06-14 15:16:31,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:16:31,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:16:31,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:16:38,734 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 15:16:38,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:16:38,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744518058] [2024-06-14 15:16:38,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744518058] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:16:38,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:16:38,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:16:38,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681288199] [2024-06-14 15:16:38,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:16:38,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:16:38,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:16:38,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:16:38,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:16:38,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:16:38,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 173 transitions, 1356 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:16:38,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:16:38,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:16:38,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:16:39,196 INFO L124 PetriNetUnfolderBase]: 434/882 cut-off events. [2024-06-14 15:16:39,196 INFO L125 PetriNetUnfolderBase]: For 46868/46870 co-relation queries the response was YES. [2024-06-14 15:16:39,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4647 conditions, 882 events. 434/882 cut-off events. For 46868/46870 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4921 event pairs, 70 based on Foata normal form. 1/882 useless extension candidates. Maximal degree in co-relation 4542. Up to 802 conditions per place. [2024-06-14 15:16:39,203 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 161 selfloop transitions, 23 changer transitions 0/187 dead transitions. [2024-06-14 15:16:39,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 187 transitions, 1826 flow [2024-06-14 15:16:39,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:16:39,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:16:39,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 134 transitions. [2024-06-14 15:16:39,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3489583333333333 [2024-06-14 15:16:39,205 INFO L175 Difference]: Start difference. First operand has 231 places, 173 transitions, 1356 flow. Second operand 12 states and 134 transitions. [2024-06-14 15:16:39,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 187 transitions, 1826 flow [2024-06-14 15:16:39,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 187 transitions, 1729 flow, removed 33 selfloop flow, removed 9 redundant places. [2024-06-14 15:16:39,335 INFO L231 Difference]: Finished difference. Result has 234 places, 175 transitions, 1391 flow [2024-06-14 15:16:39,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1259, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1391, PETRI_PLACES=234, PETRI_TRANSITIONS=175} [2024-06-14 15:16:39,336 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 203 predicate places. [2024-06-14 15:16:39,336 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 175 transitions, 1391 flow [2024-06-14 15:16:39,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:16:39,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:16:39,336 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 15:16:39,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-14 15:16:39,337 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:16:39,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:16:39,337 INFO L85 PathProgramCache]: Analyzing trace with hash -61878256, now seen corresponding path program 6 times [2024-06-14 15:16:39,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:16:39,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140023929] [2024-06-14 15:16:39,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:16:39,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:16:39,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:16:45,998 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 15:16:45,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:16:45,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140023929] [2024-06-14 15:16:45,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140023929] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:16:45,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:16:45,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:16:45,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680017576] [2024-06-14 15:16:45,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:16:45,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:16:45,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:16:46,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:16:46,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:16:46,168 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:16:46,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 175 transitions, 1391 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:16:46,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:16:46,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:16:46,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:16:46,525 INFO L124 PetriNetUnfolderBase]: 438/890 cut-off events. [2024-06-14 15:16:46,525 INFO L125 PetriNetUnfolderBase]: For 51409/51411 co-relation queries the response was YES. [2024-06-14 15:16:46,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4724 conditions, 890 events. 438/890 cut-off events. For 51409/51411 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 4966 event pairs, 72 based on Foata normal form. 2/891 useless extension candidates. Maximal degree in co-relation 4618. Up to 810 conditions per place. [2024-06-14 15:16:46,531 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 166 selfloop transitions, 20 changer transitions 0/189 dead transitions. [2024-06-14 15:16:46,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 189 transitions, 1827 flow [2024-06-14 15:16:46,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:16:46,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:16:46,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 135 transitions. [2024-06-14 15:16:46,532 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3515625 [2024-06-14 15:16:46,532 INFO L175 Difference]: Start difference. First operand has 234 places, 175 transitions, 1391 flow. Second operand 12 states and 135 transitions. [2024-06-14 15:16:46,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 189 transitions, 1827 flow [2024-06-14 15:16:46,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 189 transitions, 1715 flow, removed 36 selfloop flow, removed 10 redundant places. [2024-06-14 15:16:46,672 INFO L231 Difference]: Finished difference. Result has 236 places, 176 transitions, 1359 flow [2024-06-14 15:16:46,672 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1279, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1359, PETRI_PLACES=236, PETRI_TRANSITIONS=176} [2024-06-14 15:16:46,672 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 205 predicate places. [2024-06-14 15:16:46,673 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 176 transitions, 1359 flow [2024-06-14 15:16:46,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:16:46,673 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:16:46,673 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 15:16:46,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-14 15:16:46,673 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:16:46,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:16:46,674 INFO L85 PathProgramCache]: Analyzing trace with hash -61522066, now seen corresponding path program 7 times [2024-06-14 15:16:46,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:16:46,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065301441] [2024-06-14 15:16:46,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:16:46,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:16:46,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:16:53,512 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 15:16:53,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:16:53,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065301441] [2024-06-14 15:16:53,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065301441] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:16:53,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:16:53,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:16:53,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684085747] [2024-06-14 15:16:53,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:16:53,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:16:53,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:16:53,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:16:53,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:16:53,676 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:16:53,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 176 transitions, 1359 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:16:53,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:16:53,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:16:53,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:16:54,019 INFO L124 PetriNetUnfolderBase]: 435/885 cut-off events. [2024-06-14 15:16:54,020 INFO L125 PetriNetUnfolderBase]: For 44025/44027 co-relation queries the response was YES. [2024-06-14 15:16:54,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4445 conditions, 885 events. 435/885 cut-off events. For 44025/44027 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 4948 event pairs, 69 based on Foata normal form. 2/886 useless extension candidates. Maximal degree in co-relation 4338. Up to 785 conditions per place. [2024-06-14 15:16:54,026 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 166 selfloop transitions, 22 changer transitions 0/191 dead transitions. [2024-06-14 15:16:54,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 191 transitions, 1803 flow [2024-06-14 15:16:54,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:16:54,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:16:54,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 135 transitions. [2024-06-14 15:16:54,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3515625 [2024-06-14 15:16:54,028 INFO L175 Difference]: Start difference. First operand has 236 places, 176 transitions, 1359 flow. Second operand 12 states and 135 transitions. [2024-06-14 15:16:54,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 191 transitions, 1803 flow [2024-06-14 15:16:54,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 191 transitions, 1733 flow, removed 16 selfloop flow, removed 10 redundant places. [2024-06-14 15:16:54,156 INFO L231 Difference]: Finished difference. Result has 238 places, 177 transitions, 1375 flow [2024-06-14 15:16:54,157 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1289, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1375, PETRI_PLACES=238, PETRI_TRANSITIONS=177} [2024-06-14 15:16:54,157 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 207 predicate places. [2024-06-14 15:16:54,157 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 177 transitions, 1375 flow [2024-06-14 15:16:54,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:16:54,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:16:54,158 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 15:16:54,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-14 15:16:54,158 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:16:54,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:16:54,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1272483448, now seen corresponding path program 1 times [2024-06-14 15:16:54,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:16:54,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461197678] [2024-06-14 15:16:54,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:16:54,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:16:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:16:59,877 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 15:16:59,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:16:59,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461197678] [2024-06-14 15:16:59,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461197678] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:16:59,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:16:59,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:16:59,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8869653] [2024-06-14 15:16:59,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:16:59,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:16:59,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:16:59,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:16:59,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:17:00,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:17:00,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 177 transitions, 1375 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:17:00,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:17:00,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:17:00,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:17:00,440 INFO L124 PetriNetUnfolderBase]: 439/894 cut-off events. [2024-06-14 15:17:00,441 INFO L125 PetriNetUnfolderBase]: For 44591/44591 co-relation queries the response was YES. [2024-06-14 15:17:00,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4449 conditions, 894 events. 439/894 cut-off events. For 44591/44591 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 5015 event pairs, 50 based on Foata normal form. 2/895 useless extension candidates. Maximal degree in co-relation 4341. Up to 760 conditions per place. [2024-06-14 15:17:00,447 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 177 selfloop transitions, 19 changer transitions 0/199 dead transitions. [2024-06-14 15:17:00,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 199 transitions, 1831 flow [2024-06-14 15:17:00,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:17:00,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:17:00,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2024-06-14 15:17:00,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3693181818181818 [2024-06-14 15:17:00,448 INFO L175 Difference]: Start difference. First operand has 238 places, 177 transitions, 1375 flow. Second operand 11 states and 130 transitions. [2024-06-14 15:17:00,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 199 transitions, 1831 flow [2024-06-14 15:17:00,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 199 transitions, 1755 flow, removed 17 selfloop flow, removed 10 redundant places. [2024-06-14 15:17:00,568 INFO L231 Difference]: Finished difference. Result has 239 places, 178 transitions, 1353 flow [2024-06-14 15:17:00,568 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1299, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1353, PETRI_PLACES=239, PETRI_TRANSITIONS=178} [2024-06-14 15:17:00,568 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 208 predicate places. [2024-06-14 15:17:00,569 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 178 transitions, 1353 flow [2024-06-14 15:17:00,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:17:00,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:17:00,569 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 15:17:00,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-14 15:17:00,569 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:17:00,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:17:00,570 INFO L85 PathProgramCache]: Analyzing trace with hash 531957422, now seen corresponding path program 2 times [2024-06-14 15:17:00,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:17:00,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636471111] [2024-06-14 15:17:00,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:17:00,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:17:00,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:17:05,917 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 15:17:05,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:17:05,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636471111] [2024-06-14 15:17:05,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636471111] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:17:05,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:17:05,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:17:05,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119713030] [2024-06-14 15:17:05,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:17:05,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:17:05,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:17:05,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:17:05,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:17:06,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:17:06,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 178 transitions, 1353 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:17:06,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:17:06,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:17:06,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:17:06,375 INFO L124 PetriNetUnfolderBase]: 450/915 cut-off events. [2024-06-14 15:17:06,375 INFO L125 PetriNetUnfolderBase]: For 51632/51632 co-relation queries the response was YES. [2024-06-14 15:17:06,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4667 conditions, 915 events. 450/915 cut-off events. For 51632/51632 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5146 event pairs, 68 based on Foata normal form. 2/916 useless extension candidates. Maximal degree in co-relation 4558. Up to 772 conditions per place. [2024-06-14 15:17:06,383 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 170 selfloop transitions, 27 changer transitions 0/200 dead transitions. [2024-06-14 15:17:06,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 200 transitions, 1987 flow [2024-06-14 15:17:06,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:17:06,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:17:06,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2024-06-14 15:17:06,384 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2024-06-14 15:17:06,385 INFO L175 Difference]: Start difference. First operand has 239 places, 178 transitions, 1353 flow. Second operand 11 states and 136 transitions. [2024-06-14 15:17:06,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 200 transitions, 1987 flow [2024-06-14 15:17:06,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 200 transitions, 1943 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-14 15:17:06,539 INFO L231 Difference]: Finished difference. Result has 241 places, 180 transitions, 1393 flow [2024-06-14 15:17:06,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1309, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1393, PETRI_PLACES=241, PETRI_TRANSITIONS=180} [2024-06-14 15:17:06,539 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 210 predicate places. [2024-06-14 15:17:06,539 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 180 transitions, 1393 flow [2024-06-14 15:17:06,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:17:06,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:17:06,540 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 15:17:06,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-14 15:17:06,540 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:17:06,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:17:06,540 INFO L85 PathProgramCache]: Analyzing trace with hash 532101572, now seen corresponding path program 3 times [2024-06-14 15:17:06,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:17:06,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245914802] [2024-06-14 15:17:06,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:17:06,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:17:06,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:17:12,427 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 15:17:12,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:17:12,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245914802] [2024-06-14 15:17:12,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245914802] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:17:12,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:17:12,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:17:12,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506974713] [2024-06-14 15:17:12,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:17:12,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:17:12,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:17:12,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:17:12,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:17:12,618 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:17:12,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 180 transitions, 1393 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:17:12,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:17:12,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:17:12,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:17:12,948 INFO L124 PetriNetUnfolderBase]: 454/923 cut-off events. [2024-06-14 15:17:12,948 INFO L125 PetriNetUnfolderBase]: For 53414/53414 co-relation queries the response was YES. [2024-06-14 15:17:12,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4734 conditions, 923 events. 454/923 cut-off events. For 53414/53414 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 5198 event pairs, 70 based on Foata normal form. 2/924 useless extension candidates. Maximal degree in co-relation 4624. Up to 800 conditions per place. [2024-06-14 15:17:12,956 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 169 selfloop transitions, 28 changer transitions 0/200 dead transitions. [2024-06-14 15:17:12,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 200 transitions, 2017 flow [2024-06-14 15:17:12,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:17:12,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:17:12,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2024-06-14 15:17:12,958 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3806818181818182 [2024-06-14 15:17:12,958 INFO L175 Difference]: Start difference. First operand has 241 places, 180 transitions, 1393 flow. Second operand 11 states and 134 transitions. [2024-06-14 15:17:12,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 200 transitions, 2017 flow [2024-06-14 15:17:13,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 200 transitions, 1969 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-14 15:17:13,115 INFO L231 Difference]: Finished difference. Result has 245 places, 181 transitions, 1419 flow [2024-06-14 15:17:13,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1347, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1419, PETRI_PLACES=245, PETRI_TRANSITIONS=181} [2024-06-14 15:17:13,115 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 214 predicate places. [2024-06-14 15:17:13,115 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 181 transitions, 1419 flow [2024-06-14 15:17:13,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:17:13,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:17:13,116 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 15:17:13,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-14 15:17:13,116 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:17:13,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:17:13,116 INFO L85 PathProgramCache]: Analyzing trace with hash -476439344, now seen corresponding path program 4 times [2024-06-14 15:17:13,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:17:13,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427990440] [2024-06-14 15:17:13,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:17:13,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:17:13,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:17:18,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:17:18,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:17:18,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427990440] [2024-06-14 15:17:18,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427990440] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:17:18,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:17:18,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:17:18,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012802647] [2024-06-14 15:17:18,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:17:18,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:17:18,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:17:18,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:17:18,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:17:18,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:17:18,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 181 transitions, 1419 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:17:18,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:17:18,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:17:18,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:17:18,919 INFO L124 PetriNetUnfolderBase]: 458/931 cut-off events. [2024-06-14 15:17:18,919 INFO L125 PetriNetUnfolderBase]: For 54550/54550 co-relation queries the response was YES. [2024-06-14 15:17:18,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4807 conditions, 931 events. 458/931 cut-off events. For 54550/54550 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 5260 event pairs, 68 based on Foata normal form. 2/932 useless extension candidates. Maximal degree in co-relation 4695. Up to 752 conditions per place. [2024-06-14 15:17:18,926 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 172 selfloop transitions, 28 changer transitions 0/203 dead transitions. [2024-06-14 15:17:18,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 203 transitions, 2055 flow [2024-06-14 15:17:18,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:17:18,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:17:18,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2024-06-14 15:17:18,927 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39204545454545453 [2024-06-14 15:17:18,928 INFO L175 Difference]: Start difference. First operand has 245 places, 181 transitions, 1419 flow. Second operand 11 states and 138 transitions. [2024-06-14 15:17:18,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 203 transitions, 2055 flow [2024-06-14 15:17:19,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 203 transitions, 1990 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-14 15:17:19,110 INFO L231 Difference]: Finished difference. Result has 247 places, 182 transitions, 1430 flow [2024-06-14 15:17:19,110 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1354, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1430, PETRI_PLACES=247, PETRI_TRANSITIONS=182} [2024-06-14 15:17:19,110 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 216 predicate places. [2024-06-14 15:17:19,110 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 182 transitions, 1430 flow [2024-06-14 15:17:19,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:17:19,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:17:19,111 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 15:17:19,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-14 15:17:19,111 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:17:19,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:17:19,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1377828432, now seen corresponding path program 5 times [2024-06-14 15:17:19,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:17:19,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196210817] [2024-06-14 15:17:19,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:17:19,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:17:19,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:17:24,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:17:24,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:17:24,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196210817] [2024-06-14 15:17:24,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196210817] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:17:24,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:17:24,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:17:24,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863528296] [2024-06-14 15:17:24,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:17:24,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:17:24,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:17:24,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:17:24,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:17:24,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:17:24,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 182 transitions, 1430 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:17:24,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:17:24,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:17:24,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:17:24,895 INFO L124 PetriNetUnfolderBase]: 455/926 cut-off events. [2024-06-14 15:17:24,895 INFO L125 PetriNetUnfolderBase]: For 48558/48558 co-relation queries the response was YES. [2024-06-14 15:17:24,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4630 conditions, 926 events. 455/926 cut-off events. For 48558/48558 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 5237 event pairs, 73 based on Foata normal form. 2/927 useless extension candidates. Maximal degree in co-relation 4517. Up to 820 conditions per place. [2024-06-14 15:17:24,903 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 169 selfloop transitions, 27 changer transitions 0/199 dead transitions. [2024-06-14 15:17:24,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 199 transitions, 1868 flow [2024-06-14 15:17:24,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:17:24,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:17:24,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 131 transitions. [2024-06-14 15:17:24,904 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3721590909090909 [2024-06-14 15:17:24,904 INFO L175 Difference]: Start difference. First operand has 247 places, 182 transitions, 1430 flow. Second operand 11 states and 131 transitions. [2024-06-14 15:17:24,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 199 transitions, 1868 flow [2024-06-14 15:17:25,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 199 transitions, 1794 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-14 15:17:25,111 INFO L231 Difference]: Finished difference. Result has 249 places, 182 transitions, 1414 flow [2024-06-14 15:17:25,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1356, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1414, PETRI_PLACES=249, PETRI_TRANSITIONS=182} [2024-06-14 15:17:25,111 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 218 predicate places. [2024-06-14 15:17:25,112 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 182 transitions, 1414 flow [2024-06-14 15:17:25,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:17:25,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:17:25,112 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 15:17:25,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-14 15:17:25,112 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:17:25,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:17:25,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1377836368, now seen corresponding path program 1 times [2024-06-14 15:17:25,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:17:25,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8544284] [2024-06-14 15:17:25,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:17:25,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:17:25,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:17:31,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:17:31,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:17:31,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8544284] [2024-06-14 15:17:31,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8544284] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:17:31,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:17:31,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:17:31,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014096510] [2024-06-14 15:17:31,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:17:31,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:17:31,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:17:31,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:17:31,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:17:31,387 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:17:31,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 182 transitions, 1414 flow. Second operand has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:17:31,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:17:31,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:17:31,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:17:31,811 INFO L124 PetriNetUnfolderBase]: 467/954 cut-off events. [2024-06-14 15:17:31,812 INFO L125 PetriNetUnfolderBase]: For 72056/72056 co-relation queries the response was YES. [2024-06-14 15:17:31,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4791 conditions, 954 events. 467/954 cut-off events. For 72056/72056 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 5461 event pairs, 77 based on Foata normal form. 8/961 useless extension candidates. Maximal degree in co-relation 4677. Up to 819 conditions per place. [2024-06-14 15:17:31,819 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 166 selfloop transitions, 25 changer transitions 9/203 dead transitions. [2024-06-14 15:17:31,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 203 transitions, 1938 flow [2024-06-14 15:17:31,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:17:31,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:17:31,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 143 transitions. [2024-06-14 15:17:31,820 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3723958333333333 [2024-06-14 15:17:31,820 INFO L175 Difference]: Start difference. First operand has 249 places, 182 transitions, 1414 flow. Second operand 12 states and 143 transitions. [2024-06-14 15:17:31,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 203 transitions, 1938 flow [2024-06-14 15:17:32,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 203 transitions, 1882 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-14 15:17:32,027 INFO L231 Difference]: Finished difference. Result has 251 places, 179 transitions, 1395 flow [2024-06-14 15:17:32,027 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1358, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1395, PETRI_PLACES=251, PETRI_TRANSITIONS=179} [2024-06-14 15:17:32,027 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 220 predicate places. [2024-06-14 15:17:32,027 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 179 transitions, 1395 flow [2024-06-14 15:17:32,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:17:32,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:17:32,028 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 15:17:32,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-14 15:17:32,028 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:17:32,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:17:32,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1906131442, now seen corresponding path program 6 times [2024-06-14 15:17:32,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:17:32,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603519570] [2024-06-14 15:17:32,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:17:32,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:17:32,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:17:38,409 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 15:17:38,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:17:38,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603519570] [2024-06-14 15:17:38,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603519570] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:17:38,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:17:38,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:17:38,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186069385] [2024-06-14 15:17:38,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:17:38,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:17:38,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:17:38,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:17:38,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:17:38,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:17:38,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 179 transitions, 1395 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:17:38,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:17:38,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:17:38,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:17:38,925 INFO L124 PetriNetUnfolderBase]: 454/927 cut-off events. [2024-06-14 15:17:38,926 INFO L125 PetriNetUnfolderBase]: For 50431/50431 co-relation queries the response was YES. [2024-06-14 15:17:38,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4618 conditions, 927 events. 454/927 cut-off events. For 50431/50431 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 5239 event pairs, 73 based on Foata normal form. 2/928 useless extension candidates. Maximal degree in co-relation 4503. Up to 816 conditions per place. [2024-06-14 15:17:38,932 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 171 selfloop transitions, 22 changer transitions 2/198 dead transitions. [2024-06-14 15:17:38,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 198 transitions, 1888 flow [2024-06-14 15:17:38,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:17:38,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:17:38,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2024-06-14 15:17:38,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-14 15:17:38,934 INFO L175 Difference]: Start difference. First operand has 251 places, 179 transitions, 1395 flow. Second operand 11 states and 132 transitions. [2024-06-14 15:17:38,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 198 transitions, 1888 flow [2024-06-14 15:17:39,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 198 transitions, 1830 flow, removed 4 selfloop flow, removed 11 redundant places. [2024-06-14 15:17:39,123 INFO L231 Difference]: Finished difference. Result has 249 places, 180 transitions, 1412 flow [2024-06-14 15:17:39,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1337, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1412, PETRI_PLACES=249, PETRI_TRANSITIONS=180} [2024-06-14 15:17:39,124 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 218 predicate places. [2024-06-14 15:17:39,124 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 180 transitions, 1412 flow [2024-06-14 15:17:39,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:17:39,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:17:39,124 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 15:17:39,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-14 15:17:39,125 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:17:39,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:17:39,125 INFO L85 PathProgramCache]: Analyzing trace with hash 895803066, now seen corresponding path program 7 times [2024-06-14 15:17:39,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:17:39,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617474936] [2024-06-14 15:17:39,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:17:39,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:17:39,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:17:46,582 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 15:17:46,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:17:46,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617474936] [2024-06-14 15:17:46,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617474936] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:17:46,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:17:46,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:17:46,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906553572] [2024-06-14 15:17:46,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:17:46,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:17:46,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:17:46,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:17:46,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:17:46,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:17:46,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 180 transitions, 1412 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:17:46,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:17:46,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:17:46,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:17:47,112 INFO L124 PetriNetUnfolderBase]: 453/918 cut-off events. [2024-06-14 15:17:47,113 INFO L125 PetriNetUnfolderBase]: For 55575/55575 co-relation queries the response was YES. [2024-06-14 15:17:47,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4705 conditions, 918 events. 453/918 cut-off events. For 55575/55575 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5154 event pairs, 72 based on Foata normal form. 2/919 useless extension candidates. Maximal degree in co-relation 4590. Up to 773 conditions per place. [2024-06-14 15:17:47,119 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 173 selfloop transitions, 24 changer transitions 0/200 dead transitions. [2024-06-14 15:17:47,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 200 transitions, 2060 flow [2024-06-14 15:17:47,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:17:47,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:17:47,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2024-06-14 15:17:47,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835227272727273 [2024-06-14 15:17:47,122 INFO L175 Difference]: Start difference. First operand has 249 places, 180 transitions, 1412 flow. Second operand 11 states and 135 transitions. [2024-06-14 15:17:47,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 200 transitions, 2060 flow [2024-06-14 15:17:47,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 200 transitions, 1987 flow, removed 12 selfloop flow, removed 10 redundant places. [2024-06-14 15:17:47,307 INFO L231 Difference]: Finished difference. Result has 250 places, 182 transitions, 1429 flow [2024-06-14 15:17:47,308 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1339, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1429, PETRI_PLACES=250, PETRI_TRANSITIONS=182} [2024-06-14 15:17:47,308 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 219 predicate places. [2024-06-14 15:17:47,308 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 182 transitions, 1429 flow [2024-06-14 15:17:47,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:17:47,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:17:47,308 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 15:17:47,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-14 15:17:47,309 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:17:47,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:17:47,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1042345028, now seen corresponding path program 8 times [2024-06-14 15:17:47,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:17:47,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938483777] [2024-06-14 15:17:47,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:17:47,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:17:47,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:17:53,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 15:17:53,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:17:53,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938483777] [2024-06-14 15:17:53,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938483777] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:17:53,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:17:53,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:17:53,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765006362] [2024-06-14 15:17:53,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:17:53,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:17:53,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:17:53,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:17:53,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:17:53,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:17:53,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 182 transitions, 1429 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:17:53,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:17:53,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:17:53,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:17:53,673 INFO L124 PetriNetUnfolderBase]: 464/939 cut-off events. [2024-06-14 15:17:53,673 INFO L125 PetriNetUnfolderBase]: For 64382/64382 co-relation queries the response was YES. [2024-06-14 15:17:53,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4989 conditions, 939 events. 464/939 cut-off events. For 64382/64382 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 5297 event pairs, 77 based on Foata normal form. 2/940 useless extension candidates. Maximal degree in co-relation 4874. Up to 808 conditions per place. [2024-06-14 15:17:53,680 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 176 selfloop transitions, 23 changer transitions 0/202 dead transitions. [2024-06-14 15:17:53,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 202 transitions, 2087 flow [2024-06-14 15:17:53,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:17:53,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:17:53,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2024-06-14 15:17:53,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835227272727273 [2024-06-14 15:17:53,681 INFO L175 Difference]: Start difference. First operand has 250 places, 182 transitions, 1429 flow. Second operand 11 states and 135 transitions. [2024-06-14 15:17:53,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 202 transitions, 2087 flow [2024-06-14 15:17:53,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 202 transitions, 2038 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-14 15:17:53,877 INFO L231 Difference]: Finished difference. Result has 254 places, 184 transitions, 1472 flow [2024-06-14 15:17:53,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1380, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1472, PETRI_PLACES=254, PETRI_TRANSITIONS=184} [2024-06-14 15:17:53,878 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 223 predicate places. [2024-06-14 15:17:53,878 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 184 transitions, 1472 flow [2024-06-14 15:17:53,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:17:53,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:17:53,878 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 15:17:53,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-14 15:17:53,879 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:17:53,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:17:53,879 INFO L85 PathProgramCache]: Analyzing trace with hash 43029712, now seen corresponding path program 9 times [2024-06-14 15:17:53,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:17:53,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460875785] [2024-06-14 15:17:53,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:17:53,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:17:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:17:58,992 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 15:17:58,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:17:58,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460875785] [2024-06-14 15:17:58,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460875785] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:17:58,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:17:58,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:17:58,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100627510] [2024-06-14 15:17:58,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:17:58,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:17:58,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:17:58,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:17:58,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:17:59,178 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:17:59,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 184 transitions, 1472 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:17:59,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:17:59,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:17:59,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:17:59,462 INFO L124 PetriNetUnfolderBase]: 461/934 cut-off events. [2024-06-14 15:17:59,462 INFO L125 PetriNetUnfolderBase]: For 57991/57991 co-relation queries the response was YES. [2024-06-14 15:17:59,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4803 conditions, 934 events. 461/934 cut-off events. For 57991/57991 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 5253 event pairs, 78 based on Foata normal form. 2/935 useless extension candidates. Maximal degree in co-relation 4686. Up to 828 conditions per place. [2024-06-14 15:17:59,471 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 175 selfloop transitions, 22 changer transitions 0/200 dead transitions. [2024-06-14 15:17:59,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 200 transitions, 1908 flow [2024-06-14 15:17:59,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:17:59,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:17:59,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 131 transitions. [2024-06-14 15:17:59,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3721590909090909 [2024-06-14 15:17:59,472 INFO L175 Difference]: Start difference. First operand has 254 places, 184 transitions, 1472 flow. Second operand 11 states and 131 transitions. [2024-06-14 15:17:59,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 200 transitions, 1908 flow [2024-06-14 15:17:59,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 200 transitions, 1843 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-14 15:17:59,683 INFO L231 Difference]: Finished difference. Result has 258 places, 184 transitions, 1455 flow [2024-06-14 15:17:59,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1407, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1455, PETRI_PLACES=258, PETRI_TRANSITIONS=184} [2024-06-14 15:17:59,684 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 227 predicate places. [2024-06-14 15:17:59,684 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 184 transitions, 1455 flow [2024-06-14 15:17:59,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:17:59,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:17:59,684 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 15:17:59,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-14 15:17:59,685 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:17:59,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:17:59,685 INFO L85 PathProgramCache]: Analyzing trace with hash 2100070852, now seen corresponding path program 10 times [2024-06-14 15:17:59,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:17:59,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484465794] [2024-06-14 15:17:59,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:17:59,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:17:59,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:18:06,012 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 15:18:06,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:18:06,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484465794] [2024-06-14 15:18:06,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484465794] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:18:06,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:18:06,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:18:06,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641747043] [2024-06-14 15:18:06,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:18:06,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:18:06,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:18:06,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:18:06,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:18:06,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:18:06,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 184 transitions, 1455 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:18:06,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:18:06,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:18:06,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:18:06,517 INFO L124 PetriNetUnfolderBase]: 458/929 cut-off events. [2024-06-14 15:18:06,518 INFO L125 PetriNetUnfolderBase]: For 51046/51046 co-relation queries the response was YES. [2024-06-14 15:18:06,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4577 conditions, 929 events. 458/929 cut-off events. For 51046/51046 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 5256 event pairs, 77 based on Foata normal form. 2/930 useless extension candidates. Maximal degree in co-relation 4458. Up to 823 conditions per place. [2024-06-14 15:18:06,524 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 174 selfloop transitions, 23 changer transitions 0/200 dead transitions. [2024-06-14 15:18:06,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 200 transitions, 1891 flow [2024-06-14 15:18:06,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:18:06,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:18:06,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 131 transitions. [2024-06-14 15:18:06,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3721590909090909 [2024-06-14 15:18:06,525 INFO L175 Difference]: Start difference. First operand has 258 places, 184 transitions, 1455 flow. Second operand 11 states and 131 transitions. [2024-06-14 15:18:06,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 200 transitions, 1891 flow [2024-06-14 15:18:06,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 200 transitions, 1835 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-14 15:18:06,711 INFO L231 Difference]: Finished difference. Result has 259 places, 184 transitions, 1449 flow [2024-06-14 15:18:06,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1399, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1449, PETRI_PLACES=259, PETRI_TRANSITIONS=184} [2024-06-14 15:18:06,712 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 228 predicate places. [2024-06-14 15:18:06,712 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 184 transitions, 1449 flow [2024-06-14 15:18:06,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:18:06,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:18:06,712 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 15:18:06,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-14 15:18:06,712 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:18:06,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:18:06,713 INFO L85 PathProgramCache]: Analyzing trace with hash 900241958, now seen corresponding path program 11 times [2024-06-14 15:18:06,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:18:06,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269364101] [2024-06-14 15:18:06,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:18:06,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:18:06,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:18:13,600 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 15:18:13,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:18:13,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269364101] [2024-06-14 15:18:13,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269364101] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:18:13,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:18:13,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:18:13,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716977091] [2024-06-14 15:18:13,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:18:13,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:18:13,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:18:13,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:18:13,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:18:13,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:18:13,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 184 transitions, 1449 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:18:13,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:18:13,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:18:13,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:18:14,126 INFO L124 PetriNetUnfolderBase]: 462/937 cut-off events. [2024-06-14 15:18:14,126 INFO L125 PetriNetUnfolderBase]: For 52183/52183 co-relation queries the response was YES. [2024-06-14 15:18:14,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4630 conditions, 937 events. 462/937 cut-off events. For 52183/52183 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 5305 event pairs, 75 based on Foata normal form. 2/938 useless extension candidates. Maximal degree in co-relation 4510. Up to 729 conditions per place. [2024-06-14 15:18:14,135 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 173 selfloop transitions, 27 changer transitions 0/203 dead transitions. [2024-06-14 15:18:14,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 203 transitions, 1917 flow [2024-06-14 15:18:14,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:18:14,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:18:14,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2024-06-14 15:18:14,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835227272727273 [2024-06-14 15:18:14,137 INFO L175 Difference]: Start difference. First operand has 259 places, 184 transitions, 1449 flow. Second operand 11 states and 135 transitions. [2024-06-14 15:18:14,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 203 transitions, 1917 flow [2024-06-14 15:18:14,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 203 transitions, 1865 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-06-14 15:18:14,326 INFO L231 Difference]: Finished difference. Result has 260 places, 185 transitions, 1479 flow [2024-06-14 15:18:14,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1397, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1479, PETRI_PLACES=260, PETRI_TRANSITIONS=185} [2024-06-14 15:18:14,327 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 229 predicate places. [2024-06-14 15:18:14,327 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 185 transitions, 1479 flow [2024-06-14 15:18:14,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:18:14,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:18:14,327 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 15:18:14,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-14 15:18:14,327 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:18:14,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:18:14,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1788746650, now seen corresponding path program 2 times [2024-06-14 15:18:14,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:18:14,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565470233] [2024-06-14 15:18:14,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:18:14,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:18:14,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:18:20,747 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 15:18:20,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:18:20,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565470233] [2024-06-14 15:18:20,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565470233] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:18:20,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:18:20,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:18:20,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373000700] [2024-06-14 15:18:20,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:18:20,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:18:20,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:18:20,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:18:20,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:18:20,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:18:20,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 185 transitions, 1479 flow. Second operand has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:18:20,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:18:20,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:18:20,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:18:21,341 INFO L124 PetriNetUnfolderBase]: 474/968 cut-off events. [2024-06-14 15:18:21,342 INFO L125 PetriNetUnfolderBase]: For 76284/76286 co-relation queries the response was YES. [2024-06-14 15:18:21,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4858 conditions, 968 events. 474/968 cut-off events. For 76284/76286 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 5526 event pairs, 89 based on Foata normal form. 8/975 useless extension candidates. Maximal degree in co-relation 4737. Up to 797 conditions per place. [2024-06-14 15:18:21,351 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 154 selfloop transitions, 37 changer transitions 9/203 dead transitions. [2024-06-14 15:18:21,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 203 transitions, 1987 flow [2024-06-14 15:18:21,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:18:21,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:18:21,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 144 transitions. [2024-06-14 15:18:21,352 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-14 15:18:21,352 INFO L175 Difference]: Start difference. First operand has 260 places, 185 transitions, 1479 flow. Second operand 12 states and 144 transitions. [2024-06-14 15:18:21,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 203 transitions, 1987 flow [2024-06-14 15:18:21,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 203 transitions, 1915 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-14 15:18:21,556 INFO L231 Difference]: Finished difference. Result has 263 places, 182 transitions, 1469 flow [2024-06-14 15:18:21,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1407, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1469, PETRI_PLACES=263, PETRI_TRANSITIONS=182} [2024-06-14 15:18:21,557 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 232 predicate places. [2024-06-14 15:18:21,557 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 182 transitions, 1469 flow [2024-06-14 15:18:21,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:18:21,557 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:18:21,557 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 15:18:21,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-14 15:18:21,558 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:18:21,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:18:21,558 INFO L85 PathProgramCache]: Analyzing trace with hash 2107704788, now seen corresponding path program 3 times [2024-06-14 15:18:21,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:18:21,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034367061] [2024-06-14 15:18:21,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:18:21,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:18:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:18:27,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:18:27,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:18:27,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034367061] [2024-06-14 15:18:27,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034367061] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:18:27,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:18:27,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:18:27,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317929956] [2024-06-14 15:18:27,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:18:27,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:18:27,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:18:27,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:18:27,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:18:27,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:18:27,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 182 transitions, 1469 flow. Second operand has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:18:27,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:18:27,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:18:27,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:18:27,620 INFO L124 PetriNetUnfolderBase]: 465/951 cut-off events. [2024-06-14 15:18:27,620 INFO L125 PetriNetUnfolderBase]: For 68963/68965 co-relation queries the response was YES. [2024-06-14 15:18:27,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4748 conditions, 951 events. 465/951 cut-off events. For 68963/68965 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 5419 event pairs, 83 based on Foata normal form. 6/956 useless extension candidates. Maximal degree in co-relation 4626. Up to 787 conditions per place. [2024-06-14 15:18:27,629 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 152 selfloop transitions, 34 changer transitions 11/200 dead transitions. [2024-06-14 15:18:27,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 200 transitions, 1947 flow [2024-06-14 15:18:27,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:18:27,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:18:27,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 142 transitions. [2024-06-14 15:18:27,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3697916666666667 [2024-06-14 15:18:27,630 INFO L175 Difference]: Start difference. First operand has 263 places, 182 transitions, 1469 flow. Second operand 12 states and 142 transitions. [2024-06-14 15:18:27,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 200 transitions, 1947 flow [2024-06-14 15:18:27,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 200 transitions, 1863 flow, removed 5 selfloop flow, removed 11 redundant places. [2024-06-14 15:18:27,839 INFO L231 Difference]: Finished difference. Result has 261 places, 178 transitions, 1430 flow [2024-06-14 15:18:27,839 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1387, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1430, PETRI_PLACES=261, PETRI_TRANSITIONS=178} [2024-06-14 15:18:27,840 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 230 predicate places. [2024-06-14 15:18:27,840 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 178 transitions, 1430 flow [2024-06-14 15:18:27,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:18:27,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:18:27,840 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 15:18:27,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-14 15:18:27,840 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:18:27,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:18:27,841 INFO L85 PathProgramCache]: Analyzing trace with hash 869589110, now seen corresponding path program 12 times [2024-06-14 15:18:27,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:18:27,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031733507] [2024-06-14 15:18:27,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:18:27,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:18:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:18:33,418 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 15:18:33,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:18:33,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031733507] [2024-06-14 15:18:33,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031733507] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:18:33,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:18:33,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:18:33,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030306146] [2024-06-14 15:18:33,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:18:33,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:18:33,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:18:33,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:18:33,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:18:33,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:18:33,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 178 transitions, 1430 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:18:33,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:18:33,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:18:33,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:18:33,874 INFO L124 PetriNetUnfolderBase]: 466/944 cut-off events. [2024-06-14 15:18:33,874 INFO L125 PetriNetUnfolderBase]: For 61720/61722 co-relation queries the response was YES. [2024-06-14 15:18:33,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4899 conditions, 944 events. 466/944 cut-off events. For 61720/61722 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 5319 event pairs, 85 based on Foata normal form. 4/947 useless extension candidates. Maximal degree in co-relation 4778. Up to 738 conditions per place. [2024-06-14 15:18:33,883 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 149 selfloop transitions, 46 changer transitions 2/200 dead transitions. [2024-06-14 15:18:33,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 200 transitions, 2154 flow [2024-06-14 15:18:33,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:18:33,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:18:33,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 143 transitions. [2024-06-14 15:18:33,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-14 15:18:33,885 INFO L175 Difference]: Start difference. First operand has 261 places, 178 transitions, 1430 flow. Second operand 11 states and 143 transitions. [2024-06-14 15:18:33,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 200 transitions, 2154 flow [2024-06-14 15:18:34,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 200 transitions, 2044 flow, removed 21 selfloop flow, removed 12 redundant places. [2024-06-14 15:18:34,094 INFO L231 Difference]: Finished difference. Result has 255 places, 183 transitions, 1533 flow [2024-06-14 15:18:34,094 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1336, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1533, PETRI_PLACES=255, PETRI_TRANSITIONS=183} [2024-06-14 15:18:34,094 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 224 predicate places. [2024-06-14 15:18:34,094 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 183 transitions, 1533 flow [2024-06-14 15:18:34,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:18:34,095 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:18:34,095 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 15:18:34,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-14 15:18:34,095 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:18:34,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:18:34,095 INFO L85 PathProgramCache]: Analyzing trace with hash 869594690, now seen corresponding path program 13 times [2024-06-14 15:18:34,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:18:34,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546732221] [2024-06-14 15:18:34,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:18:34,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:18:34,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:18:40,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:18:40,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:18:40,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546732221] [2024-06-14 15:18:40,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546732221] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:18:40,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:18:40,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:18:40,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351907493] [2024-06-14 15:18:40,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:18:40,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:18:40,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:18:40,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:18:40,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:18:40,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:18:40,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 183 transitions, 1533 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:18:40,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:18:40,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:18:40,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:18:40,574 INFO L124 PetriNetUnfolderBase]: 459/935 cut-off events. [2024-06-14 15:18:40,574 INFO L125 PetriNetUnfolderBase]: For 49722/49724 co-relation queries the response was YES. [2024-06-14 15:18:40,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4615 conditions, 935 events. 459/935 cut-off events. For 49722/49724 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5323 event pairs, 86 based on Foata normal form. 4/938 useless extension candidates. Maximal degree in co-relation 4496. Up to 746 conditions per place. [2024-06-14 15:18:40,582 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 148 selfloop transitions, 45 changer transitions 0/196 dead transitions. [2024-06-14 15:18:40,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 196 transitions, 1953 flow [2024-06-14 15:18:40,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:18:40,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:18:40,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2024-06-14 15:18:40,584 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39204545454545453 [2024-06-14 15:18:40,584 INFO L175 Difference]: Start difference. First operand has 255 places, 183 transitions, 1533 flow. Second operand 11 states and 138 transitions. [2024-06-14 15:18:40,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 196 transitions, 1953 flow [2024-06-14 15:18:40,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 196 transitions, 1847 flow, removed 34 selfloop flow, removed 4 redundant places. [2024-06-14 15:18:40,769 INFO L231 Difference]: Finished difference. Result has 262 places, 183 transitions, 1521 flow [2024-06-14 15:18:40,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1427, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1521, PETRI_PLACES=262, PETRI_TRANSITIONS=183} [2024-06-14 15:18:40,778 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 231 predicate places. [2024-06-14 15:18:40,778 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 183 transitions, 1521 flow [2024-06-14 15:18:40,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:18:40,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:18:40,779 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 15:18:40,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-14 15:18:40,779 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:18:40,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:18:40,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1231482442, now seen corresponding path program 14 times [2024-06-14 15:18:40,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:18:40,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220894039] [2024-06-14 15:18:40,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:18:40,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:18:40,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:18:47,079 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 15:18:47,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:18:47,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220894039] [2024-06-14 15:18:47,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220894039] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:18:47,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:18:47,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:18:47,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144581805] [2024-06-14 15:18:47,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:18:47,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:18:47,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:18:47,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:18:47,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:18:47,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:18:47,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 183 transitions, 1521 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:18:47,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:18:47,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:18:47,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:18:47,645 INFO L124 PetriNetUnfolderBase]: 470/957 cut-off events. [2024-06-14 15:18:47,645 INFO L125 PetriNetUnfolderBase]: For 58386/58390 co-relation queries the response was YES. [2024-06-14 15:18:47,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4938 conditions, 957 events. 470/957 cut-off events. For 58386/58390 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5464 event pairs, 92 based on Foata normal form. 2/957 useless extension candidates. Maximal degree in co-relation 4817. Up to 694 conditions per place. [2024-06-14 15:18:47,655 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 137 selfloop transitions, 60 changer transitions 3/203 dead transitions. [2024-06-14 15:18:47,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 203 transitions, 2213 flow [2024-06-14 15:18:47,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:18:47,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:18:47,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 143 transitions. [2024-06-14 15:18:47,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-14 15:18:47,657 INFO L175 Difference]: Start difference. First operand has 262 places, 183 transitions, 1521 flow. Second operand 11 states and 143 transitions. [2024-06-14 15:18:47,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 203 transitions, 2213 flow [2024-06-14 15:18:47,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 203 transitions, 2114 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-14 15:18:47,880 INFO L231 Difference]: Finished difference. Result has 263 places, 185 transitions, 1602 flow [2024-06-14 15:18:47,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1428, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1602, PETRI_PLACES=263, PETRI_TRANSITIONS=185} [2024-06-14 15:18:47,881 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 232 predicate places. [2024-06-14 15:18:47,881 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 185 transitions, 1602 flow [2024-06-14 15:18:47,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:18:47,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:18:47,882 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 15:18:47,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-14 15:18:47,882 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:18:47,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:18:47,883 INFO L85 PathProgramCache]: Analyzing trace with hash 11309226, now seen corresponding path program 15 times [2024-06-14 15:18:47,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:18:47,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725265623] [2024-06-14 15:18:47,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:18:47,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:18:47,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:18:53,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:18:53,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:18:53,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725265623] [2024-06-14 15:18:53,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725265623] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:18:53,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:18:53,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:18:53,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044804287] [2024-06-14 15:18:53,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:18:53,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:18:53,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:18:53,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:18:53,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:18:53,747 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:18:53,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 185 transitions, 1602 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:18:53,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:18:53,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:18:53,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:18:54,096 INFO L124 PetriNetUnfolderBase]: 441/889 cut-off events. [2024-06-14 15:18:54,097 INFO L125 PetriNetUnfolderBase]: For 58227/58229 co-relation queries the response was YES. [2024-06-14 15:18:54,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4653 conditions, 889 events. 441/889 cut-off events. For 58227/58229 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 4986 event pairs, 77 based on Foata normal form. 4/892 useless extension candidates. Maximal degree in co-relation 4531. Up to 683 conditions per place. [2024-06-14 15:18:54,105 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 148 selfloop transitions, 50 changer transitions 0/201 dead transitions. [2024-06-14 15:18:54,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 201 transitions, 2242 flow [2024-06-14 15:18:54,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:18:54,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:18:54,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2024-06-14 15:18:54,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39204545454545453 [2024-06-14 15:18:54,106 INFO L175 Difference]: Start difference. First operand has 263 places, 185 transitions, 1602 flow. Second operand 11 states and 138 transitions. [2024-06-14 15:18:54,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 201 transitions, 2242 flow [2024-06-14 15:18:54,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 201 transitions, 2084 flow, removed 42 selfloop flow, removed 6 redundant places. [2024-06-14 15:18:54,287 INFO L231 Difference]: Finished difference. Result has 268 places, 186 transitions, 1574 flow [2024-06-14 15:18:54,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1454, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1574, PETRI_PLACES=268, PETRI_TRANSITIONS=186} [2024-06-14 15:18:54,287 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 237 predicate places. [2024-06-14 15:18:54,288 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 186 transitions, 1574 flow [2024-06-14 15:18:54,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:18:54,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:18:54,288 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 15:18:54,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-14 15:18:54,288 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:18:54,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:18:54,289 INFO L85 PathProgramCache]: Analyzing trace with hash 11516616, now seen corresponding path program 16 times [2024-06-14 15:18:54,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:18:54,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582124489] [2024-06-14 15:18:54,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:18:54,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:18:54,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:19:00,067 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 15:19:00,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:19:00,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582124489] [2024-06-14 15:19:00,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582124489] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:19:00,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:19:00,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:19:00,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367948884] [2024-06-14 15:19:00,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:19:00,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:19:00,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:19:00,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:19:00,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:19:00,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:19:00,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 186 transitions, 1574 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:19:00,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:19:00,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:19:00,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:19:00,457 INFO L124 PetriNetUnfolderBase]: 438/888 cut-off events. [2024-06-14 15:19:00,458 INFO L125 PetriNetUnfolderBase]: For 50052/50054 co-relation queries the response was YES. [2024-06-14 15:19:00,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4355 conditions, 888 events. 438/888 cut-off events. For 50052/50054 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 4999 event pairs, 80 based on Foata normal form. 4/891 useless extension candidates. Maximal degree in co-relation 4232. Up to 695 conditions per place. [2024-06-14 15:19:00,465 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 147 selfloop transitions, 49 changer transitions 0/199 dead transitions. [2024-06-14 15:19:00,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 199 transitions, 2000 flow [2024-06-14 15:19:00,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:19:00,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:19:00,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2024-06-14 15:19:00,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835227272727273 [2024-06-14 15:19:00,467 INFO L175 Difference]: Start difference. First operand has 268 places, 186 transitions, 1574 flow. Second operand 11 states and 135 transitions. [2024-06-14 15:19:00,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 199 transitions, 2000 flow [2024-06-14 15:19:00,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 199 transitions, 1875 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-06-14 15:19:00,616 INFO L231 Difference]: Finished difference. Result has 270 places, 186 transitions, 1551 flow [2024-06-14 15:19:00,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1449, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1551, PETRI_PLACES=270, PETRI_TRANSITIONS=186} [2024-06-14 15:19:00,617 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 239 predicate places. [2024-06-14 15:19:00,617 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 186 transitions, 1551 flow [2024-06-14 15:19:00,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:19:00,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:19:00,617 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 15:19:00,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-14 15:19:00,618 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:19:00,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:19:00,618 INFO L85 PathProgramCache]: Analyzing trace with hash -70546216, now seen corresponding path program 17 times [2024-06-14 15:19:00,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:19:00,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331297904] [2024-06-14 15:19:00,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:19:00,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:19:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:19:05,918 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 15:19:05,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:19:05,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331297904] [2024-06-14 15:19:05,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331297904] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:19:05,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:19:05,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:19:05,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633471224] [2024-06-14 15:19:05,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:19:05,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:19:05,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:19:05,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:19:05,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:19:06,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:19:06,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 186 transitions, 1551 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:19:06,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:19:06,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:19:06,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:19:06,323 INFO L124 PetriNetUnfolderBase]: 450/914 cut-off events. [2024-06-14 15:19:06,323 INFO L125 PetriNetUnfolderBase]: For 59861/59863 co-relation queries the response was YES. [2024-06-14 15:19:06,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4682 conditions, 914 events. 450/914 cut-off events. For 59861/59863 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 5190 event pairs, 81 based on Foata normal form. 4/917 useless extension candidates. Maximal degree in co-relation 4558. Up to 701 conditions per place. [2024-06-14 15:19:06,334 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 151 selfloop transitions, 50 changer transitions 0/204 dead transitions. [2024-06-14 15:19:06,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 204 transitions, 2237 flow [2024-06-14 15:19:06,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:19:06,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:19:06,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 137 transitions. [2024-06-14 15:19:06,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38920454545454547 [2024-06-14 15:19:06,337 INFO L175 Difference]: Start difference. First operand has 270 places, 186 transitions, 1551 flow. Second operand 11 states and 137 transitions. [2024-06-14 15:19:06,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 204 transitions, 2237 flow [2024-06-14 15:19:06,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 204 transitions, 2134 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-14 15:19:06,513 INFO L231 Difference]: Finished difference. Result has 271 places, 189 transitions, 1616 flow [2024-06-14 15:19:06,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1450, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1616, PETRI_PLACES=271, PETRI_TRANSITIONS=189} [2024-06-14 15:19:06,514 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 240 predicate places. [2024-06-14 15:19:06,514 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 189 transitions, 1616 flow [2024-06-14 15:19:06,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:19:06,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:19:06,514 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 15:19:06,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-14 15:19:06,515 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:19:06,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:19:06,515 INFO L85 PathProgramCache]: Analyzing trace with hash -136300374, now seen corresponding path program 18 times [2024-06-14 15:19:06,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:19:06,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257451409] [2024-06-14 15:19:06,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:19:06,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:19:06,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:19:12,351 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 15:19:12,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:19:12,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257451409] [2024-06-14 15:19:12,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257451409] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:19:12,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:19:12,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:19:12,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750533230] [2024-06-14 15:19:12,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:19:12,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:19:12,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:19:12,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:19:12,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:19:12,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:19:12,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 189 transitions, 1616 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:19:12,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:19:12,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:19:12,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:19:12,855 INFO L124 PetriNetUnfolderBase]: 454/922 cut-off events. [2024-06-14 15:19:12,855 INFO L125 PetriNetUnfolderBase]: For 61530/61532 co-relation queries the response was YES. [2024-06-14 15:19:12,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4777 conditions, 922 events. 454/922 cut-off events. For 61530/61532 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 5254 event pairs, 79 based on Foata normal form. 4/925 useless extension candidates. Maximal degree in co-relation 4652. Up to 538 conditions per place. [2024-06-14 15:19:12,863 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 146 selfloop transitions, 58 changer transitions 0/207 dead transitions. [2024-06-14 15:19:12,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 207 transitions, 2280 flow [2024-06-14 15:19:12,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:19:12,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:19:12,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 140 transitions. [2024-06-14 15:19:12,865 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3977272727272727 [2024-06-14 15:19:12,865 INFO L175 Difference]: Start difference. First operand has 271 places, 189 transitions, 1616 flow. Second operand 11 states and 140 transitions. [2024-06-14 15:19:12,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 207 transitions, 2280 flow [2024-06-14 15:19:13,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 207 transitions, 2170 flow, removed 19 selfloop flow, removed 6 redundant places. [2024-06-14 15:19:13,054 INFO L231 Difference]: Finished difference. Result has 276 places, 190 transitions, 1654 flow [2024-06-14 15:19:13,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1506, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1654, PETRI_PLACES=276, PETRI_TRANSITIONS=190} [2024-06-14 15:19:13,054 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 245 predicate places. [2024-06-14 15:19:13,055 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 190 transitions, 1654 flow [2024-06-14 15:19:13,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:19:13,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:19:13,055 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 15:19:13,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-14 15:19:13,055 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:19:13,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:19:13,056 INFO L85 PathProgramCache]: Analyzing trace with hash 864082580, now seen corresponding path program 19 times [2024-06-14 15:19:13,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:19:13,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141969002] [2024-06-14 15:19:13,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:19:13,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:19:13,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:19:18,386 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 15:19:18,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:19:18,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141969002] [2024-06-14 15:19:18,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141969002] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:19:18,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:19:18,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:19:18,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647273321] [2024-06-14 15:19:18,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:19:18,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:19:18,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:19:18,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:19:18,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:19:18,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:19:18,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 190 transitions, 1654 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:19:18,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:19:18,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:19:18,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:19:18,875 INFO L124 PetriNetUnfolderBase]: 465/943 cut-off events. [2024-06-14 15:19:18,876 INFO L125 PetriNetUnfolderBase]: For 71989/71991 co-relation queries the response was YES. [2024-06-14 15:19:18,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5174 conditions, 943 events. 465/943 cut-off events. For 71989/71991 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 5408 event pairs, 84 based on Foata normal form. 4/946 useless extension candidates. Maximal degree in co-relation 5048. Up to 692 conditions per place. [2024-06-14 15:19:18,884 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 156 selfloop transitions, 49 changer transitions 0/208 dead transitions. [2024-06-14 15:19:18,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 208 transitions, 2352 flow [2024-06-14 15:19:18,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:19:18,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:19:18,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 142 transitions. [2024-06-14 15:19:18,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4034090909090909 [2024-06-14 15:19:18,885 INFO L175 Difference]: Start difference. First operand has 276 places, 190 transitions, 1654 flow. Second operand 11 states and 142 transitions. [2024-06-14 15:19:18,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 208 transitions, 2352 flow [2024-06-14 15:19:19,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 208 transitions, 2179 flow, removed 25 selfloop flow, removed 11 redundant places. [2024-06-14 15:19:19,091 INFO L231 Difference]: Finished difference. Result has 276 places, 192 transitions, 1645 flow [2024-06-14 15:19:19,091 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1499, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1645, PETRI_PLACES=276, PETRI_TRANSITIONS=192} [2024-06-14 15:19:19,091 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 245 predicate places. [2024-06-14 15:19:19,091 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 192 transitions, 1645 flow [2024-06-14 15:19:19,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:19:19,092 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:19:19,092 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 15:19:19,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-14 15:19:19,092 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:19:19,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:19:19,092 INFO L85 PathProgramCache]: Analyzing trace with hash -70540636, now seen corresponding path program 20 times [2024-06-14 15:19:19,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:19:19,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086017237] [2024-06-14 15:19:19,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:19:19,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:19:19,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:19:25,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:19:25,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:19:25,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086017237] [2024-06-14 15:19:25,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086017237] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:19:25,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:19:25,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:19:25,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037890642] [2024-06-14 15:19:25,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:19:25,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:19:25,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:19:25,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:19:25,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:19:25,268 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:19:25,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 192 transitions, 1645 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:19:25,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:19:25,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:19:25,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:19:25,543 INFO L124 PetriNetUnfolderBase]: 462/936 cut-off events. [2024-06-14 15:19:25,543 INFO L125 PetriNetUnfolderBase]: For 63667/63669 co-relation queries the response was YES. [2024-06-14 15:19:25,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4769 conditions, 936 events. 462/936 cut-off events. For 63667/63669 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 5349 event pairs, 87 based on Foata normal form. 4/939 useless extension candidates. Maximal degree in co-relation 4645. Up to 742 conditions per place. [2024-06-14 15:19:25,552 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 153 selfloop transitions, 49 changer transitions 0/205 dead transitions. [2024-06-14 15:19:25,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 205 transitions, 2083 flow [2024-06-14 15:19:25,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:19:25,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:19:25,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2024-06-14 15:19:25,553 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3806818181818182 [2024-06-14 15:19:25,553 INFO L175 Difference]: Start difference. First operand has 276 places, 192 transitions, 1645 flow. Second operand 11 states and 134 transitions. [2024-06-14 15:19:25,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 205 transitions, 2083 flow [2024-06-14 15:19:25,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 205 transitions, 1989 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-14 15:19:25,747 INFO L231 Difference]: Finished difference. Result has 280 places, 192 transitions, 1653 flow [2024-06-14 15:19:25,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1551, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1653, PETRI_PLACES=280, PETRI_TRANSITIONS=192} [2024-06-14 15:19:25,747 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 249 predicate places. [2024-06-14 15:19:25,748 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 192 transitions, 1653 flow [2024-06-14 15:19:25,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:19:25,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:19:25,748 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 15:19:25,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-14 15:19:25,748 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:19:25,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:19:25,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1063735910, now seen corresponding path program 21 times [2024-06-14 15:19:25,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:19:25,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766520539] [2024-06-14 15:19:25,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:19:25,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:19:25,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:19:31,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:19:31,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:19:31,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766520539] [2024-06-14 15:19:31,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766520539] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:19:31,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:19:31,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:19:31,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959468426] [2024-06-14 15:19:31,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:19:31,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:19:31,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:19:31,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:19:31,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:19:31,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:19:31,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 192 transitions, 1653 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:19:31,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:19:31,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:19:31,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:19:31,587 INFO L124 PetriNetUnfolderBase]: 467/949 cut-off events. [2024-06-14 15:19:31,587 INFO L125 PetriNetUnfolderBase]: For 64653/64655 co-relation queries the response was YES. [2024-06-14 15:19:31,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4855 conditions, 949 events. 467/949 cut-off events. For 64653/64655 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5468 event pairs, 89 based on Foata normal form. 4/952 useless extension candidates. Maximal degree in co-relation 4729. Up to 752 conditions per place. [2024-06-14 15:19:31,596 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 156 selfloop transitions, 48 changer transitions 0/207 dead transitions. [2024-06-14 15:19:31,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 207 transitions, 2127 flow [2024-06-14 15:19:31,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:19:31,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:19:31,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 137 transitions. [2024-06-14 15:19:31,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38920454545454547 [2024-06-14 15:19:31,598 INFO L175 Difference]: Start difference. First operand has 280 places, 192 transitions, 1653 flow. Second operand 11 states and 137 transitions. [2024-06-14 15:19:31,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 207 transitions, 2127 flow [2024-06-14 15:19:31,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 207 transitions, 2024 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-14 15:19:31,800 INFO L231 Difference]: Finished difference. Result has 281 places, 194 transitions, 1684 flow [2024-06-14 15:19:31,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1552, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1684, PETRI_PLACES=281, PETRI_TRANSITIONS=194} [2024-06-14 15:19:31,800 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 250 predicate places. [2024-06-14 15:19:31,800 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 194 transitions, 1684 flow [2024-06-14 15:19:31,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:19:31,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:19:31,801 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 15:19:31,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-14 15:19:31,801 INFO L420 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:19:31,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:19:31,801 INFO L85 PathProgramCache]: Analyzing trace with hash -35228468, now seen corresponding path program 22 times [2024-06-14 15:19:31,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:19:31,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010856877] [2024-06-14 15:19:31,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:19:31,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:19:31,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:19:36,851 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 15:19:36,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:19:36,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010856877] [2024-06-14 15:19:36,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010856877] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:19:36,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:19:36,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:19:36,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472239415] [2024-06-14 15:19:36,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:19:36,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:19:36,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:19:36,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:19:36,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:19:36,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:19:36,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 194 transitions, 1684 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:19:36,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:19:36,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:19:36,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:19:37,380 INFO L124 PetriNetUnfolderBase]: 471/959 cut-off events. [2024-06-14 15:19:37,381 INFO L125 PetriNetUnfolderBase]: For 66180/66182 co-relation queries the response was YES. [2024-06-14 15:19:37,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4924 conditions, 959 events. 471/959 cut-off events. For 66180/66182 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 5532 event pairs, 87 based on Foata normal form. 4/962 useless extension candidates. Maximal degree in co-relation 4797. Up to 737 conditions per place. [2024-06-14 15:19:37,389 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 157 selfloop transitions, 50 changer transitions 0/210 dead transitions. [2024-06-14 15:19:37,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 210 transitions, 2351 flow [2024-06-14 15:19:37,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:19:37,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:19:37,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 140 transitions. [2024-06-14 15:19:37,391 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3977272727272727 [2024-06-14 15:19:37,392 INFO L175 Difference]: Start difference. First operand has 281 places, 194 transitions, 1684 flow. Second operand 11 states and 140 transitions. [2024-06-14 15:19:37,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 210 transitions, 2351 flow [2024-06-14 15:19:37,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 210 transitions, 2250 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-14 15:19:37,597 INFO L231 Difference]: Finished difference. Result has 285 places, 195 transitions, 1708 flow [2024-06-14 15:19:37,597 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1583, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1708, PETRI_PLACES=285, PETRI_TRANSITIONS=195} [2024-06-14 15:19:37,598 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 254 predicate places. [2024-06-14 15:19:37,598 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 195 transitions, 1708 flow [2024-06-14 15:19:37,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:19:37,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:19:37,598 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 15:19:37,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-06-14 15:19:37,599 INFO L420 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:19:37,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:19:37,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1457504874, now seen corresponding path program 23 times [2024-06-14 15:19:37,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:19:37,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481958393] [2024-06-14 15:19:37,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:19:37,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:19:37,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:19:42,991 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 15:19:42,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:19:42,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481958393] [2024-06-14 15:19:42,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481958393] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:19:42,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:19:42,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:19:42,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168342797] [2024-06-14 15:19:42,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:19:42,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:19:42,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:19:42,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:19:42,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:19:43,149 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:19:43,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 195 transitions, 1708 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:19:43,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:19:43,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:19:43,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:19:43,438 INFO L124 PetriNetUnfolderBase]: 475/967 cut-off events. [2024-06-14 15:19:43,439 INFO L125 PetriNetUnfolderBase]: For 67691/67693 co-relation queries the response was YES. [2024-06-14 15:19:43,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4983 conditions, 967 events. 475/967 cut-off events. For 67691/67693 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 5611 event pairs, 85 based on Foata normal form. 4/970 useless extension candidates. Maximal degree in co-relation 4855. Up to 701 conditions per place. [2024-06-14 15:19:43,448 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 156 selfloop transitions, 53 changer transitions 0/212 dead transitions. [2024-06-14 15:19:43,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 212 transitions, 2383 flow [2024-06-14 15:19:43,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:19:43,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:19:43,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2024-06-14 15:19:43,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39204545454545453 [2024-06-14 15:19:43,451 INFO L175 Difference]: Start difference. First operand has 285 places, 195 transitions, 1708 flow. Second operand 11 states and 138 transitions. [2024-06-14 15:19:43,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 212 transitions, 2383 flow [2024-06-14 15:19:43,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 212 transitions, 2230 flow, removed 9 selfloop flow, removed 10 redundant places. [2024-06-14 15:19:43,678 INFO L231 Difference]: Finished difference. Result has 286 places, 196 transitions, 1686 flow [2024-06-14 15:19:43,678 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1555, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1686, PETRI_PLACES=286, PETRI_TRANSITIONS=196} [2024-06-14 15:19:43,678 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 255 predicate places. [2024-06-14 15:19:43,679 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 196 transitions, 1686 flow [2024-06-14 15:19:43,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:19:43,679 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:19:43,679 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 15:19:43,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-06-14 15:19:43,679 INFO L420 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:19:43,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:19:43,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1664308044, now seen corresponding path program 24 times [2024-06-14 15:19:43,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:19:43,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388897020] [2024-06-14 15:19:43,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:19:43,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:19:43,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:19:49,817 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 15:19:49,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:19:49,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388897020] [2024-06-14 15:19:49,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388897020] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:19:49,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:19:49,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:19:49,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731056541] [2024-06-14 15:19:49,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:19:49,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:19:49,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:19:49,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:19:49,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:19:49,994 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:19:49,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 196 transitions, 1686 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:19:49,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:19:49,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:19:49,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:19:50,445 INFO L124 PetriNetUnfolderBase]: 480/978 cut-off events. [2024-06-14 15:19:50,445 INFO L125 PetriNetUnfolderBase]: For 69140/69142 co-relation queries the response was YES. [2024-06-14 15:19:50,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4979 conditions, 978 events. 480/978 cut-off events. For 69140/69142 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 5708 event pairs, 89 based on Foata normal form. 4/981 useless extension candidates. Maximal degree in co-relation 4851. Up to 778 conditions per place. [2024-06-14 15:19:50,455 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 158 selfloop transitions, 51 changer transitions 0/212 dead transitions. [2024-06-14 15:19:50,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 212 transitions, 2187 flow [2024-06-14 15:19:50,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:19:50,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:19:50,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2024-06-14 15:19:50,457 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2024-06-14 15:19:50,458 INFO L175 Difference]: Start difference. First operand has 286 places, 196 transitions, 1686 flow. Second operand 11 states and 136 transitions. [2024-06-14 15:19:50,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 212 transitions, 2187 flow [2024-06-14 15:19:50,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 212 transitions, 1960 flow, removed 13 selfloop flow, removed 11 redundant places. [2024-06-14 15:19:50,683 INFO L231 Difference]: Finished difference. Result has 287 places, 199 transitions, 1625 flow [2024-06-14 15:19:50,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1471, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1625, PETRI_PLACES=287, PETRI_TRANSITIONS=199} [2024-06-14 15:19:50,683 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 256 predicate places. [2024-06-14 15:19:50,683 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 199 transitions, 1625 flow [2024-06-14 15:19:50,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:19:50,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:19:50,684 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 15:19:50,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-06-14 15:19:50,684 INFO L420 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:19:50,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:19:50,684 INFO L85 PathProgramCache]: Analyzing trace with hash -27871238, now seen corresponding path program 25 times [2024-06-14 15:19:50,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:19:50,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036110069] [2024-06-14 15:19:50,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:19:50,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:19:50,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:19:56,630 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 15:19:56,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:19:56,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036110069] [2024-06-14 15:19:56,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036110069] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:19:56,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:19:56,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:19:56,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794805044] [2024-06-14 15:19:56,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:19:56,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:19:56,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:19:56,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:19:56,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:19:56,804 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:19:56,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 199 transitions, 1625 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:19:56,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:19:56,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:19:56,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:19:57,211 INFO L124 PetriNetUnfolderBase]: 477/973 cut-off events. [2024-06-14 15:19:57,212 INFO L125 PetriNetUnfolderBase]: For 60179/60181 co-relation queries the response was YES. [2024-06-14 15:19:57,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4524 conditions, 973 events. 477/973 cut-off events. For 60179/60181 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 5663 event pairs, 88 based on Foata normal form. 4/976 useless extension candidates. Maximal degree in co-relation 4396. Up to 773 conditions per place. [2024-06-14 15:19:57,222 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 158 selfloop transitions, 51 changer transitions 0/212 dead transitions. [2024-06-14 15:19:57,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 212 transitions, 2077 flow [2024-06-14 15:19:57,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:19:57,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:19:57,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 137 transitions. [2024-06-14 15:19:57,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38920454545454547 [2024-06-14 15:19:57,225 INFO L175 Difference]: Start difference. First operand has 287 places, 199 transitions, 1625 flow. Second operand 11 states and 137 transitions. [2024-06-14 15:19:57,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 212 transitions, 2077 flow [2024-06-14 15:19:57,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 212 transitions, 1945 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-14 15:19:57,441 INFO L231 Difference]: Finished difference. Result has 290 places, 199 transitions, 1599 flow [2024-06-14 15:19:57,442 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1493, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1599, PETRI_PLACES=290, PETRI_TRANSITIONS=199} [2024-06-14 15:19:57,442 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 259 predicate places. [2024-06-14 15:19:57,442 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 199 transitions, 1599 flow [2024-06-14 15:19:57,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:19:57,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:19:57,442 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 15:19:57,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-06-14 15:19:57,443 INFO L420 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:19:57,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:19:57,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1656956394, now seen corresponding path program 26 times [2024-06-14 15:19:57,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:19:57,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809539587] [2024-06-14 15:19:57,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:19:57,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:19:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:20:03,366 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 15:20:03,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:20:03,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809539587] [2024-06-14 15:20:03,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809539587] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:20:03,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:20:03,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:20:03,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140372794] [2024-06-14 15:20:03,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:20:03,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:20:03,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:20:03,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:20:03,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:20:03,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:20:03,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 199 transitions, 1599 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:20:03,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:20:03,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:20:03,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:20:03,844 INFO L124 PetriNetUnfolderBase]: 481/981 cut-off events. [2024-06-14 15:20:03,845 INFO L125 PetriNetUnfolderBase]: For 61148/61150 co-relation queries the response was YES. [2024-06-14 15:20:03,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4531 conditions, 981 events. 481/981 cut-off events. For 61148/61150 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5733 event pairs, 90 based on Foata normal form. 4/984 useless extension candidates. Maximal degree in co-relation 4402. Up to 781 conditions per place. [2024-06-14 15:20:03,855 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 160 selfloop transitions, 50 changer transitions 0/213 dead transitions. [2024-06-14 15:20:03,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 213 transitions, 2072 flow [2024-06-14 15:20:03,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:20:03,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:20:03,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2024-06-14 15:20:03,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2024-06-14 15:20:03,857 INFO L175 Difference]: Start difference. First operand has 290 places, 199 transitions, 1599 flow. Second operand 11 states and 136 transitions. [2024-06-14 15:20:03,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 213 transitions, 2072 flow [2024-06-14 15:20:04,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 213 transitions, 1959 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-14 15:20:04,069 INFO L231 Difference]: Finished difference. Result has 291 places, 200 transitions, 1611 flow [2024-06-14 15:20:04,072 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1486, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1611, PETRI_PLACES=291, PETRI_TRANSITIONS=200} [2024-06-14 15:20:04,072 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 260 predicate places. [2024-06-14 15:20:04,072 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 200 transitions, 1611 flow [2024-06-14 15:20:04,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:20:04,073 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:20:04,073 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 15:20:04,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-06-14 15:20:04,073 INFO L420 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:20:04,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:20:04,073 INFO L85 PathProgramCache]: Analyzing trace with hash 123393194, now seen corresponding path program 27 times [2024-06-14 15:20:04,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:20:04,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832412329] [2024-06-14 15:20:04,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:20:04,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:20:04,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:20:09,315 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 15:20:09,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:20:09,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832412329] [2024-06-14 15:20:09,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832412329] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:20:09,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:20:09,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:20:09,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51548637] [2024-06-14 15:20:09,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:20:09,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:20:09,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:20:09,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:20:09,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:20:09,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:20:09,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 200 transitions, 1611 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:20:09,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:20:09,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:20:09,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:20:09,762 INFO L124 PetriNetUnfolderBase]: 485/989 cut-off events. [2024-06-14 15:20:09,762 INFO L125 PetriNetUnfolderBase]: For 62579/62581 co-relation queries the response was YES. [2024-06-14 15:20:09,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4590 conditions, 989 events. 485/989 cut-off events. For 62579/62581 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 5786 event pairs, 88 based on Foata normal form. 4/992 useless extension candidates. Maximal degree in co-relation 4460. Up to 769 conditions per place. [2024-06-14 15:20:09,771 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 160 selfloop transitions, 52 changer transitions 0/215 dead transitions. [2024-06-14 15:20:09,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 215 transitions, 2092 flow [2024-06-14 15:20:09,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:20:09,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:20:09,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2024-06-14 15:20:09,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39204545454545453 [2024-06-14 15:20:09,773 INFO L175 Difference]: Start difference. First operand has 291 places, 200 transitions, 1611 flow. Second operand 11 states and 138 transitions. [2024-06-14 15:20:09,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 215 transitions, 2092 flow [2024-06-14 15:20:10,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 215 transitions, 1987 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-14 15:20:10,002 INFO L231 Difference]: Finished difference. Result has 295 places, 201 transitions, 1637 flow [2024-06-14 15:20:10,002 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1506, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1637, PETRI_PLACES=295, PETRI_TRANSITIONS=201} [2024-06-14 15:20:10,003 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 264 predicate places. [2024-06-14 15:20:10,003 INFO L495 AbstractCegarLoop]: Abstraction has has 295 places, 201 transitions, 1637 flow [2024-06-14 15:20:10,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:20:10,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:20:10,003 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 15:20:10,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-06-14 15:20:10,004 INFO L420 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:20:10,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:20:10,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1807454822, now seen corresponding path program 28 times [2024-06-14 15:20:10,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:20:10,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768372834] [2024-06-14 15:20:10,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:20:10,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:20:10,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:20:15,643 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 15:20:15,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:20:15,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768372834] [2024-06-14 15:20:15,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768372834] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:20:15,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:20:15,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:20:15,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92601791] [2024-06-14 15:20:15,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:20:15,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:20:15,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:20:15,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:20:15,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:20:15,814 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:20:15,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 201 transitions, 1637 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:20:15,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:20:15,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:20:15,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:20:16,100 INFO L124 PetriNetUnfolderBase]: 490/1002 cut-off events. [2024-06-14 15:20:16,100 INFO L125 PetriNetUnfolderBase]: For 63944/63946 co-relation queries the response was YES. [2024-06-14 15:20:16,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4671 conditions, 1002 events. 490/1002 cut-off events. For 63944/63946 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 5913 event pairs, 92 based on Foata normal form. 4/1005 useless extension candidates. Maximal degree in co-relation 4540. Up to 799 conditions per place. [2024-06-14 15:20:16,110 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 156 selfloop transitions, 57 changer transitions 0/216 dead transitions. [2024-06-14 15:20:16,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 216 transitions, 2130 flow [2024-06-14 15:20:16,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:20:16,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:20:16,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2024-06-14 15:20:16,111 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3778409090909091 [2024-06-14 15:20:16,112 INFO L175 Difference]: Start difference. First operand has 295 places, 201 transitions, 1637 flow. Second operand 11 states and 133 transitions. [2024-06-14 15:20:16,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 216 transitions, 2130 flow [2024-06-14 15:20:16,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 216 transitions, 2008 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-14 15:20:16,340 INFO L231 Difference]: Finished difference. Result has 297 places, 203 transitions, 1668 flow [2024-06-14 15:20:16,340 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1517, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1668, PETRI_PLACES=297, PETRI_TRANSITIONS=203} [2024-06-14 15:20:16,340 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 266 predicate places. [2024-06-14 15:20:16,340 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 203 transitions, 1668 flow [2024-06-14 15:20:16,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:20:16,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:20:16,341 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 15:20:16,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-06-14 15:20:16,341 INFO L420 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:20:16,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:20:16,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1807247432, now seen corresponding path program 29 times [2024-06-14 15:20:16,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:20:16,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552704896] [2024-06-14 15:20:16,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:20:16,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:20:16,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:20:21,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:20:21,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:20:21,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552704896] [2024-06-14 15:20:21,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552704896] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:20:21,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:20:21,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:20:21,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729642838] [2024-06-14 15:20:21,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:20:21,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:20:21,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:20:21,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:20:21,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:20:21,685 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:20:21,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 203 transitions, 1668 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:20:21,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:20:21,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:20:21,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:20:22,020 INFO L124 PetriNetUnfolderBase]: 494/1010 cut-off events. [2024-06-14 15:20:22,020 INFO L125 PetriNetUnfolderBase]: For 65289/65291 co-relation queries the response was YES. [2024-06-14 15:20:22,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4722 conditions, 1010 events. 494/1010 cut-off events. For 65289/65291 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 5995 event pairs, 90 based on Foata normal form. 4/1013 useless extension candidates. Maximal degree in co-relation 4590. Up to 784 conditions per place. [2024-06-14 15:20:22,031 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 157 selfloop transitions, 59 changer transitions 0/219 dead transitions. [2024-06-14 15:20:22,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 219 transitions, 2371 flow [2024-06-14 15:20:22,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:20:22,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:20:22,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2024-06-14 15:20:22,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2024-06-14 15:20:22,033 INFO L175 Difference]: Start difference. First operand has 297 places, 203 transitions, 1668 flow. Second operand 11 states and 136 transitions. [2024-06-14 15:20:22,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 219 transitions, 2371 flow [2024-06-14 15:20:22,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 219 transitions, 2208 flow, removed 13 selfloop flow, removed 10 redundant places. [2024-06-14 15:20:22,251 INFO L231 Difference]: Finished difference. Result has 298 places, 204 transitions, 1652 flow [2024-06-14 15:20:22,251 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1505, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1652, PETRI_PLACES=298, PETRI_TRANSITIONS=204} [2024-06-14 15:20:22,252 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 267 predicate places. [2024-06-14 15:20:22,252 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 204 transitions, 1652 flow [2024-06-14 15:20:22,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:20:22,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:20:22,252 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 15:20:22,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-06-14 15:20:22,252 INFO L420 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:20:22,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:20:22,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1814604662, now seen corresponding path program 30 times [2024-06-14 15:20:22,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:20:22,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215287306] [2024-06-14 15:20:22,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:20:22,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:20:22,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:20:27,718 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 15:20:27,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:20:27,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215287306] [2024-06-14 15:20:27,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215287306] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:20:27,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:20:27,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:20:27,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997292296] [2024-06-14 15:20:27,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:20:27,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:20:27,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:20:27,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:20:27,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:20:27,870 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:20:27,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 204 transitions, 1652 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:20:27,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:20:27,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:20:27,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:20:28,243 INFO L124 PetriNetUnfolderBase]: 491/1005 cut-off events. [2024-06-14 15:20:28,243 INFO L125 PetriNetUnfolderBase]: For 55332/55334 co-relation queries the response was YES. [2024-06-14 15:20:28,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4416 conditions, 1005 events. 491/1005 cut-off events. For 55332/55334 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 5951 event pairs, 91 based on Foata normal form. 4/1008 useless extension candidates. Maximal degree in co-relation 4286. Up to 802 conditions per place. [2024-06-14 15:20:28,252 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 157 selfloop transitions, 57 changer transitions 0/217 dead transitions. [2024-06-14 15:20:28,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 217 transitions, 2114 flow [2024-06-14 15:20:28,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:20:28,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:20:28,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2024-06-14 15:20:28,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835227272727273 [2024-06-14 15:20:28,254 INFO L175 Difference]: Start difference. First operand has 298 places, 204 transitions, 1652 flow. Second operand 11 states and 135 transitions. [2024-06-14 15:20:28,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 217 transitions, 2114 flow [2024-06-14 15:20:28,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 217 transitions, 1911 flow, removed 21 selfloop flow, removed 10 redundant places. [2024-06-14 15:20:28,438 INFO L231 Difference]: Finished difference. Result has 299 places, 204 transitions, 1567 flow [2024-06-14 15:20:28,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1449, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1567, PETRI_PLACES=299, PETRI_TRANSITIONS=204} [2024-06-14 15:20:28,439 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 268 predicate places. [2024-06-14 15:20:28,439 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 204 transitions, 1567 flow [2024-06-14 15:20:28,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 15:20:28,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:20:28,440 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 15:20:28,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-06-14 15:20:28,440 INFO L420 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:20:28,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:20:28,440 INFO L85 PathProgramCache]: Analyzing trace with hash -54353602, now seen corresponding path program 4 times [2024-06-14 15:20:28,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:20:28,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113476188] [2024-06-14 15:20:28,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:20:28,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:20:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:20:33,526 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 15:20:33,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:20:33,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113476188] [2024-06-14 15:20:33,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113476188] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:20:33,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:20:33,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:20:33,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167909983] [2024-06-14 15:20:33,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:20:33,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:20:33,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:20:33,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:20:33,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:20:33,732 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:20:33,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 204 transitions, 1567 flow. Second operand has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:20:33,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:20:33,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:20:33,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:20:34,061 INFO L124 PetriNetUnfolderBase]: 521/1074 cut-off events. [2024-06-14 15:20:34,062 INFO L125 PetriNetUnfolderBase]: For 118459/118463 co-relation queries the response was YES. [2024-06-14 15:20:34,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5477 conditions, 1074 events. 521/1074 cut-off events. For 118459/118463 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 6382 event pairs, 108 based on Foata normal form. 6/1078 useless extension candidates. Maximal degree in co-relation 5347. Up to 750 conditions per place. [2024-06-14 15:20:34,073 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 144 selfloop transitions, 71 changer transitions 6/224 dead transitions. [2024-06-14 15:20:34,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 224 transitions, 2357 flow [2024-06-14 15:20:34,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:20:34,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:20:34,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 153 transitions. [2024-06-14 15:20:34,074 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3984375 [2024-06-14 15:20:34,074 INFO L175 Difference]: Start difference. First operand has 299 places, 204 transitions, 1567 flow. Second operand 12 states and 153 transitions. [2024-06-14 15:20:34,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 224 transitions, 2357 flow [2024-06-14 15:20:34,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 224 transitions, 2144 flow, removed 3 selfloop flow, removed 13 redundant places. [2024-06-14 15:20:34,440 INFO L231 Difference]: Finished difference. Result has 298 places, 202 transitions, 1489 flow [2024-06-14 15:20:34,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1354, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1489, PETRI_PLACES=298, PETRI_TRANSITIONS=202} [2024-06-14 15:20:34,440 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 267 predicate places. [2024-06-14 15:20:34,440 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 202 transitions, 1489 flow [2024-06-14 15:20:34,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:20:34,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:20:34,441 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 15:20:34,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-06-14 15:20:34,441 INFO L420 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:20:34,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:20:34,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1664584750, now seen corresponding path program 5 times [2024-06-14 15:20:34,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:20:34,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920050538] [2024-06-14 15:20:34,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:20:34,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:20:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:20:39,382 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 15:20:39,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:20:39,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920050538] [2024-06-14 15:20:39,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920050538] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:20:39,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:20:39,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:20:39,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737578014] [2024-06-14 15:20:39,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:20:39,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:20:39,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:20:39,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:20:39,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:20:39,626 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:20:39,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 202 transitions, 1489 flow. Second operand has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:20:39,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:20:39,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:20:39,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:20:40,017 INFO L124 PetriNetUnfolderBase]: 537/1110 cut-off events. [2024-06-14 15:20:40,018 INFO L125 PetriNetUnfolderBase]: For 164190/164194 co-relation queries the response was YES. [2024-06-14 15:20:40,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6456 conditions, 1110 events. 537/1110 cut-off events. For 164190/164194 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 6655 event pairs, 120 based on Foata normal form. 6/1114 useless extension candidates. Maximal degree in co-relation 6327. Up to 786 conditions per place. [2024-06-14 15:20:40,029 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 149 selfloop transitions, 64 changer transitions 6/222 dead transitions. [2024-06-14 15:20:40,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 222 transitions, 2277 flow [2024-06-14 15:20:40,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:20:40,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:20:40,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 154 transitions. [2024-06-14 15:20:40,030 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4010416666666667 [2024-06-14 15:20:40,030 INFO L175 Difference]: Start difference. First operand has 298 places, 202 transitions, 1489 flow. Second operand 12 states and 154 transitions. [2024-06-14 15:20:40,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 222 transitions, 2277 flow [2024-06-14 15:20:40,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 222 transitions, 2129 flow, removed 4 selfloop flow, removed 11 redundant places. [2024-06-14 15:20:40,596 INFO L231 Difference]: Finished difference. Result has 297 places, 200 transitions, 1466 flow [2024-06-14 15:20:40,597 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1345, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1466, PETRI_PLACES=297, PETRI_TRANSITIONS=200} [2024-06-14 15:20:40,597 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 266 predicate places. [2024-06-14 15:20:40,597 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 200 transitions, 1466 flow [2024-06-14 15:20:40,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:20:40,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:20:40,597 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 15:20:40,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2024-06-14 15:20:40,598 INFO L420 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:20:40,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:20:40,598 INFO L85 PathProgramCache]: Analyzing trace with hash 131017830, now seen corresponding path program 6 times [2024-06-14 15:20:40,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:20:40,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989027467] [2024-06-14 15:20:40,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:20:40,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:20:40,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:20:46,749 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 15:20:46,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:20:46,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989027467] [2024-06-14 15:20:46,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989027467] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:20:46,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:20:46,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:20:46,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073481759] [2024-06-14 15:20:46,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:20:46,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:20:46,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:20:46,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:20:46,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:20:46,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:20:46,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 200 transitions, 1466 flow. Second operand has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:20:46,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:20:46,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:20:46,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:20:47,372 INFO L124 PetriNetUnfolderBase]: 513/1054 cut-off events. [2024-06-14 15:20:47,372 INFO L125 PetriNetUnfolderBase]: For 131643/131647 co-relation queries the response was YES. [2024-06-14 15:20:47,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5333 conditions, 1054 events. 513/1054 cut-off events. For 131643/131647 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 6259 event pairs, 110 based on Foata normal form. 8/1060 useless extension candidates. Maximal degree in co-relation 5205. Up to 786 conditions per place. [2024-06-14 15:20:47,383 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 141 selfloop transitions, 61 changer transitions 11/216 dead transitions. [2024-06-14 15:20:47,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 216 transitions, 1984 flow [2024-06-14 15:20:47,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:20:47,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:20:47,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 149 transitions. [2024-06-14 15:20:47,384 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3880208333333333 [2024-06-14 15:20:47,384 INFO L175 Difference]: Start difference. First operand has 297 places, 200 transitions, 1466 flow. Second operand 12 states and 149 transitions. [2024-06-14 15:20:47,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 216 transitions, 1984 flow [2024-06-14 15:20:47,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 216 transitions, 1854 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-06-14 15:20:47,694 INFO L231 Difference]: Finished difference. Result has 296 places, 196 transitions, 1436 flow [2024-06-14 15:20:47,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1336, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1436, PETRI_PLACES=296, PETRI_TRANSITIONS=196} [2024-06-14 15:20:47,694 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 265 predicate places. [2024-06-14 15:20:47,694 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 196 transitions, 1436 flow [2024-06-14 15:20:47,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:20:47,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:20:47,707 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 15:20:47,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2024-06-14 15:20:47,707 INFO L420 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:20:47,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:20:47,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1814872068, now seen corresponding path program 7 times [2024-06-14 15:20:47,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:20:47,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775676741] [2024-06-14 15:20:47,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:20:47,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:20:47,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:20:53,546 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 15:20:53,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:20:53,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775676741] [2024-06-14 15:20:53,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775676741] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:20:53,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:20:53,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:20:53,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141028809] [2024-06-14 15:20:53,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:20:53,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:20:53,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:20:53,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:20:53,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:20:53,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:20:53,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 196 transitions, 1436 flow. Second operand has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:20:53,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:20:53,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:20:53,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:20:54,161 INFO L124 PetriNetUnfolderBase]: 485/1000 cut-off events. [2024-06-14 15:20:54,161 INFO L125 PetriNetUnfolderBase]: For 87228/87232 co-relation queries the response was YES. [2024-06-14 15:20:54,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4178 conditions, 1000 events. 485/1000 cut-off events. For 87228/87232 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 5895 event pairs, 100 based on Foata normal form. 8/1006 useless extension candidates. Maximal degree in co-relation 4051. Up to 730 conditions per place. [2024-06-14 15:20:54,168 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 131 selfloop transitions, 67 changer transitions 11/212 dead transitions. [2024-06-14 15:20:54,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 212 transitions, 1946 flow [2024-06-14 15:20:54,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:20:54,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:20:54,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 148 transitions. [2024-06-14 15:20:54,169 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2024-06-14 15:20:54,169 INFO L175 Difference]: Start difference. First operand has 296 places, 196 transitions, 1436 flow. Second operand 12 states and 148 transitions. [2024-06-14 15:20:54,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 212 transitions, 1946 flow [2024-06-14 15:20:54,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 212 transitions, 1802 flow, removed 11 selfloop flow, removed 11 redundant places. [2024-06-14 15:20:54,366 INFO L231 Difference]: Finished difference. Result has 291 places, 192 transitions, 1412 flow [2024-06-14 15:20:54,366 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1300, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1412, PETRI_PLACES=291, PETRI_TRANSITIONS=192} [2024-06-14 15:20:54,366 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 260 predicate places. [2024-06-14 15:20:54,366 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 192 transitions, 1412 flow [2024-06-14 15:20:54,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:20:54,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:20:54,367 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 15:20:54,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2024-06-14 15:20:54,367 INFO L420 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:20:54,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:20:54,367 INFO L85 PathProgramCache]: Analyzing trace with hash -27594532, now seen corresponding path program 8 times [2024-06-14 15:20:54,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:20:54,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521241201] [2024-06-14 15:20:54,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:20:54,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:20:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:20:59,377 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 15:20:59,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:20:59,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521241201] [2024-06-14 15:20:59,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521241201] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:20:59,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:20:59,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:20:59,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448145239] [2024-06-14 15:20:59,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:20:59,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:20:59,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:20:59,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:20:59,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:20:59,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:20:59,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 192 transitions, 1412 flow. Second operand has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:20:59,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:20:59,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:20:59,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:20:59,916 INFO L124 PetriNetUnfolderBase]: 497/1030 cut-off events. [2024-06-14 15:20:59,916 INFO L125 PetriNetUnfolderBase]: For 112257/112261 co-relation queries the response was YES. [2024-06-14 15:20:59,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5108 conditions, 1030 events. 497/1030 cut-off events. For 112257/112261 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 6067 event pairs, 108 based on Foata normal form. 6/1034 useless extension candidates. Maximal degree in co-relation 4983. Up to 710 conditions per place. [2024-06-14 15:20:59,925 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 143 selfloop transitions, 60 changer transitions 6/212 dead transitions. [2024-06-14 15:20:59,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 212 transitions, 2160 flow [2024-06-14 15:20:59,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:20:59,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:20:59,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 155 transitions. [2024-06-14 15:20:59,926 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4036458333333333 [2024-06-14 15:20:59,926 INFO L175 Difference]: Start difference. First operand has 291 places, 192 transitions, 1412 flow. Second operand 12 states and 155 transitions. [2024-06-14 15:20:59,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 212 transitions, 2160 flow [2024-06-14 15:21:00,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 212 transitions, 1994 flow, removed 16 selfloop flow, removed 11 redundant places. [2024-06-14 15:21:00,243 INFO L231 Difference]: Finished difference. Result has 286 places, 190 transitions, 1377 flow [2024-06-14 15:21:00,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1264, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1377, PETRI_PLACES=286, PETRI_TRANSITIONS=190} [2024-06-14 15:21:00,243 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 255 predicate places. [2024-06-14 15:21:00,243 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 190 transitions, 1377 flow [2024-06-14 15:21:00,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:21:00,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:21:00,244 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 15:21:00,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2024-06-14 15:21:00,244 INFO L420 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:21:00,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:21:00,244 INFO L85 PathProgramCache]: Analyzing trace with hash 2063042746, now seen corresponding path program 9 times [2024-06-14 15:21:00,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:21:00,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096268560] [2024-06-14 15:21:00,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:21:00,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:21:00,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:21:06,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:21:06,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:21:06,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096268560] [2024-06-14 15:21:06,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096268560] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:21:06,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:21:06,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:21:06,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154767557] [2024-06-14 15:21:06,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:21:06,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:21:06,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:21:06,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:21:06,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:21:06,991 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:21:06,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 190 transitions, 1377 flow. Second operand has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:21:06,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:21:06,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:21:06,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:21:07,354 INFO L124 PetriNetUnfolderBase]: 513/1061 cut-off events. [2024-06-14 15:21:07,355 INFO L125 PetriNetUnfolderBase]: For 147572/147574 co-relation queries the response was YES. [2024-06-14 15:21:07,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5991 conditions, 1061 events. 513/1061 cut-off events. For 147572/147574 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 6274 event pairs, 114 based on Foata normal form. 6/1066 useless extension candidates. Maximal degree in co-relation 5868. Up to 908 conditions per place. [2024-06-14 15:21:07,364 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 186 selfloop transitions, 15 changer transitions 6/210 dead transitions. [2024-06-14 15:21:07,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 210 transitions, 2105 flow [2024-06-14 15:21:07,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:21:07,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:21:07,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 140 transitions. [2024-06-14 15:21:07,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3645833333333333 [2024-06-14 15:21:07,367 INFO L175 Difference]: Start difference. First operand has 286 places, 190 transitions, 1377 flow. Second operand 12 states and 140 transitions. [2024-06-14 15:21:07,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 210 transitions, 2105 flow [2024-06-14 15:21:07,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 210 transitions, 1979 flow, removed 4 selfloop flow, removed 11 redundant places. [2024-06-14 15:21:07,867 INFO L231 Difference]: Finished difference. Result has 285 places, 188 transitions, 1278 flow [2024-06-14 15:21:07,867 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1255, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1278, PETRI_PLACES=285, PETRI_TRANSITIONS=188} [2024-06-14 15:21:07,867 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 254 predicate places. [2024-06-14 15:21:07,867 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 188 transitions, 1278 flow [2024-06-14 15:21:07,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:21:07,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:21:07,868 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 15:21:07,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2024-06-14 15:21:07,868 INFO L420 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:21:07,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:21:07,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1071153156, now seen corresponding path program 10 times [2024-06-14 15:21:07,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:21:07,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395208238] [2024-06-14 15:21:07,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:21:07,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:21:07,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:21:13,755 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 15:21:13,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:21:13,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395208238] [2024-06-14 15:21:13,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395208238] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:21:13,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:21:13,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:21:13,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116963049] [2024-06-14 15:21:13,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:21:13,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:21:13,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:21:13,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:21:13,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:21:13,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:21:13,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 188 transitions, 1278 flow. Second operand has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:21:13,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:21:13,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:21:13,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:21:14,317 INFO L124 PetriNetUnfolderBase]: 489/1010 cut-off events. [2024-06-14 15:21:14,317 INFO L125 PetriNetUnfolderBase]: For 117580/117584 co-relation queries the response was YES. [2024-06-14 15:21:14,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4875 conditions, 1010 events. 489/1010 cut-off events. For 117580/117584 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 5954 event pairs, 110 based on Foata normal form. 8/1016 useless extension candidates. Maximal degree in co-relation 4753. Up to 746 conditions per place. [2024-06-14 15:21:14,326 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 133 selfloop transitions, 57 changer transitions 11/204 dead transitions. [2024-06-14 15:21:14,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 204 transitions, 1756 flow [2024-06-14 15:21:14,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:21:14,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:21:14,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 150 transitions. [2024-06-14 15:21:14,327 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-14 15:21:14,327 INFO L175 Difference]: Start difference. First operand has 285 places, 188 transitions, 1278 flow. Second operand 12 states and 150 transitions. [2024-06-14 15:21:14,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 204 transitions, 1756 flow [2024-06-14 15:21:14,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 204 transitions, 1724 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-06-14 15:21:14,583 INFO L231 Difference]: Finished difference. Result has 284 places, 184 transitions, 1338 flow [2024-06-14 15:21:14,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1246, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1338, PETRI_PLACES=284, PETRI_TRANSITIONS=184} [2024-06-14 15:21:14,584 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 253 predicate places. [2024-06-14 15:21:14,584 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 184 transitions, 1338 flow [2024-06-14 15:21:14,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:21:14,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:21:14,584 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 15:21:14,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2024-06-14 15:21:14,585 INFO L420 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:21:14,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:21:14,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1918234620, now seen corresponding path program 11 times [2024-06-14 15:21:14,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:21:14,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782187344] [2024-06-14 15:21:14,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:21:14,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:21:14,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:21:20,640 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 15:21:20,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:21:20,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782187344] [2024-06-14 15:21:20,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782187344] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:21:20,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:21:20,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:21:20,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959702386] [2024-06-14 15:21:20,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:21:20,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:21:20,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:21:20,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:21:20,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:21:20,916 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:21:20,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 184 transitions, 1338 flow. Second operand has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:21:20,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:21:20,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:21:20,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:21:21,339 INFO L124 PetriNetUnfolderBase]: 483/1001 cut-off events. [2024-06-14 15:21:21,339 INFO L125 PetriNetUnfolderBase]: For 115331/115333 co-relation queries the response was YES. [2024-06-14 15:21:21,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4911 conditions, 1001 events. 483/1001 cut-off events. For 115331/115333 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5872 event pairs, 108 based on Foata normal form. 8/1008 useless extension candidates. Maximal degree in co-relation 4790. Up to 889 conditions per place. [2024-06-14 15:21:21,348 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 171 selfloop transitions, 18 changer transitions 9/201 dead transitions. [2024-06-14 15:21:21,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 201 transitions, 1812 flow [2024-06-14 15:21:21,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-14 15:21:21,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-14 15:21:21,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 148 transitions. [2024-06-14 15:21:21,350 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3557692307692308 [2024-06-14 15:21:21,350 INFO L175 Difference]: Start difference. First operand has 284 places, 184 transitions, 1338 flow. Second operand 13 states and 148 transitions. [2024-06-14 15:21:21,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 201 transitions, 1812 flow [2024-06-14 15:21:21,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 201 transitions, 1676 flow, removed 11 selfloop flow, removed 11 redundant places. [2024-06-14 15:21:21,634 INFO L231 Difference]: Finished difference. Result has 280 places, 181 transitions, 1231 flow [2024-06-14 15:21:21,634 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1210, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1231, PETRI_PLACES=280, PETRI_TRANSITIONS=181} [2024-06-14 15:21:21,635 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 249 predicate places. [2024-06-14 15:21:21,635 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 181 transitions, 1231 flow [2024-06-14 15:21:21,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:21:21,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:21:21,635 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 15:21:21,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2024-06-14 15:21:21,636 INFO L420 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:21:21,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:21:21,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1918225320, now seen corresponding path program 12 times [2024-06-14 15:21:21,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:21:21,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743819396] [2024-06-14 15:21:21,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:21:21,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:21:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:21:27,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:21:27,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:21:27,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743819396] [2024-06-14 15:21:27,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743819396] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:21:27,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:21:27,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:21:27,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078800156] [2024-06-14 15:21:27,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:21:27,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:21:27,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:21:27,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:21:27,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:21:27,811 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:21:27,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 181 transitions, 1231 flow. Second operand has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:21:27,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:21:27,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:21:27,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:21:28,154 INFO L124 PetriNetUnfolderBase]: 474/988 cut-off events. [2024-06-14 15:21:28,155 INFO L125 PetriNetUnfolderBase]: For 100443/100445 co-relation queries the response was YES. [2024-06-14 15:21:28,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4677 conditions, 988 events. 474/988 cut-off events. For 100443/100445 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 5792 event pairs, 104 based on Foata normal form. 6/993 useless extension candidates. Maximal degree in co-relation 4558. Up to 879 conditions per place. [2024-06-14 15:21:28,163 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 169 selfloop transitions, 16 changer transitions 10/198 dead transitions. [2024-06-14 15:21:28,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 198 transitions, 1683 flow [2024-06-14 15:21:28,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-14 15:21:28,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-14 15:21:28,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 146 transitions. [2024-06-14 15:21:28,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35096153846153844 [2024-06-14 15:21:28,165 INFO L175 Difference]: Start difference. First operand has 280 places, 181 transitions, 1231 flow. Second operand 13 states and 146 transitions. [2024-06-14 15:21:28,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 198 transitions, 1683 flow [2024-06-14 15:21:28,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 198 transitions, 1639 flow, removed 1 selfloop flow, removed 13 redundant places. [2024-06-14 15:21:28,423 INFO L231 Difference]: Finished difference. Result has 278 places, 178 transitions, 1207 flow [2024-06-14 15:21:28,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1187, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1207, PETRI_PLACES=278, PETRI_TRANSITIONS=178} [2024-06-14 15:21:28,424 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 247 predicate places. [2024-06-14 15:21:28,424 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 178 transitions, 1207 flow [2024-06-14 15:21:28,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:21:28,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:21:28,424 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 15:21:28,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2024-06-14 15:21:28,425 INFO L420 AbstractCegarLoop]: === Iteration 126 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:21:28,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:21:28,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1907183430, now seen corresponding path program 13 times [2024-06-14 15:21:28,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:21:28,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538416025] [2024-06-14 15:21:28,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:21:28,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:21:28,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:21:34,411 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 15:21:34,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:21:34,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538416025] [2024-06-14 15:21:34,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538416025] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:21:34,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:21:34,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:21:34,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383886680] [2024-06-14 15:21:34,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:21:34,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:21:34,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:21:34,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:21:34,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:21:34,613 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:21:34,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 178 transitions, 1207 flow. Second operand has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:21:34,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:21:34,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:21:34,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:21:35,020 INFO L124 PetriNetUnfolderBase]: 460/958 cut-off events. [2024-06-14 15:21:35,021 INFO L125 PetriNetUnfolderBase]: For 90815/90817 co-relation queries the response was YES. [2024-06-14 15:21:35,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4334 conditions, 958 events. 460/958 cut-off events. For 90815/90817 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 5519 event pairs, 99 based on Foata normal form. 6/963 useless extension candidates. Maximal degree in co-relation 4216. Up to 798 conditions per place. [2024-06-14 15:21:35,030 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 172 selfloop transitions, 14 changer transitions 10/199 dead transitions. [2024-06-14 15:21:35,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 199 transitions, 1871 flow [2024-06-14 15:21:35,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-14 15:21:35,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-14 15:21:35,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 149 transitions. [2024-06-14 15:21:35,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3581730769230769 [2024-06-14 15:21:35,031 INFO L175 Difference]: Start difference. First operand has 278 places, 178 transitions, 1207 flow. Second operand 13 states and 149 transitions. [2024-06-14 15:21:35,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 199 transitions, 1871 flow [2024-06-14 15:21:35,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 199 transitions, 1823 flow, removed 8 selfloop flow, removed 12 redundant places. [2024-06-14 15:21:35,244 INFO L231 Difference]: Finished difference. Result has 274 places, 174 transitions, 1177 flow [2024-06-14 15:21:35,244 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1167, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1177, PETRI_PLACES=274, PETRI_TRANSITIONS=174} [2024-06-14 15:21:35,245 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 243 predicate places. [2024-06-14 15:21:35,245 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 174 transitions, 1177 flow [2024-06-14 15:21:35,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:21:35,245 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:21:35,245 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 15:21:35,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2024-06-14 15:21:35,245 INFO L420 AbstractCegarLoop]: === Iteration 127 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:21:35,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:21:35,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1338569852, now seen corresponding path program 14 times [2024-06-14 15:21:35,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:21:35,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862928366] [2024-06-14 15:21:35,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:21:35,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:21:35,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:21:41,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:21:41,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:21:41,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862928366] [2024-06-14 15:21:41,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862928366] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:21:41,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:21:41,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:21:41,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595774288] [2024-06-14 15:21:41,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:21:41,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:21:41,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:21:41,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:21:41,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:21:41,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:21:41,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 174 transitions, 1177 flow. Second operand has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:21:41,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:21:41,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:21:41,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:21:41,640 INFO L124 PetriNetUnfolderBase]: 431/895 cut-off events. [2024-06-14 15:21:41,640 INFO L125 PetriNetUnfolderBase]: For 61707/61709 co-relation queries the response was YES. [2024-06-14 15:21:41,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3310 conditions, 895 events. 431/895 cut-off events. For 61707/61709 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 5126 event pairs, 91 based on Foata normal form. 8/902 useless extension candidates. Maximal degree in co-relation 3194. Up to 798 conditions per place. [2024-06-14 15:21:41,647 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 162 selfloop transitions, 9 changer transitions 15/189 dead transitions. [2024-06-14 15:21:41,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 189 transitions, 1589 flow [2024-06-14 15:21:41,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:21:41,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:21:41,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 133 transitions. [2024-06-14 15:21:41,648 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3463541666666667 [2024-06-14 15:21:41,648 INFO L175 Difference]: Start difference. First operand has 274 places, 174 transitions, 1177 flow. Second operand 12 states and 133 transitions. [2024-06-14 15:21:41,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 189 transitions, 1589 flow [2024-06-14 15:21:41,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 189 transitions, 1549 flow, removed 7 selfloop flow, removed 13 redundant places. [2024-06-14 15:21:41,750 INFO L231 Difference]: Finished difference. Result has 268 places, 167 transitions, 1099 flow [2024-06-14 15:21:41,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1139, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1099, PETRI_PLACES=268, PETRI_TRANSITIONS=167} [2024-06-14 15:21:41,750 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 237 predicate places. [2024-06-14 15:21:41,750 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 167 transitions, 1099 flow [2024-06-14 15:21:41,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:21:41,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:21:41,751 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:21:41,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2024-06-14 15:21:41,752 INFO L420 AbstractCegarLoop]: === Iteration 128 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:21:41,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:21:41,753 INFO L85 PathProgramCache]: Analyzing trace with hash -792280329, now seen corresponding path program 1 times [2024-06-14 15:21:41,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:21:41,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459719533] [2024-06-14 15:21:41,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:21:41,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:21:41,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:21:47,620 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 15:21:47,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:21:47,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459719533] [2024-06-14 15:21:47,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459719533] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:21:47,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:21:47,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:21:47,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811163770] [2024-06-14 15:21:47,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:21:47,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:21:47,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:21:47,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:21:47,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:21:47,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:21:47,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 167 transitions, 1099 flow. Second operand has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:21:47,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:21:47,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:21:47,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:21:48,201 INFO L124 PetriNetUnfolderBase]: 419/870 cut-off events. [2024-06-14 15:21:48,201 INFO L125 PetriNetUnfolderBase]: For 50698/50698 co-relation queries the response was YES. [2024-06-14 15:21:48,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3146 conditions, 870 events. 419/870 cut-off events. For 50698/50698 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4919 event pairs, 75 based on Foata normal form. 6/875 useless extension candidates. Maximal degree in co-relation 3033. Up to 720 conditions per place. [2024-06-14 15:21:48,208 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 153 selfloop transitions, 11 changer transitions 25/192 dead transitions. [2024-06-14 15:21:48,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 192 transitions, 1543 flow [2024-06-14 15:21:48,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:21:48,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:21:48,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 141 transitions. [2024-06-14 15:21:48,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3671875 [2024-06-14 15:21:48,210 INFO L175 Difference]: Start difference. First operand has 268 places, 167 transitions, 1099 flow. Second operand 12 states and 141 transitions. [2024-06-14 15:21:48,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 192 transitions, 1543 flow [2024-06-14 15:21:48,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 192 transitions, 1487 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-14 15:21:48,321 INFO L231 Difference]: Finished difference. Result has 259 places, 159 transitions, 1026 flow [2024-06-14 15:21:48,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1045, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1026, PETRI_PLACES=259, PETRI_TRANSITIONS=159} [2024-06-14 15:21:48,322 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 228 predicate places. [2024-06-14 15:21:48,322 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 159 transitions, 1026 flow [2024-06-14 15:21:48,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:21:48,322 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:21:48,322 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:21:48,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2024-06-14 15:21:48,323 INFO L420 AbstractCegarLoop]: === Iteration 129 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:21:48,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:21:48,323 INFO L85 PathProgramCache]: Analyzing trace with hash -689188207, now seen corresponding path program 2 times [2024-06-14 15:21:48,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:21:48,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437556727] [2024-06-14 15:21:48,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:21:48,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:21:48,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:21:54,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:21:54,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:21:54,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437556727] [2024-06-14 15:21:54,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437556727] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:21:54,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:21:54,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:21:54,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869959054] [2024-06-14 15:21:54,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:21:54,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:21:54,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:21:54,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:21:54,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:21:54,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:21:54,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 159 transitions, 1026 flow. Second operand has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:21:54,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:21:54,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:21:54,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:21:55,299 INFO L124 PetriNetUnfolderBase]: 385/810 cut-off events. [2024-06-14 15:21:55,299 INFO L125 PetriNetUnfolderBase]: For 48918/48918 co-relation queries the response was YES. [2024-06-14 15:21:55,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2895 conditions, 810 events. 385/810 cut-off events. For 48918/48918 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4564 event pairs, 69 based on Foata normal form. 6/815 useless extension candidates. Maximal degree in co-relation 2785. Up to 650 conditions per place. [2024-06-14 15:21:55,305 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 144 selfloop transitions, 19 changer transitions 13/179 dead transitions. [2024-06-14 15:21:55,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 179 transitions, 1428 flow [2024-06-14 15:21:55,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:21:55,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:21:55,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 140 transitions. [2024-06-14 15:21:55,306 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3645833333333333 [2024-06-14 15:21:55,306 INFO L175 Difference]: Start difference. First operand has 259 places, 159 transitions, 1026 flow. Second operand 12 states and 140 transitions. [2024-06-14 15:21:55,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 179 transitions, 1428 flow [2024-06-14 15:21:55,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 179 transitions, 1394 flow, removed 6 selfloop flow, removed 11 redundant places. [2024-06-14 15:21:55,385 INFO L231 Difference]: Finished difference. Result has 249 places, 154 transitions, 1005 flow [2024-06-14 15:21:55,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=992, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1005, PETRI_PLACES=249, PETRI_TRANSITIONS=154} [2024-06-14 15:21:55,385 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 218 predicate places. [2024-06-14 15:21:55,385 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 154 transitions, 1005 flow [2024-06-14 15:21:55,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:21:55,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:21:55,386 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:21:55,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2024-06-14 15:21:55,386 INFO L420 AbstractCegarLoop]: === Iteration 130 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:21:55,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:21:55,386 INFO L85 PathProgramCache]: Analyzing trace with hash 841286391, now seen corresponding path program 3 times [2024-06-14 15:21:55,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:21:55,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537593877] [2024-06-14 15:21:55,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:21:55,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:21:55,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:22:01,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:22:01,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:22:01,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537593877] [2024-06-14 15:22:01,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537593877] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:22:01,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:22:01,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:22:01,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545535151] [2024-06-14 15:22:01,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:22:01,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:22:01,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:22:01,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:22:01,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:22:01,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:22:01,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 154 transitions, 1005 flow. Second operand has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:22:01,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:22:01,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:22:01,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:22:01,850 INFO L124 PetriNetUnfolderBase]: 369/782 cut-off events. [2024-06-14 15:22:01,850 INFO L125 PetriNetUnfolderBase]: For 43586/43586 co-relation queries the response was YES. [2024-06-14 15:22:01,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2800 conditions, 782 events. 369/782 cut-off events. For 43586/43586 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4369 event pairs, 69 based on Foata normal form. 6/787 useless extension candidates. Maximal degree in co-relation 2695. Up to 646 conditions per place. [2024-06-14 15:22:01,856 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 142 selfloop transitions, 19 changer transitions 9/173 dead transitions. [2024-06-14 15:22:01,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 173 transitions, 1393 flow [2024-06-14 15:22:01,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:22:01,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:22:01,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 137 transitions. [2024-06-14 15:22:01,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3567708333333333 [2024-06-14 15:22:01,857 INFO L175 Difference]: Start difference. First operand has 249 places, 154 transitions, 1005 flow. Second operand 12 states and 137 transitions. [2024-06-14 15:22:01,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 173 transitions, 1393 flow [2024-06-14 15:22:01,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 173 transitions, 1347 flow, removed 4 selfloop flow, removed 12 redundant places. [2024-06-14 15:22:01,914 INFO L231 Difference]: Finished difference. Result has 243 places, 151 transitions, 986 flow [2024-06-14 15:22:01,914 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=959, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=986, PETRI_PLACES=243, PETRI_TRANSITIONS=151} [2024-06-14 15:22:01,915 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 212 predicate places. [2024-06-14 15:22:01,915 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 151 transitions, 986 flow [2024-06-14 15:22:01,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:22:01,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:22:01,915 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:22:01,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2024-06-14 15:22:01,915 INFO L420 AbstractCegarLoop]: === Iteration 131 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:22:01,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:22:01,916 INFO L85 PathProgramCache]: Analyzing trace with hash -800010727, now seen corresponding path program 4 times [2024-06-14 15:22:01,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:22:01,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692451744] [2024-06-14 15:22:01,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:22:01,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:22:01,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:22:07,437 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 15:22:07,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:22:07,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692451744] [2024-06-14 15:22:07,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692451744] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:22:07,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:22:07,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:22:07,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279517169] [2024-06-14 15:22:07,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:22:07,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:22:07,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:22:07,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:22:07,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:22:07,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:22:07,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 151 transitions, 986 flow. Second operand has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:22:07,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:22:07,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:22:07,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:22:08,033 INFO L124 PetriNetUnfolderBase]: 359/764 cut-off events. [2024-06-14 15:22:08,033 INFO L125 PetriNetUnfolderBase]: For 40576/40576 co-relation queries the response was YES. [2024-06-14 15:22:08,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2729 conditions, 764 events. 359/764 cut-off events. For 40576/40576 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4262 event pairs, 54 based on Foata normal form. 6/769 useless extension candidates. Maximal degree in co-relation 2627. Up to 610 conditions per place. [2024-06-14 15:22:08,038 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 140 selfloop transitions, 13 changer transitions 16/172 dead transitions. [2024-06-14 15:22:08,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 172 transitions, 1376 flow [2024-06-14 15:22:08,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:22:08,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:22:08,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 140 transitions. [2024-06-14 15:22:08,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3645833333333333 [2024-06-14 15:22:08,039 INFO L175 Difference]: Start difference. First operand has 243 places, 151 transitions, 986 flow. Second operand 12 states and 140 transitions. [2024-06-14 15:22:08,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 172 transitions, 1376 flow [2024-06-14 15:22:08,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 172 transitions, 1332 flow, removed 3 selfloop flow, removed 12 redundant places. [2024-06-14 15:22:08,098 INFO L231 Difference]: Finished difference. Result has 239 places, 145 transitions, 939 flow [2024-06-14 15:22:08,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=942, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=939, PETRI_PLACES=239, PETRI_TRANSITIONS=145} [2024-06-14 15:22:08,112 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 208 predicate places. [2024-06-14 15:22:08,112 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 145 transitions, 939 flow [2024-06-14 15:22:08,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:22:08,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:22:08,113 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:22:08,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2024-06-14 15:22:08,113 INFO L420 AbstractCegarLoop]: === Iteration 132 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:22:08,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:22:08,113 INFO L85 PathProgramCache]: Analyzing trace with hash 847715481, now seen corresponding path program 5 times [2024-06-14 15:22:08,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:22:08,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457196325] [2024-06-14 15:22:08,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:22:08,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:22:08,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:22:14,441 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 15:22:14,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:22:14,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457196325] [2024-06-14 15:22:14,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457196325] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:22:14,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:22:14,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:22:14,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270338601] [2024-06-14 15:22:14,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:22:14,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:22:14,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:22:14,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:22:14,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:22:14,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:22:14,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 145 transitions, 939 flow. Second operand has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:22:14,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:22:14,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:22:14,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:22:14,858 INFO L124 PetriNetUnfolderBase]: 339/728 cut-off events. [2024-06-14 15:22:14,858 INFO L125 PetriNetUnfolderBase]: For 38626/38626 co-relation queries the response was YES. [2024-06-14 15:22:14,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2603 conditions, 728 events. 339/728 cut-off events. For 38626/38626 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4007 event pairs, 63 based on Foata normal form. 6/733 useless extension candidates. Maximal degree in co-relation 2503. Up to 606 conditions per place. [2024-06-14 15:22:14,863 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 128 selfloop transitions, 6 changer transitions 26/163 dead transitions. [2024-06-14 15:22:14,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 163 transitions, 1305 flow [2024-06-14 15:22:14,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:22:14,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:22:14,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 133 transitions. [2024-06-14 15:22:14,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3463541666666667 [2024-06-14 15:22:14,864 INFO L175 Difference]: Start difference. First operand has 239 places, 145 transitions, 939 flow. Second operand 12 states and 133 transitions. [2024-06-14 15:22:14,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 163 transitions, 1305 flow [2024-06-14 15:22:14,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 163 transitions, 1269 flow, removed 5 selfloop flow, removed 12 redundant places. [2024-06-14 15:22:14,925 INFO L231 Difference]: Finished difference. Result has 231 places, 133 transitions, 841 flow [2024-06-14 15:22:14,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=903, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=841, PETRI_PLACES=231, PETRI_TRANSITIONS=133} [2024-06-14 15:22:14,925 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 200 predicate places. [2024-06-14 15:22:14,925 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 133 transitions, 841 flow [2024-06-14 15:22:14,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:22:14,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:22:14,926 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:22:14,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2024-06-14 15:22:14,926 INFO L420 AbstractCegarLoop]: === Iteration 133 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:22:14,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:22:14,926 INFO L85 PathProgramCache]: Analyzing trace with hash 147065877, now seen corresponding path program 6 times [2024-06-14 15:22:14,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:22:14,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887396316] [2024-06-14 15:22:14,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:22:14,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:22:14,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:22:20,768 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 15:22:20,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:22:20,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887396316] [2024-06-14 15:22:20,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887396316] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:22:20,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:22:20,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:22:20,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960136146] [2024-06-14 15:22:20,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:22:20,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:22:20,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:22:20,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:22:20,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:22:21,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:22:21,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 133 transitions, 841 flow. Second operand has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:22:21,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:22:21,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:22:21,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:22:21,325 INFO L124 PetriNetUnfolderBase]: 318/671 cut-off events. [2024-06-14 15:22:21,325 INFO L125 PetriNetUnfolderBase]: For 34843/34847 co-relation queries the response was YES. [2024-06-14 15:22:21,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2375 conditions, 671 events. 318/671 cut-off events. For 34843/34847 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3617 event pairs, 61 based on Foata normal form. 10/680 useless extension candidates. Maximal degree in co-relation 2292. Up to 559 conditions per place. [2024-06-14 15:22:21,330 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 117 selfloop transitions, 15 changer transitions 14/149 dead transitions. [2024-06-14 15:22:21,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 149 transitions, 1169 flow [2024-06-14 15:22:21,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:22:21,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:22:21,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 135 transitions. [2024-06-14 15:22:21,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3515625 [2024-06-14 15:22:21,331 INFO L175 Difference]: Start difference. First operand has 231 places, 133 transitions, 841 flow. Second operand 12 states and 135 transitions. [2024-06-14 15:22:21,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 149 transitions, 1169 flow [2024-06-14 15:22:21,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 149 transitions, 1138 flow, removed 7 selfloop flow, removed 13 redundant places. [2024-06-14 15:22:21,385 INFO L231 Difference]: Finished difference. Result has 214 places, 128 transitions, 818 flow [2024-06-14 15:22:21,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=810, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=818, PETRI_PLACES=214, PETRI_TRANSITIONS=128} [2024-06-14 15:22:21,385 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 183 predicate places. [2024-06-14 15:22:21,386 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 128 transitions, 818 flow [2024-06-14 15:22:21,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:22:21,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:22:21,386 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:22:21,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2024-06-14 15:22:21,386 INFO L420 AbstractCegarLoop]: === Iteration 134 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:22:21,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:22:21,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1205700327, now seen corresponding path program 7 times [2024-06-14 15:22:21,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:22:21,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149423114] [2024-06-14 15:22:21,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:22:21,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:22:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:22:27,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:22:27,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:22:27,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149423114] [2024-06-14 15:22:27,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149423114] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:22:27,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:22:27,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:22:27,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693054857] [2024-06-14 15:22:27,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:22:27,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:22:27,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:22:27,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:22:27,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:22:27,957 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:22:27,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 128 transitions, 818 flow. Second operand has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 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 15:22:27,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:22:27,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:22:27,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:22:28,380 INFO L124 PetriNetUnfolderBase]: 306/645 cut-off events. [2024-06-14 15:22:28,380 INFO L125 PetriNetUnfolderBase]: For 29574/29574 co-relation queries the response was YES. [2024-06-14 15:22:28,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2277 conditions, 645 events. 306/645 cut-off events. For 29574/29574 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3435 event pairs, 59 based on Foata normal form. 6/650 useless extension candidates. Maximal degree in co-relation 2201. Up to 541 conditions per place. [2024-06-14 15:22:28,385 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 115 selfloop transitions, 13 changer transitions 13/144 dead transitions. [2024-06-14 15:22:28,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 144 transitions, 1136 flow [2024-06-14 15:22:28,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:22:28,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:22:28,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 123 transitions. [2024-06-14 15:22:28,386 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3203125 [2024-06-14 15:22:28,386 INFO L175 Difference]: Start difference. First operand has 214 places, 128 transitions, 818 flow. Second operand 12 states and 123 transitions. [2024-06-14 15:22:28,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 144 transitions, 1136 flow [2024-06-14 15:22:28,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 144 transitions, 1087 flow, removed 3 selfloop flow, removed 13 redundant places. [2024-06-14 15:22:28,432 INFO L231 Difference]: Finished difference. Result has 206 places, 124 transitions, 780 flow [2024-06-14 15:22:28,432 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=780, PETRI_PLACES=206, PETRI_TRANSITIONS=124} [2024-06-14 15:22:28,432 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 175 predicate places. [2024-06-14 15:22:28,432 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 124 transitions, 780 flow [2024-06-14 15:22:28,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 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 15:22:28,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:22:28,433 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:22:28,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2024-06-14 15:22:28,433 INFO L420 AbstractCegarLoop]: === Iteration 135 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:22:28,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:22:28,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1722366997, now seen corresponding path program 8 times [2024-06-14 15:22:28,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:22:28,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525922484] [2024-06-14 15:22:28,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:22:28,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:22:28,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:22:35,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:22:35,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:22:35,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525922484] [2024-06-14 15:22:35,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525922484] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:22:35,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:22:35,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:22:35,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640576301] [2024-06-14 15:22:35,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:22:35,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:22:35,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:22:35,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:22:35,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 Killed by 15