./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.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/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.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/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.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:29:55,535 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 15:29:55,597 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 15:29:55,600 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 15:29:55,601 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 15:29:55,623 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 15:29:55,624 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 15:29:55,624 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 15:29:55,625 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 15:29:55,628 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 15:29:55,628 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 15:29:55,628 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 15:29:55,629 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 15:29:55,629 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 15:29:55,629 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 15:29:55,629 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 15:29:55,630 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 15:29:55,630 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 15:29:55,630 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 15:29:55,630 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 15:29:55,630 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 15:29:55,631 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 15:29:55,632 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 15:29:55,632 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 15:29:55,632 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 15:29:55,632 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 15:29:55,632 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 15:29:55,632 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 15:29:55,633 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 15:29:55,633 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 15:29:55,634 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 15:29:55,634 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 15:29:55,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 15:29:55,634 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 15:29:55,634 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 15:29:55,634 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 15:29:55,634 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 15:29:55,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 15:29:55,635 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 15:29:55,635 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 15:29:55,635 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 15:29:55,635 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 15:29:55,635 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 15:29:55,636 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:29:55,833 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 15:29:55,847 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 15:29:55,849 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 15:29:55,849 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 15:29:55,850 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 15:29:55,851 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/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.yml/witness.yml [2024-06-14 15:29:56,005 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 15:29:56,006 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 15:29:56,006 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2024-06-14 15:29:57,003 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 15:29:57,236 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 15:29:57,237 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2024-06-14 15:29:57,246 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/302e6d2f2/88fb2b852bd744d3af4357173061057a/FLAG6033daba6 [2024-06-14 15:29:57,256 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/302e6d2f2/88fb2b852bd744d3af4357173061057a [2024-06-14 15:29:57,257 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 15:29:57,258 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 15:29:57,258 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 15:29:57,258 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 15:29:57,262 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 15:29:57,263 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:29:56" (1/2) ... [2024-06-14 15:29:57,263 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bd95564 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:29:57, skipping insertion in model container [2024-06-14 15:29:57,263 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:29:56" (1/2) ... [2024-06-14 15:29:57,264 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@45dd2e0e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:29:57, skipping insertion in model container [2024-06-14 15:29:57,265 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:29:57" (2/2) ... [2024-06-14 15:29:57,265 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bd95564 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:29:57, skipping insertion in model container [2024-06-14 15:29:57,265 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:29:57" (2/2) ... [2024-06-14 15:29:57,265 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 15:29:57,306 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 15:29:57,307 INFO L97 edCorrectnessWitness]: Location invariant before [L809-L809] ((((((((((((((! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 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 )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (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 )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )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 )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd1) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd1) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || ((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p1_EAX <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-14 15:29:57,308 INFO L97 edCorrectnessWitness]: Location invariant before [L808-L808] ((((((((((((((! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 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 )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (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 )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )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 )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd1) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd1) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || ((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p1_EAX <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-14 15:29:57,308 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 15:29:57,308 INFO L106 edCorrectnessWitness]: ghost_update [L806-L806] multithreaded = 1; [2024-06-14 15:29:57,346 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 15:29:57,674 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 15:29:57,684 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-14 15:29:57,916 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 15:29:57,947 INFO L206 MainTranslator]: Completed translation [2024-06-14 15:29:57,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:29:57 WrapperNode [2024-06-14 15:29:57,948 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 15:29:57,948 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 15:29:57,949 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 15:29:57,949 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 15:29:57,954 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:29:57" (1/1) ... [2024-06-14 15:29:57,978 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:29:57" (1/1) ... [2024-06-14 15:29:58,054 INFO L138 Inliner]: procedures = 174, calls = 34, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 112 [2024-06-14 15:29:58,055 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 15:29:58,056 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 15:29:58,056 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 15:29:58,056 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 15:29:58,065 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:29:57" (1/1) ... [2024-06-14 15:29:58,065 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:29:57" (1/1) ... [2024-06-14 15:29:58,085 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:29:57" (1/1) ... [2024-06-14 15:29:58,122 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:29:58,123 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:29:57" (1/1) ... [2024-06-14 15:29:58,124 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:29:57" (1/1) ... [2024-06-14 15:29:58,145 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:29:57" (1/1) ... [2024-06-14 15:29:58,147 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:29:57" (1/1) ... [2024-06-14 15:29:58,153 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:29:57" (1/1) ... [2024-06-14 15:29:58,157 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:29:57" (1/1) ... [2024-06-14 15:29:58,169 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 15:29:58,171 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 15:29:58,171 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 15:29:58,171 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 15:29:58,172 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:29:57" (1/1) ... [2024-06-14 15:29:58,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 15:29:58,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 15:29:58,196 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:29:58,205 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:29:58,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-14 15:29:58,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 15:29:58,242 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-14 15:29:58,242 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-14 15:29:58,242 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-14 15:29:58,242 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-14 15:29:58,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 15:29:58,243 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-14 15:29:58,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 15:29:58,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 15:29:58,244 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:29:58,371 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 15:29:58,373 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 15:29:58,996 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 15:29:58,997 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 15:29:59,166 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 15:29:59,166 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-14 15:29:59,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:29:59 BoogieIcfgContainer [2024-06-14 15:29:59,169 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 15:29:59,171 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 15:29:59,172 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 15:29:59,174 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 15:29:59,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:29:56" (1/4) ... [2024-06-14 15:29:59,176 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cd1e8c5 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 03:29:59, skipping insertion in model container [2024-06-14 15:29:59,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 03:29:57" (2/4) ... [2024-06-14 15:29:59,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cd1e8c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 03:29:59, skipping insertion in model container [2024-06-14 15:29:59,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:29:57" (3/4) ... [2024-06-14 15:29:59,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cd1e8c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 03:29:59, skipping insertion in model container [2024-06-14 15:29:59,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:29:59" (4/4) ... [2024-06-14 15:29:59,182 INFO L112 eAbstractionObserver]: Analyzing ICFG mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2024-06-14 15:29:59,195 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 15:29:59,196 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-14 15:29:59,196 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 15:29:59,265 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-14 15:29:59,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 68 flow [2024-06-14 15:29:59,327 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2024-06-14 15:29:59,327 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 15:29:59,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 28 events. 0/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-14 15:29:59,329 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 30 transitions, 68 flow [2024-06-14 15:29:59,331 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 22 transitions, 50 flow [2024-06-14 15:29:59,376 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 15:29:59,382 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;@330d0395, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 15:29:59,382 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-14 15:29:59,388 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 15:29:59,388 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-14 15:29:59,388 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 15:29:59,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:29:59,389 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-14 15:29:59,390 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:29:59,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:29:59,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1415696832, now seen corresponding path program 1 times [2024-06-14 15:29:59,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:29:59,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198527844] [2024-06-14 15:29:59,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:29:59,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:29:59,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:30:02,644 INFO L134 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:30:02,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:30:02,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198527844] [2024-06-14 15:30:02,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198527844] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:30:02,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:30:02,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 15:30:02,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892401251] [2024-06-14 15:30:02,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:30:02,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 15:30:02,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:30:02,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 15:30:02,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 15:30:02,735 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2024-06-14 15:30:02,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:02,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:30:02,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2024-06-14 15:30:02,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:30:02,917 INFO L124 PetriNetUnfolderBase]: 162/297 cut-off events. [2024-06-14 15:30:02,918 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-14 15:30:02,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 610 conditions, 297 events. 162/297 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1009 event pairs, 97 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 596. Up to 288 conditions per place. [2024-06-14 15:30:02,922 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 23 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2024-06-14 15:30:02,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 28 transitions, 117 flow [2024-06-14 15:30:02,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 15:30:02,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 15:30:02,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2024-06-14 15:30:02,931 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5444444444444444 [2024-06-14 15:30:02,932 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 50 flow. Second operand 3 states and 49 transitions. [2024-06-14 15:30:02,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 28 transitions, 117 flow [2024-06-14 15:30:02,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 28 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-14 15:30:02,936 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 69 flow [2024-06-14 15:30:02,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=30, PETRI_TRANSITIONS=24} [2024-06-14 15:30:02,939 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 1 predicate places. [2024-06-14 15:30:02,940 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 69 flow [2024-06-14 15:30:02,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:02,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:30:02,940 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:30:02,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 15:30:02,940 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:30:02,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:30:02,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1019821195, now seen corresponding path program 1 times [2024-06-14 15:30:02,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:30:02,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128304081] [2024-06-14 15:30:02,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:30:02,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:30:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:30:05,081 INFO L134 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:30:05,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:30:05,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128304081] [2024-06-14 15:30:05,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128304081] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:30:05,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:30:05,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 15:30:05,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905108460] [2024-06-14 15:30:05,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:30:05,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 15:30:05,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:30:05,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 15:30:05,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-14 15:30:05,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2024-06-14 15:30:05,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 69 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:05,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:30:05,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2024-06-14 15:30:05,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:30:05,276 INFO L124 PetriNetUnfolderBase]: 159/292 cut-off events. [2024-06-14 15:30:05,276 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-06-14 15:30:05,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 682 conditions, 292 events. 159/292 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 996 event pairs, 79 based on Foata normal form. 2/293 useless extension candidates. Maximal degree in co-relation 667. Up to 274 conditions per place. [2024-06-14 15:30:05,279 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 27 selfloop transitions, 5 changer transitions 0/34 dead transitions. [2024-06-14 15:30:05,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 159 flow [2024-06-14 15:30:05,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 15:30:05,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 15:30:05,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2024-06-14 15:30:05,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2024-06-14 15:30:05,280 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 69 flow. Second operand 4 states and 62 transitions. [2024-06-14 15:30:05,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 159 flow [2024-06-14 15:30:05,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 34 transitions, 156 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 15:30:05,282 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 93 flow [2024-06-14 15:30:05,282 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=93, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2024-06-14 15:30:05,283 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 4 predicate places. [2024-06-14 15:30:05,283 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 93 flow [2024-06-14 15:30:05,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:05,283 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:30:05,283 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:30:05,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-14 15:30:05,284 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:30:05,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:30:05,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1554154189, now seen corresponding path program 1 times [2024-06-14 15:30:05,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:30:05,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477693554] [2024-06-14 15:30:05,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:30:05,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:30:05,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:30:07,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:30:07,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:30:07,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477693554] [2024-06-14 15:30:07,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477693554] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:30:07,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:30:07,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 15:30:07,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516691781] [2024-06-14 15:30:07,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:30:07,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 15:30:07,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:30:07,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 15:30:07,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-14 15:30:07,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2024-06-14 15:30:07,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 93 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 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:30:07,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:30:07,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2024-06-14 15:30:07,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:30:07,489 INFO L124 PetriNetUnfolderBase]: 188/340 cut-off events. [2024-06-14 15:30:07,489 INFO L125 PetriNetUnfolderBase]: For 179/179 co-relation queries the response was YES. [2024-06-14 15:30:07,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 867 conditions, 340 events. 188/340 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1231 event pairs, 62 based on Foata normal form. 5/344 useless extension candidates. Maximal degree in co-relation 850. Up to 260 conditions per place. [2024-06-14 15:30:07,494 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 39 selfloop transitions, 11 changer transitions 0/52 dead transitions. [2024-06-14 15:30:07,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 52 transitions, 267 flow [2024-06-14 15:30:07,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:30:07,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:30:07,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2024-06-14 15:30:07,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2024-06-14 15:30:07,498 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 93 flow. Second operand 5 states and 85 transitions. [2024-06-14 15:30:07,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 52 transitions, 267 flow [2024-06-14 15:30:07,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 52 transitions, 258 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-14 15:30:07,501 INFO L231 Difference]: Finished difference. Result has 38 places, 34 transitions, 162 flow [2024-06-14 15:30:07,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=162, PETRI_PLACES=38, PETRI_TRANSITIONS=34} [2024-06-14 15:30:07,503 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 9 predicate places. [2024-06-14 15:30:07,503 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 34 transitions, 162 flow [2024-06-14 15:30:07,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 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:30:07,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:30:07,503 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:30:07,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-14 15:30:07,504 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:30:07,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:30:07,504 INFO L85 PathProgramCache]: Analyzing trace with hash -934139138, now seen corresponding path program 1 times [2024-06-14 15:30:07,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:30:07,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473414257] [2024-06-14 15:30:07,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:30:07,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:30:07,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:30:09,876 INFO L134 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:30:09,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:30:09,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473414257] [2024-06-14 15:30:09,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473414257] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:30:09,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:30:09,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 15:30:09,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802424972] [2024-06-14 15:30:09,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:30:09,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 15:30:09,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:30:09,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 15:30:09,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-14 15:30:09,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2024-06-14 15:30:09,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 162 flow. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:09,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:30:09,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2024-06-14 15:30:09,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:30:10,202 INFO L124 PetriNetUnfolderBase]: 189/342 cut-off events. [2024-06-14 15:30:10,202 INFO L125 PetriNetUnfolderBase]: For 407/407 co-relation queries the response was YES. [2024-06-14 15:30:10,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1096 conditions, 342 events. 189/342 cut-off events. For 407/407 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1222 event pairs, 44 based on Foata normal form. 3/344 useless extension candidates. Maximal degree in co-relation 1076. Up to 283 conditions per place. [2024-06-14 15:30:10,205 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 44 selfloop transitions, 14 changer transitions 0/60 dead transitions. [2024-06-14 15:30:10,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 60 transitions, 374 flow [2024-06-14 15:30:10,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:30:10,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:30:10,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2024-06-14 15:30:10,209 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2024-06-14 15:30:10,209 INFO L175 Difference]: Start difference. First operand has 38 places, 34 transitions, 162 flow. Second operand 6 states and 95 transitions. [2024-06-14 15:30:10,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 60 transitions, 374 flow [2024-06-14 15:30:10,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 60 transitions, 370 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-06-14 15:30:10,213 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 258 flow [2024-06-14 15:30:10,213 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=258, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2024-06-14 15:30:10,214 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 17 predicate places. [2024-06-14 15:30:10,214 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 258 flow [2024-06-14 15:30:10,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:10,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:30:10,215 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:30:10,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-14 15:30:10,215 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:30:10,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:30:10,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1106458290, now seen corresponding path program 1 times [2024-06-14 15:30:10,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:30:10,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221294574] [2024-06-14 15:30:10,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:30:10,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:30:10,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:30:12,726 INFO L134 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:30:12,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:30:12,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221294574] [2024-06-14 15:30:12,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221294574] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:30:12,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:30:12,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:30:12,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275671973] [2024-06-14 15:30:12,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:30:12,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:30:12,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:30:12,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:30:12,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:30:12,812 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2024-06-14 15:30:12,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 258 flow. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:12,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:30:12,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2024-06-14 15:30:12,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:30:13,077 INFO L124 PetriNetUnfolderBase]: 190/345 cut-off events. [2024-06-14 15:30:13,077 INFO L125 PetriNetUnfolderBase]: For 713/713 co-relation queries the response was YES. [2024-06-14 15:30:13,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1274 conditions, 345 events. 190/345 cut-off events. For 713/713 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1240 event pairs, 28 based on Foata normal form. 6/350 useless extension candidates. Maximal degree in co-relation 1249. Up to 260 conditions per place. [2024-06-14 15:30:13,080 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 44 selfloop transitions, 16 changer transitions 0/62 dead transitions. [2024-06-14 15:30:13,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 62 transitions, 438 flow [2024-06-14 15:30:13,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:30:13,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:30:13,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2024-06-14 15:30:13,082 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49523809523809526 [2024-06-14 15:30:13,082 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 258 flow. Second operand 7 states and 104 transitions. [2024-06-14 15:30:13,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 62 transitions, 438 flow [2024-06-14 15:30:13,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 62 transitions, 422 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-06-14 15:30:13,085 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 277 flow [2024-06-14 15:30:13,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=277, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2024-06-14 15:30:13,086 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 22 predicate places. [2024-06-14 15:30:13,086 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 277 flow [2024-06-14 15:30:13,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:13,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:30:13,086 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:30:13,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-14 15:30:13,087 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:30:13,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:30:13,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1089033521, now seen corresponding path program 1 times [2024-06-14 15:30:13,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:30:13,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430917935] [2024-06-14 15:30:13,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:30:13,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:30:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:30:17,603 INFO L134 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:30:17,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:30:17,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430917935] [2024-06-14 15:30:17,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430917935] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:30:17,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:30:17,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 15:30:17,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284786497] [2024-06-14 15:30:17,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:30:17,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 15:30:17,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:30:17,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 15:30:17,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-14 15:30:17,674 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:30:17,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 277 flow. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:17,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:30:17,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:30:17,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:30:17,932 INFO L124 PetriNetUnfolderBase]: 184/336 cut-off events. [2024-06-14 15:30:17,932 INFO L125 PetriNetUnfolderBase]: For 813/813 co-relation queries the response was YES. [2024-06-14 15:30:17,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1328 conditions, 336 events. 184/336 cut-off events. For 813/813 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1190 event pairs, 41 based on Foata normal form. 3/338 useless extension candidates. Maximal degree in co-relation 1301. Up to 318 conditions per place. [2024-06-14 15:30:17,935 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 41 selfloop transitions, 7 changer transitions 0/50 dead transitions. [2024-06-14 15:30:17,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 50 transitions, 397 flow [2024-06-14 15:30:17,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:30:17,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:30:17,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2024-06-14 15:30:17,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4066666666666667 [2024-06-14 15:30:17,937 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 277 flow. Second operand 5 states and 61 transitions. [2024-06-14 15:30:17,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 50 transitions, 397 flow [2024-06-14 15:30:17,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 50 transitions, 356 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-14 15:30:17,939 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 270 flow [2024-06-14 15:30:17,943 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=270, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2024-06-14 15:30:17,944 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 22 predicate places. [2024-06-14 15:30:17,946 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 270 flow [2024-06-14 15:30:17,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:17,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:30:17,946 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:30:17,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-14 15:30:17,946 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:30:17,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:30:17,947 INFO L85 PathProgramCache]: Analyzing trace with hash 2019593838, now seen corresponding path program 1 times [2024-06-14 15:30:17,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:30:17,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859633326] [2024-06-14 15:30:17,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:30:17,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:30:17,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:30:21,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:30:21,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:30:21,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859633326] [2024-06-14 15:30:21,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859633326] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:30:21,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:30:21,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:30:21,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327181796] [2024-06-14 15:30:21,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:30:21,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:30:21,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:30:21,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:30:21,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:30:21,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:30:21,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 270 flow. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 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:30:21,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:30:21,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:30:21,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:30:22,170 INFO L124 PetriNetUnfolderBase]: 187/342 cut-off events. [2024-06-14 15:30:22,171 INFO L125 PetriNetUnfolderBase]: For 970/970 co-relation queries the response was YES. [2024-06-14 15:30:22,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1337 conditions, 342 events. 187/342 cut-off events. For 970/970 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1222 event pairs, 42 based on Foata normal form. 6/347 useless extension candidates. Maximal degree in co-relation 1308. Up to 256 conditions per place. [2024-06-14 15:30:22,173 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 42 selfloop transitions, 16 changer transitions 0/60 dead transitions. [2024-06-14 15:30:22,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 60 transitions, 458 flow [2024-06-14 15:30:22,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:30:22,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:30:22,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2024-06-14 15:30:22,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-14 15:30:22,175 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 270 flow. Second operand 6 states and 80 transitions. [2024-06-14 15:30:22,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 60 transitions, 458 flow [2024-06-14 15:30:22,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 60 transitions, 444 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-14 15:30:22,178 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 328 flow [2024-06-14 15:30:22,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=328, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2024-06-14 15:30:22,179 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 25 predicate places. [2024-06-14 15:30:22,179 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 328 flow [2024-06-14 15:30:22,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 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:30:22,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:30:22,179 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:30:22,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-14 15:30:22,180 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:30:22,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:30:22,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1410785008, now seen corresponding path program 2 times [2024-06-14 15:30:22,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:30:22,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525095819] [2024-06-14 15:30:22,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:30:22,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:30:22,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:30:25,691 INFO L134 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:30:25,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:30:25,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525095819] [2024-06-14 15:30:25,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525095819] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:30:25,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:30:25,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:30:25,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001471221] [2024-06-14 15:30:25,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:30:25,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:30:25,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:30:25,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:30:25,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:30:25,739 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:30:25,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 328 flow. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 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:30:25,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:30:25,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:30:25,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:30:25,949 INFO L124 PetriNetUnfolderBase]: 176/322 cut-off events. [2024-06-14 15:30:25,949 INFO L125 PetriNetUnfolderBase]: For 1103/1103 co-relation queries the response was YES. [2024-06-14 15:30:25,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1314 conditions, 322 events. 176/322 cut-off events. For 1103/1103 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1122 event pairs, 38 based on Foata normal form. 3/324 useless extension candidates. Maximal degree in co-relation 1284. Up to 301 conditions per place. [2024-06-14 15:30:25,953 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 44 selfloop transitions, 9 changer transitions 0/55 dead transitions. [2024-06-14 15:30:25,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 55 transitions, 455 flow [2024-06-14 15:30:25,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:30:25,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:30:25,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2024-06-14 15:30:25,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-06-14 15:30:25,955 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 328 flow. Second operand 6 states and 70 transitions. [2024-06-14 15:30:25,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 55 transitions, 455 flow [2024-06-14 15:30:25,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 55 transitions, 436 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-14 15:30:25,959 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 333 flow [2024-06-14 15:30:25,962 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=333, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2024-06-14 15:30:25,963 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 28 predicate places. [2024-06-14 15:30:25,963 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 333 flow [2024-06-14 15:30:25,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 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:30:25,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:30:25,963 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:30:25,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-14 15:30:25,963 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:30:25,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:30:25,964 INFO L85 PathProgramCache]: Analyzing trace with hash 132257820, now seen corresponding path program 1 times [2024-06-14 15:30:25,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:30:25,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063098401] [2024-06-14 15:30:25,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:30:25,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:30:26,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:30:29,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:30:29,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:30:29,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063098401] [2024-06-14 15:30:29,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063098401] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:30:29,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:30:29,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 15:30:29,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774089111] [2024-06-14 15:30:29,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:30:29,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 15:30:29,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:30:29,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 15:30:29,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-14 15:30:29,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2024-06-14 15:30:29,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 333 flow. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:29,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:30:29,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2024-06-14 15:30:29,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:30:29,706 INFO L124 PetriNetUnfolderBase]: 177/324 cut-off events. [2024-06-14 15:30:29,706 INFO L125 PetriNetUnfolderBase]: For 1258/1258 co-relation queries the response was YES. [2024-06-14 15:30:29,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1336 conditions, 324 events. 177/324 cut-off events. For 1258/1258 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1134 event pairs, 31 based on Foata normal form. 2/325 useless extension candidates. Maximal degree in co-relation 1305. Up to 303 conditions per place. [2024-06-14 15:30:29,708 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 48 selfloop transitions, 9 changer transitions 0/59 dead transitions. [2024-06-14 15:30:29,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 59 transitions, 485 flow [2024-06-14 15:30:29,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:30:29,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:30:29,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2024-06-14 15:30:29,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2024-06-14 15:30:29,710 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 333 flow. Second operand 6 states and 78 transitions. [2024-06-14 15:30:29,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 59 transitions, 485 flow [2024-06-14 15:30:29,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 59 transitions, 440 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-14 15:30:29,713 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 342 flow [2024-06-14 15:30:29,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=342, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2024-06-14 15:30:29,714 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 29 predicate places. [2024-06-14 15:30:29,714 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 342 flow [2024-06-14 15:30:29,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:29,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:30:29,714 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:30:29,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-14 15:30:29,714 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:30:29,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:30:29,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1643289820, now seen corresponding path program 1 times [2024-06-14 15:30:29,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:30:29,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976210006] [2024-06-14 15:30:29,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:30:29,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:30:29,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:30:34,923 INFO L134 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:30:34,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:30:34,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976210006] [2024-06-14 15:30:34,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976210006] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:30:34,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:30:34,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:30:34,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932662639] [2024-06-14 15:30:34,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:30:34,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:30:34,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:30:34,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:30:34,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:30:34,991 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:30:34,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 342 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:34,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:30:34,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:30:34,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:30:35,265 INFO L124 PetriNetUnfolderBase]: 174/319 cut-off events. [2024-06-14 15:30:35,266 INFO L125 PetriNetUnfolderBase]: For 1238/1238 co-relation queries the response was YES. [2024-06-14 15:30:35,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1356 conditions, 319 events. 174/319 cut-off events. For 1238/1238 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1096 event pairs, 32 based on Foata normal form. 2/320 useless extension candidates. Maximal degree in co-relation 1325. Up to 295 conditions per place. [2024-06-14 15:30:35,268 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 47 selfloop transitions, 10 changer transitions 0/59 dead transitions. [2024-06-14 15:30:35,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 59 transitions, 474 flow [2024-06-14 15:30:35,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:30:35,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:30:35,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2024-06-14 15:30:35,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2024-06-14 15:30:35,269 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 342 flow. Second operand 7 states and 77 transitions. [2024-06-14 15:30:35,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 59 transitions, 474 flow [2024-06-14 15:30:35,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 59 transitions, 452 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-14 15:30:35,272 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 344 flow [2024-06-14 15:30:35,272 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=344, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2024-06-14 15:30:35,272 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 33 predicate places. [2024-06-14 15:30:35,273 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 344 flow [2024-06-14 15:30:35,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:35,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:30:35,273 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:30:35,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-14 15:30:35,273 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:30:35,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:30:35,274 INFO L85 PathProgramCache]: Analyzing trace with hash -499325235, now seen corresponding path program 1 times [2024-06-14 15:30:35,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:30:35,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071158823] [2024-06-14 15:30:35,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:30:35,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:30:35,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:30:39,580 INFO L134 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:30:39,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:30:39,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071158823] [2024-06-14 15:30:39,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071158823] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:30:39,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:30:39,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:30:39,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446986163] [2024-06-14 15:30:39,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:30:39,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:30:39,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:30:39,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:30:39,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:30:39,663 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:30:39,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 344 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:39,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:30:39,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:30:39,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:30:39,924 INFO L124 PetriNetUnfolderBase]: 177/324 cut-off events. [2024-06-14 15:30:39,924 INFO L125 PetriNetUnfolderBase]: For 1439/1439 co-relation queries the response was YES. [2024-06-14 15:30:39,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1392 conditions, 324 events. 177/324 cut-off events. For 1439/1439 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1116 event pairs, 30 based on Foata normal form. 1/324 useless extension candidates. Maximal degree in co-relation 1359. Up to 261 conditions per place. [2024-06-14 15:30:39,927 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 51 selfloop transitions, 16 changer transitions 0/69 dead transitions. [2024-06-14 15:30:39,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 69 transitions, 556 flow [2024-06-14 15:30:39,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:30:39,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:30:39,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 88 transitions. [2024-06-14 15:30:39,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41904761904761906 [2024-06-14 15:30:39,929 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 344 flow. Second operand 7 states and 88 transitions. [2024-06-14 15:30:39,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 69 transitions, 556 flow [2024-06-14 15:30:39,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 69 transitions, 527 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-14 15:30:39,938 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 380 flow [2024-06-14 15:30:39,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=380, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2024-06-14 15:30:39,939 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 35 predicate places. [2024-06-14 15:30:39,939 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 380 flow [2024-06-14 15:30:39,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:39,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:30:39,939 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:30:39,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-14 15:30:39,939 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:30:39,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:30:39,940 INFO L85 PathProgramCache]: Analyzing trace with hash -335648491, now seen corresponding path program 2 times [2024-06-14 15:30:39,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:30:39,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024687103] [2024-06-14 15:30:39,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:30:39,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:30:39,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:30:44,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:30:44,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:30:44,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024687103] [2024-06-14 15:30:44,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024687103] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:30:44,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:30:44,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:30:44,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241463526] [2024-06-14 15:30:44,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:30:44,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:30:44,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:30:44,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:30:44,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:30:44,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:30:44,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 380 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:44,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:30:44,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:30:44,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:30:44,526 INFO L124 PetriNetUnfolderBase]: 175/321 cut-off events. [2024-06-14 15:30:44,526 INFO L125 PetriNetUnfolderBase]: For 1605/1605 co-relation queries the response was YES. [2024-06-14 15:30:44,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1426 conditions, 321 events. 175/321 cut-off events. For 1605/1605 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1112 event pairs, 32 based on Foata normal form. 1/321 useless extension candidates. Maximal degree in co-relation 1392. Up to 274 conditions per place. [2024-06-14 15:30:44,530 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 49 selfloop transitions, 15 changer transitions 0/66 dead transitions. [2024-06-14 15:30:44,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 66 transitions, 539 flow [2024-06-14 15:30:44,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:30:44,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:30:44,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 84 transitions. [2024-06-14 15:30:44,532 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-14 15:30:44,532 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 380 flow. Second operand 7 states and 84 transitions. [2024-06-14 15:30:44,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 66 transitions, 539 flow [2024-06-14 15:30:44,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 66 transitions, 506 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-14 15:30:44,537 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 389 flow [2024-06-14 15:30:44,537 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=389, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2024-06-14 15:30:44,538 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 38 predicate places. [2024-06-14 15:30:44,539 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 389 flow [2024-06-14 15:30:44,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:44,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:30:44,539 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:30:44,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-14 15:30:44,539 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:30:44,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:30:44,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1452653752, now seen corresponding path program 1 times [2024-06-14 15:30:44,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:30:44,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785309535] [2024-06-14 15:30:44,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:30:44,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:30:44,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:30:48,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:30:48,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:30:48,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785309535] [2024-06-14 15:30:48,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785309535] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:30:48,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:30:48,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:30:48,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308269958] [2024-06-14 15:30:48,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:30:48,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:30:48,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:30:48,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:30:48,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:30:48,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:30:48,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 389 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:48,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:30:48,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:30:48,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:30:48,779 INFO L124 PetriNetUnfolderBase]: 172/317 cut-off events. [2024-06-14 15:30:48,779 INFO L125 PetriNetUnfolderBase]: For 1767/1767 co-relation queries the response was YES. [2024-06-14 15:30:48,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1414 conditions, 317 events. 172/317 cut-off events. For 1767/1767 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1106 event pairs, 31 based on Foata normal form. 2/318 useless extension candidates. Maximal degree in co-relation 1379. Up to 214 conditions per place. [2024-06-14 15:30:48,781 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 47 selfloop transitions, 26 changer transitions 0/75 dead transitions. [2024-06-14 15:30:48,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 75 transitions, 627 flow [2024-06-14 15:30:48,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:30:48,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:30:48,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2024-06-14 15:30:48,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-06-14 15:30:48,783 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 389 flow. Second operand 6 states and 85 transitions. [2024-06-14 15:30:48,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 75 transitions, 627 flow [2024-06-14 15:30:48,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 75 transitions, 593 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-14 15:30:48,787 INFO L231 Difference]: Finished difference. Result has 69 places, 60 transitions, 474 flow [2024-06-14 15:30:48,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=474, PETRI_PLACES=69, PETRI_TRANSITIONS=60} [2024-06-14 15:30:48,787 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 40 predicate places. [2024-06-14 15:30:48,787 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 60 transitions, 474 flow [2024-06-14 15:30:48,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:48,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:30:48,788 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:30:48,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-14 15:30:48,788 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:30:48,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:30:48,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1452920879, now seen corresponding path program 1 times [2024-06-14 15:30:48,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:30:48,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100826911] [2024-06-14 15:30:48,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:30:48,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:30:48,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:30:52,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:30:52,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:30:52,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100826911] [2024-06-14 15:30:52,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100826911] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:30:52,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:30:52,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:30:52,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915100267] [2024-06-14 15:30:52,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:30:52,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:30:52,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:30:52,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:30:52,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:30:53,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:30:53,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 60 transitions, 474 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 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:30:53,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:30:53,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:30:53,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:30:53,344 INFO L124 PetriNetUnfolderBase]: 169/312 cut-off events. [2024-06-14 15:30:53,345 INFO L125 PetriNetUnfolderBase]: For 2095/2095 co-relation queries the response was YES. [2024-06-14 15:30:53,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1498 conditions, 312 events. 169/312 cut-off events. For 2095/2095 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1070 event pairs, 30 based on Foata normal form. 1/312 useless extension candidates. Maximal degree in co-relation 1462. Up to 285 conditions per place. [2024-06-14 15:30:53,347 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 53 selfloop transitions, 13 changer transitions 0/68 dead transitions. [2024-06-14 15:30:53,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 68 transitions, 626 flow [2024-06-14 15:30:53,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:30:53,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:30:53,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2024-06-14 15:30:53,348 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3761904761904762 [2024-06-14 15:30:53,348 INFO L175 Difference]: Start difference. First operand has 69 places, 60 transitions, 474 flow. Second operand 7 states and 79 transitions. [2024-06-14 15:30:53,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 68 transitions, 626 flow [2024-06-14 15:30:53,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 68 transitions, 599 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-14 15:30:53,353 INFO L231 Difference]: Finished difference. Result has 73 places, 60 transitions, 481 flow [2024-06-14 15:30:53,353 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=481, PETRI_PLACES=73, PETRI_TRANSITIONS=60} [2024-06-14 15:30:53,353 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 44 predicate places. [2024-06-14 15:30:53,353 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 60 transitions, 481 flow [2024-06-14 15:30:53,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 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:30:53,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:30:53,354 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:30:53,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-14 15:30:53,354 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:30:53,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:30:53,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1700727245, now seen corresponding path program 1 times [2024-06-14 15:30:53,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:30:53,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836445531] [2024-06-14 15:30:53,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:30:53,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:30:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:30:58,036 INFO L134 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:30:58,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:30:58,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836445531] [2024-06-14 15:30:58,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836445531] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:30:58,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:30:58,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:30:58,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286834152] [2024-06-14 15:30:58,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:30:58,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:30:58,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:30:58,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:30:58,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:30:58,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:30:58,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 60 transitions, 481 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:30:58,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:30:58,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:30:58,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:30:58,493 INFO L124 PetriNetUnfolderBase]: 173/320 cut-off events. [2024-06-14 15:30:58,494 INFO L125 PetriNetUnfolderBase]: For 2155/2155 co-relation queries the response was YES. [2024-06-14 15:30:58,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1533 conditions, 320 events. 173/320 cut-off events. For 2155/2155 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1119 event pairs, 15 based on Foata normal form. 2/321 useless extension candidates. Maximal degree in co-relation 1496. Up to 215 conditions per place. [2024-06-14 15:30:58,496 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 56 selfloop transitions, 20 changer transitions 0/78 dead transitions. [2024-06-14 15:30:58,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 78 transitions, 705 flow [2024-06-14 15:30:58,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:30:58,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:30:58,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2024-06-14 15:30:58,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-14 15:30:58,502 INFO L175 Difference]: Start difference. First operand has 73 places, 60 transitions, 481 flow. Second operand 8 states and 96 transitions. [2024-06-14 15:30:58,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 78 transitions, 705 flow [2024-06-14 15:30:58,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 78 transitions, 649 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-14 15:30:58,507 INFO L231 Difference]: Finished difference. Result has 74 places, 61 transitions, 475 flow [2024-06-14 15:30:58,507 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=475, PETRI_PLACES=74, PETRI_TRANSITIONS=61} [2024-06-14 15:30:58,508 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 45 predicate places. [2024-06-14 15:30:58,508 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 61 transitions, 475 flow [2024-06-14 15:30:58,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:30:58,508 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:30:58,508 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:30:58,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-14 15:30:58,509 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:30:58,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:30:58,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1928786739, now seen corresponding path program 1 times [2024-06-14 15:30:58,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:30:58,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504624198] [2024-06-14 15:30:58,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:30:58,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:30:58,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:31:02,838 INFO L134 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:31:02,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:31:02,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504624198] [2024-06-14 15:31:02,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504624198] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:31:02,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:31:02,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:31:02,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562885700] [2024-06-14 15:31:02,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:31:02,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:31:02,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:31:02,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:31:02,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:31:02,936 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:31:02,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 61 transitions, 475 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:31:02,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:31:02,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:31:02,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:31:03,232 INFO L124 PetriNetUnfolderBase]: 179/330 cut-off events. [2024-06-14 15:31:03,232 INFO L125 PetriNetUnfolderBase]: For 2322/2322 co-relation queries the response was YES. [2024-06-14 15:31:03,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1583 conditions, 330 events. 179/330 cut-off events. For 2322/2322 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1165 event pairs, 31 based on Foata normal form. 2/331 useless extension candidates. Maximal degree in co-relation 1546. Up to 182 conditions per place. [2024-06-14 15:31:03,235 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 54 selfloop transitions, 27 changer transitions 0/83 dead transitions. [2024-06-14 15:31:03,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 83 transitions, 745 flow [2024-06-14 15:31:03,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:31:03,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:31:03,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2024-06-14 15:31:03,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2024-06-14 15:31:03,236 INFO L175 Difference]: Start difference. First operand has 74 places, 61 transitions, 475 flow. Second operand 8 states and 104 transitions. [2024-06-14 15:31:03,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 83 transitions, 745 flow [2024-06-14 15:31:03,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 83 transitions, 707 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-14 15:31:03,241 INFO L231 Difference]: Finished difference. Result has 77 places, 65 transitions, 532 flow [2024-06-14 15:31:03,241 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=532, PETRI_PLACES=77, PETRI_TRANSITIONS=65} [2024-06-14 15:31:03,242 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 48 predicate places. [2024-06-14 15:31:03,242 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 65 transitions, 532 flow [2024-06-14 15:31:03,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:31:03,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:31:03,242 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:31:03,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-14 15:31:03,243 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:31:03,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:31:03,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1703468885, now seen corresponding path program 2 times [2024-06-14 15:31:03,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:31:03,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505889192] [2024-06-14 15:31:03,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:31:03,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:31:03,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:31:08,129 INFO L134 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:31:08,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:31:08,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505889192] [2024-06-14 15:31:08,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505889192] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:31:08,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:31:08,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:31:08,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19852773] [2024-06-14 15:31:08,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:31:08,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:31:08,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:31:08,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:31:08,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:31:08,238 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:31:08,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 65 transitions, 532 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:31:08,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:31:08,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:31:08,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:31:08,496 INFO L124 PetriNetUnfolderBase]: 183/338 cut-off events. [2024-06-14 15:31:08,497 INFO L125 PetriNetUnfolderBase]: For 2718/2718 co-relation queries the response was YES. [2024-06-14 15:31:08,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1658 conditions, 338 events. 183/338 cut-off events. For 2718/2718 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1224 event pairs, 32 based on Foata normal form. 2/339 useless extension candidates. Maximal degree in co-relation 1620. Up to 270 conditions per place. [2024-06-14 15:31:08,499 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 61 selfloop transitions, 18 changer transitions 0/81 dead transitions. [2024-06-14 15:31:08,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 81 transitions, 731 flow [2024-06-14 15:31:08,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:31:08,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:31:08,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2024-06-14 15:31:08,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-14 15:31:08,501 INFO L175 Difference]: Start difference. First operand has 77 places, 65 transitions, 532 flow. Second operand 8 states and 96 transitions. [2024-06-14 15:31:08,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 81 transitions, 731 flow [2024-06-14 15:31:08,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 81 transitions, 672 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-14 15:31:08,506 INFO L231 Difference]: Finished difference. Result has 80 places, 66 transitions, 520 flow [2024-06-14 15:31:08,507 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=520, PETRI_PLACES=80, PETRI_TRANSITIONS=66} [2024-06-14 15:31:08,507 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 51 predicate places. [2024-06-14 15:31:08,507 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 66 transitions, 520 flow [2024-06-14 15:31:08,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:31:08,508 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:31:08,508 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:31:08,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-14 15:31:08,508 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:31:08,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:31:08,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1925985579, now seen corresponding path program 2 times [2024-06-14 15:31:08,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:31:08,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657423184] [2024-06-14 15:31:08,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:31:08,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:31:08,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:31:13,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:31:13,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:31:13,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657423184] [2024-06-14 15:31:13,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657423184] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:31:13,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:31:13,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:31:13,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734742038] [2024-06-14 15:31:13,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:31:13,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:31:13,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:31:13,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:31:13,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:31:13,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:31:13,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 66 transitions, 520 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:31:13,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:31:13,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:31:13,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:31:13,425 INFO L124 PetriNetUnfolderBase]: 189/348 cut-off events. [2024-06-14 15:31:13,425 INFO L125 PetriNetUnfolderBase]: For 2971/2971 co-relation queries the response was YES. [2024-06-14 15:31:13,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1692 conditions, 348 events. 189/348 cut-off events. For 2971/2971 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1272 event pairs, 28 based on Foata normal form. 2/349 useless extension candidates. Maximal degree in co-relation 1653. Up to 264 conditions per place. [2024-06-14 15:31:13,427 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 61 selfloop transitions, 19 changer transitions 0/82 dead transitions. [2024-06-14 15:31:13,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 82 transitions, 734 flow [2024-06-14 15:31:13,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:31:13,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:31:13,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2024-06-14 15:31:13,428 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4083333333333333 [2024-06-14 15:31:13,428 INFO L175 Difference]: Start difference. First operand has 80 places, 66 transitions, 520 flow. Second operand 8 states and 98 transitions. [2024-06-14 15:31:13,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 82 transitions, 734 flow [2024-06-14 15:31:13,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 82 transitions, 698 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-06-14 15:31:13,433 INFO L231 Difference]: Finished difference. Result has 82 places, 68 transitions, 547 flow [2024-06-14 15:31:13,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=547, PETRI_PLACES=82, PETRI_TRANSITIONS=68} [2024-06-14 15:31:13,434 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 53 predicate places. [2024-06-14 15:31:13,434 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 68 transitions, 547 flow [2024-06-14 15:31:13,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:31:13,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:31:13,434 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:31:13,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-14 15:31:13,434 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:31:13,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:31:13,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1925990229, now seen corresponding path program 3 times [2024-06-14 15:31:13,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:31:13,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517223999] [2024-06-14 15:31:13,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:31:13,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:31:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:31:17,647 INFO L134 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:31:17,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:31:17,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517223999] [2024-06-14 15:31:17,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517223999] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:31:17,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:31:17,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:31:17,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239382513] [2024-06-14 15:31:17,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:31:17,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:31:17,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:31:17,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:31:17,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:31:17,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:31:17,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 68 transitions, 547 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:31:17,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:31:17,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:31:17,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:31:18,045 INFO L124 PetriNetUnfolderBase]: 195/358 cut-off events. [2024-06-14 15:31:18,045 INFO L125 PetriNetUnfolderBase]: For 3411/3411 co-relation queries the response was YES. [2024-06-14 15:31:18,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1775 conditions, 358 events. 195/358 cut-off events. For 3411/3411 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1315 event pairs, 30 based on Foata normal form. 2/359 useless extension candidates. Maximal degree in co-relation 1735. Up to 240 conditions per place. [2024-06-14 15:31:18,048 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 55 selfloop transitions, 28 changer transitions 0/85 dead transitions. [2024-06-14 15:31:18,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 85 transitions, 775 flow [2024-06-14 15:31:18,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:31:18,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:31:18,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2024-06-14 15:31:18,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425 [2024-06-14 15:31:18,051 INFO L175 Difference]: Start difference. First operand has 82 places, 68 transitions, 547 flow. Second operand 8 states and 102 transitions. [2024-06-14 15:31:18,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 85 transitions, 775 flow [2024-06-14 15:31:18,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 85 transitions, 725 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-14 15:31:18,061 INFO L231 Difference]: Finished difference. Result has 84 places, 70 transitions, 582 flow [2024-06-14 15:31:18,061 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=582, PETRI_PLACES=84, PETRI_TRANSITIONS=70} [2024-06-14 15:31:18,061 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 55 predicate places. [2024-06-14 15:31:18,061 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 70 transitions, 582 flow [2024-06-14 15:31:18,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:31:18,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:31:18,062 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:31:18,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-14 15:31:18,062 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:31:18,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:31:18,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1925990353, now seen corresponding path program 3 times [2024-06-14 15:31:18,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:31:18,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305060221] [2024-06-14 15:31:18,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:31:18,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:31:18,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:31:22,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:31:22,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:31:22,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305060221] [2024-06-14 15:31:22,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305060221] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:31:22,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:31:22,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:31:22,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249303107] [2024-06-14 15:31:22,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:31:22,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:31:22,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:31:22,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:31:22,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:31:22,674 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:31:22,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 70 transitions, 582 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:31:22,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:31:22,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:31:22,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:31:22,920 INFO L124 PetriNetUnfolderBase]: 192/353 cut-off events. [2024-06-14 15:31:22,920 INFO L125 PetriNetUnfolderBase]: For 3443/3443 co-relation queries the response was YES. [2024-06-14 15:31:22,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1763 conditions, 353 events. 192/353 cut-off events. For 3443/3443 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1293 event pairs, 31 based on Foata normal form. 2/354 useless extension candidates. Maximal degree in co-relation 1722. Up to 300 conditions per place. [2024-06-14 15:31:22,923 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 64 selfloop transitions, 16 changer transitions 0/82 dead transitions. [2024-06-14 15:31:22,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 82 transitions, 770 flow [2024-06-14 15:31:22,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:31:22,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:31:22,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2024-06-14 15:31:22,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-14 15:31:22,925 INFO L175 Difference]: Start difference. First operand has 84 places, 70 transitions, 582 flow. Second operand 8 states and 93 transitions. [2024-06-14 15:31:22,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 82 transitions, 770 flow [2024-06-14 15:31:22,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 82 transitions, 705 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-14 15:31:22,930 INFO L231 Difference]: Finished difference. Result has 86 places, 70 transitions, 553 flow [2024-06-14 15:31:22,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=553, PETRI_PLACES=86, PETRI_TRANSITIONS=70} [2024-06-14 15:31:22,931 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 57 predicate places. [2024-06-14 15:31:22,931 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 70 transitions, 553 flow [2024-06-14 15:31:22,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:31:22,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:31:22,931 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:31:22,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-14 15:31:22,931 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:31:22,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:31:22,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1810699059, now seen corresponding path program 4 times [2024-06-14 15:31:22,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:31:22,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356707773] [2024-06-14 15:31:22,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:31:22,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:31:22,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:31:27,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:31:27,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:31:27,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356707773] [2024-06-14 15:31:27,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356707773] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:31:27,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:31:27,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:31:27,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302296711] [2024-06-14 15:31:27,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:31:27,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:31:27,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:31:27,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:31:27,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:31:27,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:31:27,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 70 transitions, 553 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:31:27,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:31:27,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:31:27,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:31:27,746 INFO L124 PetriNetUnfolderBase]: 208/379 cut-off events. [2024-06-14 15:31:27,746 INFO L125 PetriNetUnfolderBase]: For 4099/4099 co-relation queries the response was YES. [2024-06-14 15:31:27,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1904 conditions, 379 events. 208/379 cut-off events. For 4099/4099 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1403 event pairs, 29 based on Foata normal form. 2/380 useless extension candidates. Maximal degree in co-relation 1862. Up to 274 conditions per place. [2024-06-14 15:31:27,750 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 69 selfloop transitions, 25 changer transitions 0/96 dead transitions. [2024-06-14 15:31:27,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 96 transitions, 887 flow [2024-06-14 15:31:27,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:31:27,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:31:27,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 108 transitions. [2024-06-14 15:31:27,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-14 15:31:27,751 INFO L175 Difference]: Start difference. First operand has 86 places, 70 transitions, 553 flow. Second operand 8 states and 108 transitions. [2024-06-14 15:31:27,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 96 transitions, 887 flow [2024-06-14 15:31:27,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 96 transitions, 846 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-14 15:31:27,758 INFO L231 Difference]: Finished difference. Result has 87 places, 74 transitions, 619 flow [2024-06-14 15:31:27,758 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=619, PETRI_PLACES=87, PETRI_TRANSITIONS=74} [2024-06-14 15:31:27,759 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 58 predicate places. [2024-06-14 15:31:27,759 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 74 transitions, 619 flow [2024-06-14 15:31:27,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:31:27,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:31:27,759 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:31:27,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-14 15:31:27,759 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:31:27,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:31:27,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1819053129, now seen corresponding path program 5 times [2024-06-14 15:31:27,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:31:27,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936064875] [2024-06-14 15:31:27,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:31:27,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:31:27,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:31:32,685 INFO L134 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:31:32,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:31:32,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936064875] [2024-06-14 15:31:32,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936064875] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:31:32,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:31:32,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:31:32,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494169078] [2024-06-14 15:31:32,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:31:32,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:31:32,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:31:32,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:31:32,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:31:32,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:31:32,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 74 transitions, 619 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:31:32,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:31:32,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:31:32,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:31:33,055 INFO L124 PetriNetUnfolderBase]: 220/399 cut-off events. [2024-06-14 15:31:33,055 INFO L125 PetriNetUnfolderBase]: For 4609/4609 co-relation queries the response was YES. [2024-06-14 15:31:33,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2068 conditions, 399 events. 220/399 cut-off events. For 4609/4609 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1520 event pairs, 29 based on Foata normal form. 2/400 useless extension candidates. Maximal degree in co-relation 2025. Up to 311 conditions per place. [2024-06-14 15:31:33,058 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 69 selfloop transitions, 21 changer transitions 0/92 dead transitions. [2024-06-14 15:31:33,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 92 transitions, 885 flow [2024-06-14 15:31:33,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:31:33,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:31:33,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2024-06-14 15:31:33,059 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-14 15:31:33,060 INFO L175 Difference]: Start difference. First operand has 87 places, 74 transitions, 619 flow. Second operand 8 states and 96 transitions. [2024-06-14 15:31:33,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 92 transitions, 885 flow [2024-06-14 15:31:33,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 92 transitions, 840 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-14 15:31:33,067 INFO L231 Difference]: Finished difference. Result has 91 places, 78 transitions, 673 flow [2024-06-14 15:31:33,067 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=673, PETRI_PLACES=91, PETRI_TRANSITIONS=78} [2024-06-14 15:31:33,068 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 62 predicate places. [2024-06-14 15:31:33,068 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 78 transitions, 673 flow [2024-06-14 15:31:33,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:31:33,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:31:33,068 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:31:33,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-14 15:31:33,069 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:31:33,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:31:33,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1819060073, now seen corresponding path program 1 times [2024-06-14 15:31:33,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:31:33,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042471098] [2024-06-14 15:31:33,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:31:33,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:31:33,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:31:38,033 INFO L134 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:31:38,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:31:38,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042471098] [2024-06-14 15:31:38,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042471098] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:31:38,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:31:38,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:31:38,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186098654] [2024-06-14 15:31:38,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:31:38,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:31:38,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:31:38,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:31:38,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:31:38,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:31:38,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 78 transitions, 673 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:31:38,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:31:38,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:31:38,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:31:38,407 INFO L124 PetriNetUnfolderBase]: 228/415 cut-off events. [2024-06-14 15:31:38,407 INFO L125 PetriNetUnfolderBase]: For 5493/5493 co-relation queries the response was YES. [2024-06-14 15:31:38,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2167 conditions, 415 events. 228/415 cut-off events. For 5493/5493 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1610 event pairs, 30 based on Foata normal form. 4/418 useless extension candidates. Maximal degree in co-relation 2122. Up to 323 conditions per place. [2024-06-14 15:31:38,410 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 71 selfloop transitions, 21 changer transitions 0/94 dead transitions. [2024-06-14 15:31:38,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 94 transitions, 907 flow [2024-06-14 15:31:38,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:31:38,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:31:38,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2024-06-14 15:31:38,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4083333333333333 [2024-06-14 15:31:38,412 INFO L175 Difference]: Start difference. First operand has 91 places, 78 transitions, 673 flow. Second operand 8 states and 98 transitions. [2024-06-14 15:31:38,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 94 transitions, 907 flow [2024-06-14 15:31:38,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 94 transitions, 845 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-14 15:31:38,420 INFO L231 Difference]: Finished difference. Result has 93 places, 80 transitions, 676 flow [2024-06-14 15:31:38,420 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=676, PETRI_PLACES=93, PETRI_TRANSITIONS=80} [2024-06-14 15:31:38,420 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 64 predicate places. [2024-06-14 15:31:38,421 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 80 transitions, 676 flow [2024-06-14 15:31:38,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:31:38,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:31:38,421 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:31:38,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-14 15:31:38,421 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:31:38,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:31:38,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1818880149, now seen corresponding path program 6 times [2024-06-14 15:31:38,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:31:38,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071691123] [2024-06-14 15:31:38,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:31:38,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:31:38,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:31:43,055 INFO L134 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:31:43,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:31:43,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071691123] [2024-06-14 15:31:43,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071691123] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:31:43,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:31:43,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:31:43,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975796694] [2024-06-14 15:31:43,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:31:43,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:31:43,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:31:43,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:31:43,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:31:43,156 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:31:43,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 80 transitions, 676 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:31:43,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:31:43,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:31:43,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:31:43,464 INFO L124 PetriNetUnfolderBase]: 224/409 cut-off events. [2024-06-14 15:31:43,465 INFO L125 PetriNetUnfolderBase]: For 4887/4887 co-relation queries the response was YES. [2024-06-14 15:31:43,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2082 conditions, 409 events. 224/409 cut-off events. For 4887/4887 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1594 event pairs, 29 based on Foata normal form. 2/410 useless extension candidates. Maximal degree in co-relation 2038. Up to 321 conditions per place. [2024-06-14 15:31:43,468 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 73 selfloop transitions, 23 changer transitions 0/98 dead transitions. [2024-06-14 15:31:43,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 98 transitions, 918 flow [2024-06-14 15:31:43,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:31:43,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:31:43,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2024-06-14 15:31:43,469 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425 [2024-06-14 15:31:43,469 INFO L175 Difference]: Start difference. First operand has 93 places, 80 transitions, 676 flow. Second operand 8 states and 102 transitions. [2024-06-14 15:31:43,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 98 transitions, 918 flow [2024-06-14 15:31:43,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 98 transitions, 857 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-14 15:31:43,480 INFO L231 Difference]: Finished difference. Result has 95 places, 80 transitions, 666 flow [2024-06-14 15:31:43,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=666, PETRI_PLACES=95, PETRI_TRANSITIONS=80} [2024-06-14 15:31:43,481 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 66 predicate places. [2024-06-14 15:31:43,481 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 80 transitions, 666 flow [2024-06-14 15:31:43,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:31:43,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:31:43,481 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:31:43,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-14 15:31:43,482 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:31:43,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:31:43,482 INFO L85 PathProgramCache]: Analyzing trace with hash 2082601061, now seen corresponding path program 2 times [2024-06-14 15:31:43,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:31:43,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331578646] [2024-06-14 15:31:43,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:31:43,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:31:43,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:31:47,981 INFO L134 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:31:47,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:31:47,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331578646] [2024-06-14 15:31:47,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331578646] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:31:47,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:31:47,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:31:47,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37919765] [2024-06-14 15:31:47,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:31:47,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:31:47,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:31:47,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:31:47,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:31:48,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:31:48,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 80 transitions, 666 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:31:48,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:31:48,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:31:48,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:31:48,356 INFO L124 PetriNetUnfolderBase]: 228/417 cut-off events. [2024-06-14 15:31:48,357 INFO L125 PetriNetUnfolderBase]: For 5269/5269 co-relation queries the response was YES. [2024-06-14 15:31:48,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2110 conditions, 417 events. 228/417 cut-off events. For 5269/5269 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1638 event pairs, 34 based on Foata normal form. 2/418 useless extension candidates. Maximal degree in co-relation 2065. Up to 382 conditions per place. [2024-06-14 15:31:48,360 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 75 selfloop transitions, 14 changer transitions 0/91 dead transitions. [2024-06-14 15:31:48,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 91 transitions, 878 flow [2024-06-14 15:31:48,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:31:48,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:31:48,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2024-06-14 15:31:48,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2024-06-14 15:31:48,362 INFO L175 Difference]: Start difference. First operand has 95 places, 80 transitions, 666 flow. Second operand 8 states and 88 transitions. [2024-06-14 15:31:48,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 91 transitions, 878 flow [2024-06-14 15:31:48,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 91 transitions, 809 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-14 15:31:48,370 INFO L231 Difference]: Finished difference. Result has 96 places, 81 transitions, 642 flow [2024-06-14 15:31:48,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=597, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=642, PETRI_PLACES=96, PETRI_TRANSITIONS=81} [2024-06-14 15:31:48,370 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 67 predicate places. [2024-06-14 15:31:48,371 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 81 transitions, 642 flow [2024-06-14 15:31:48,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:31:48,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:31:48,371 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:31:48,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-14 15:31:48,371 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:31:48,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:31:48,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1109997413, now seen corresponding path program 3 times [2024-06-14 15:31:48,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:31:48,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954499003] [2024-06-14 15:31:48,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:31:48,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:31:48,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:31:52,873 INFO L134 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:31:52,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:31:52,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954499003] [2024-06-14 15:31:52,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954499003] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:31:52,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:31:52,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:31:52,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287057517] [2024-06-14 15:31:52,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:31:52,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:31:52,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:31:52,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:31:52,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:31:52,961 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:31:52,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 81 transitions, 642 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:31:52,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:31:52,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:31:52,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:31:53,198 INFO L124 PetriNetUnfolderBase]: 232/425 cut-off events. [2024-06-14 15:31:53,198 INFO L125 PetriNetUnfolderBase]: For 5685/5685 co-relation queries the response was YES. [2024-06-14 15:31:53,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2097 conditions, 425 events. 232/425 cut-off events. For 5685/5685 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1674 event pairs, 33 based on Foata normal form. 2/426 useless extension candidates. Maximal degree in co-relation 2051. Up to 398 conditions per place. [2024-06-14 15:31:53,201 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 79 selfloop transitions, 11 changer transitions 0/92 dead transitions. [2024-06-14 15:31:53,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 92 transitions, 858 flow [2024-06-14 15:31:53,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:31:53,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:31:53,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2024-06-14 15:31:53,202 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3625 [2024-06-14 15:31:53,202 INFO L175 Difference]: Start difference. First operand has 96 places, 81 transitions, 642 flow. Second operand 8 states and 87 transitions. [2024-06-14 15:31:53,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 92 transitions, 858 flow [2024-06-14 15:31:53,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 92 transitions, 825 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-14 15:31:53,212 INFO L231 Difference]: Finished difference. Result has 98 places, 82 transitions, 649 flow [2024-06-14 15:31:53,212 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=649, PETRI_PLACES=98, PETRI_TRANSITIONS=82} [2024-06-14 15:31:53,212 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 69 predicate places. [2024-06-14 15:31:53,213 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 82 transitions, 649 flow [2024-06-14 15:31:53,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:31:53,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:31:53,213 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:31:53,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-14 15:31:53,213 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:31:53,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:31:53,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1346469443, now seen corresponding path program 4 times [2024-06-14 15:31:53,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:31:53,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203550867] [2024-06-14 15:31:53,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:31:53,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:31:53,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:31:57,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:31:57,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:31:57,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203550867] [2024-06-14 15:31:57,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203550867] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:31:57,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:31:57,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:31:57,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128372120] [2024-06-14 15:31:57,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:31:57,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:31:57,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:31:57,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:31:57,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:31:57,936 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:31:57,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 82 transitions, 649 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:31:57,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:31:57,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:31:57,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:31:58,165 INFO L124 PetriNetUnfolderBase]: 229/420 cut-off events. [2024-06-14 15:31:58,166 INFO L125 PetriNetUnfolderBase]: For 5485/5485 co-relation queries the response was YES. [2024-06-14 15:31:58,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2034 conditions, 420 events. 229/420 cut-off events. For 5485/5485 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1641 event pairs, 35 based on Foata normal form. 2/421 useless extension candidates. Maximal degree in co-relation 1987. Up to 388 conditions per place. [2024-06-14 15:31:58,168 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 79 selfloop transitions, 11 changer transitions 0/92 dead transitions. [2024-06-14 15:31:58,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 92 transitions, 851 flow [2024-06-14 15:31:58,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:31:58,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:31:58,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 86 transitions. [2024-06-14 15:31:58,170 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35833333333333334 [2024-06-14 15:31:58,170 INFO L175 Difference]: Start difference. First operand has 98 places, 82 transitions, 649 flow. Second operand 8 states and 86 transitions. [2024-06-14 15:31:58,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 92 transitions, 851 flow [2024-06-14 15:31:58,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 92 transitions, 796 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-14 15:31:58,180 INFO L231 Difference]: Finished difference. Result has 98 places, 82 transitions, 620 flow [2024-06-14 15:31:58,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=620, PETRI_PLACES=98, PETRI_TRANSITIONS=82} [2024-06-14 15:31:58,180 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 69 predicate places. [2024-06-14 15:31:58,180 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 82 transitions, 620 flow [2024-06-14 15:31:58,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:31:58,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:31:58,181 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:31:58,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-14 15:31:58,181 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:31:58,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:31:58,181 INFO L85 PathProgramCache]: Analyzing trace with hash 250008119, now seen corresponding path program 7 times [2024-06-14 15:31:58,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:31:58,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317727345] [2024-06-14 15:31:58,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:31:58,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:31:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:32:02,454 INFO L134 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:32:02,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:32:02,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317727345] [2024-06-14 15:32:02,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317727345] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:32:02,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:32:02,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:32:02,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378171336] [2024-06-14 15:32:02,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:32:02,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:32:02,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:32:02,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:32:02,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:32:02,606 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:32:02,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 82 transitions, 620 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:32:02,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:32:02,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:32:02,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:32:02,886 INFO L124 PetriNetUnfolderBase]: 225/414 cut-off events. [2024-06-14 15:32:02,886 INFO L125 PetriNetUnfolderBase]: For 5141/5141 co-relation queries the response was YES. [2024-06-14 15:32:02,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1928 conditions, 414 events. 225/414 cut-off events. For 5141/5141 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1619 event pairs, 35 based on Foata normal form. 2/415 useless extension candidates. Maximal degree in co-relation 1880. Up to 325 conditions per place. [2024-06-14 15:32:02,889 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 72 selfloop transitions, 27 changer transitions 0/101 dead transitions. [2024-06-14 15:32:02,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 101 transitions, 870 flow [2024-06-14 15:32:02,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:32:02,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:32:02,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2024-06-14 15:32:02,890 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4714285714285714 [2024-06-14 15:32:02,890 INFO L175 Difference]: Start difference. First operand has 98 places, 82 transitions, 620 flow. Second operand 7 states and 99 transitions. [2024-06-14 15:32:02,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 101 transitions, 870 flow [2024-06-14 15:32:02,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 101 transitions, 816 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-14 15:32:02,899 INFO L231 Difference]: Finished difference. Result has 98 places, 82 transitions, 629 flow [2024-06-14 15:32:02,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=629, PETRI_PLACES=98, PETRI_TRANSITIONS=82} [2024-06-14 15:32:02,899 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 69 predicate places. [2024-06-14 15:32:02,900 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 82 transitions, 629 flow [2024-06-14 15:32:02,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:32:02,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:32:02,900 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:32:02,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-14 15:32:02,900 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:32:02,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:32:02,901 INFO L85 PathProgramCache]: Analyzing trace with hash 335276361, now seen corresponding path program 1 times [2024-06-14 15:32:02,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:32:02,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199443620] [2024-06-14 15:32:02,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:32:02,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:32:02,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:32:07,313 INFO L134 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:32:07,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:32:07,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199443620] [2024-06-14 15:32:07,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199443620] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:32:07,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:32:07,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:32:07,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933565727] [2024-06-14 15:32:07,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:32:07,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:32:07,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:32:07,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:32:07,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:32:07,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:32:07,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 82 transitions, 629 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:07,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:32:07,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:32:07,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:32:07,784 INFO L124 PetriNetUnfolderBase]: 252/475 cut-off events. [2024-06-14 15:32:07,784 INFO L125 PetriNetUnfolderBase]: For 9769/9769 co-relation queries the response was YES. [2024-06-14 15:32:07,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2259 conditions, 475 events. 252/475 cut-off events. For 9769/9769 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1966 event pairs, 42 based on Foata normal form. 8/482 useless extension candidates. Maximal degree in co-relation 2211. Up to 149 conditions per place. [2024-06-14 15:32:07,787 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 57 selfloop transitions, 37 changer transitions 12/108 dead transitions. [2024-06-14 15:32:07,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 108 transitions, 971 flow [2024-06-14 15:32:07,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:32:07,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:32:07,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions. [2024-06-14 15:32:07,788 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42592592592592593 [2024-06-14 15:32:07,788 INFO L175 Difference]: Start difference. First operand has 98 places, 82 transitions, 629 flow. Second operand 9 states and 115 transitions. [2024-06-14 15:32:07,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 108 transitions, 971 flow [2024-06-14 15:32:07,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 108 transitions, 890 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-14 15:32:07,799 INFO L231 Difference]: Finished difference. Result has 101 places, 80 transitions, 614 flow [2024-06-14 15:32:07,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=614, PETRI_PLACES=101, PETRI_TRANSITIONS=80} [2024-06-14 15:32:07,800 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 72 predicate places. [2024-06-14 15:32:07,801 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 80 transitions, 614 flow [2024-06-14 15:32:07,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:07,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:32:07,801 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:32:07,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-14 15:32:07,801 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:32:07,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:32:07,802 INFO L85 PathProgramCache]: Analyzing trace with hash 337150311, now seen corresponding path program 2 times [2024-06-14 15:32:07,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:32:07,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943329503] [2024-06-14 15:32:07,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:32:07,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:32:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:32:13,207 INFO L134 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:32:13,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:32:13,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943329503] [2024-06-14 15:32:13,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943329503] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:32:13,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:32:13,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:32:13,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077933360] [2024-06-14 15:32:13,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:32:13,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:32:13,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:32:13,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:32:13,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:32:13,321 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:32:13,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 80 transitions, 614 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:13,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:32:13,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:32:13,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:32:13,655 INFO L124 PetriNetUnfolderBase]: 261/490 cut-off events. [2024-06-14 15:32:13,655 INFO L125 PetriNetUnfolderBase]: For 11446/11446 co-relation queries the response was YES. [2024-06-14 15:32:13,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2505 conditions, 490 events. 261/490 cut-off events. For 11446/11446 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2066 event pairs, 35 based on Foata normal form. 4/493 useless extension candidates. Maximal degree in co-relation 2456. Up to 262 conditions per place. [2024-06-14 15:32:13,659 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 60 selfloop transitions, 42 changer transitions 3/107 dead transitions. [2024-06-14 15:32:13,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 107 transitions, 970 flow [2024-06-14 15:32:13,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:32:13,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:32:13,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-14 15:32:13,662 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43703703703703706 [2024-06-14 15:32:13,662 INFO L175 Difference]: Start difference. First operand has 101 places, 80 transitions, 614 flow. Second operand 9 states and 118 transitions. [2024-06-14 15:32:13,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 107 transitions, 970 flow [2024-06-14 15:32:13,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 107 transitions, 905 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-14 15:32:13,699 INFO L231 Difference]: Finished difference. Result has 101 places, 83 transitions, 677 flow [2024-06-14 15:32:13,699 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=677, PETRI_PLACES=101, PETRI_TRANSITIONS=83} [2024-06-14 15:32:13,700 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 72 predicate places. [2024-06-14 15:32:13,700 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 83 transitions, 677 flow [2024-06-14 15:32:13,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:13,700 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:32:13,700 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:32:13,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-14 15:32:13,701 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:32:13,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:32:13,701 INFO L85 PathProgramCache]: Analyzing trace with hash 337154031, now seen corresponding path program 3 times [2024-06-14 15:32:13,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:32:13,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943481862] [2024-06-14 15:32:13,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:32:13,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:32:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:32:18,031 INFO L134 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:32:18,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:32:18,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943481862] [2024-06-14 15:32:18,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943481862] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:32:18,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:32:18,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:32:18,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165279103] [2024-06-14 15:32:18,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:32:18,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:32:18,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:32:18,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:32:18,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:32:18,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:32:18,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 83 transitions, 677 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:18,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:32:18,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:32:18,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:32:18,440 INFO L124 PetriNetUnfolderBase]: 256/487 cut-off events. [2024-06-14 15:32:18,440 INFO L125 PetriNetUnfolderBase]: For 10610/10610 co-relation queries the response was YES. [2024-06-14 15:32:18,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2404 conditions, 487 events. 256/487 cut-off events. For 10610/10610 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2074 event pairs, 42 based on Foata normal form. 10/496 useless extension candidates. Maximal degree in co-relation 2355. Up to 272 conditions per place. [2024-06-14 15:32:18,443 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 52 selfloop transitions, 36 changer transitions 14/104 dead transitions. [2024-06-14 15:32:18,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 104 transitions, 937 flow [2024-06-14 15:32:18,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:32:18,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:32:18,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-14 15:32:18,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2024-06-14 15:32:18,446 INFO L175 Difference]: Start difference. First operand has 101 places, 83 transitions, 677 flow. Second operand 9 states and 114 transitions. [2024-06-14 15:32:18,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 104 transitions, 937 flow [2024-06-14 15:32:18,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 104 transitions, 867 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-14 15:32:18,457 INFO L231 Difference]: Finished difference. Result has 105 places, 78 transitions, 648 flow [2024-06-14 15:32:18,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=648, PETRI_PLACES=105, PETRI_TRANSITIONS=78} [2024-06-14 15:32:18,458 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 76 predicate places. [2024-06-14 15:32:18,458 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 78 transitions, 648 flow [2024-06-14 15:32:18,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:18,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:32:18,458 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:32:18,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-14 15:32:18,459 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:32:18,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:32:18,459 INFO L85 PathProgramCache]: Analyzing trace with hash -435479185, now seen corresponding path program 4 times [2024-06-14 15:32:18,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:32:18,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172973518] [2024-06-14 15:32:18,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:32:18,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:32:18,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:32:23,252 INFO L134 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:32:23,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:32:23,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172973518] [2024-06-14 15:32:23,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172973518] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:32:23,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:32:23,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:32:23,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475504275] [2024-06-14 15:32:23,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:32:23,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:32:23,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:32:23,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:32:23,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:32:23,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:32:23,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 78 transitions, 648 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:23,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:32:23,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:32:23,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:32:23,674 INFO L124 PetriNetUnfolderBase]: 248/475 cut-off events. [2024-06-14 15:32:23,674 INFO L125 PetriNetUnfolderBase]: For 11403/11403 co-relation queries the response was YES. [2024-06-14 15:32:23,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2409 conditions, 475 events. 248/475 cut-off events. For 11403/11403 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2013 event pairs, 42 based on Foata normal form. 10/484 useless extension candidates. Maximal degree in co-relation 2358. Up to 345 conditions per place. [2024-06-14 15:32:23,676 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 67 selfloop transitions, 18 changer transitions 11/98 dead transitions. [2024-06-14 15:32:23,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 98 transitions, 908 flow [2024-06-14 15:32:23,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:32:23,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:32:23,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2024-06-14 15:32:23,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4074074074074074 [2024-06-14 15:32:23,693 INFO L175 Difference]: Start difference. First operand has 105 places, 78 transitions, 648 flow. Second operand 9 states and 110 transitions. [2024-06-14 15:32:23,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 98 transitions, 908 flow [2024-06-14 15:32:23,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 98 transitions, 824 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-14 15:32:23,705 INFO L231 Difference]: Finished difference. Result has 101 places, 75 transitions, 582 flow [2024-06-14 15:32:23,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=582, PETRI_PLACES=101, PETRI_TRANSITIONS=75} [2024-06-14 15:32:23,705 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 72 predicate places. [2024-06-14 15:32:23,706 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 75 transitions, 582 flow [2024-06-14 15:32:23,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:23,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:32:23,706 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:32:23,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-14 15:32:23,706 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:32:23,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:32:23,707 INFO L85 PathProgramCache]: Analyzing trace with hash 423842121, now seen corresponding path program 5 times [2024-06-14 15:32:23,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:32:23,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255331468] [2024-06-14 15:32:23,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:32:23,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:32:23,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:32:28,041 INFO L134 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:32:28,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:32:28,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255331468] [2024-06-14 15:32:28,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255331468] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:32:28,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:32:28,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:32:28,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852279391] [2024-06-14 15:32:28,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:32:28,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:32:28,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:32:28,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:32:28,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:32:28,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:32:28,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 75 transitions, 582 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:28,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:32:28,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:32:28,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:32:28,495 INFO L124 PetriNetUnfolderBase]: 263/512 cut-off events. [2024-06-14 15:32:28,495 INFO L125 PetriNetUnfolderBase]: For 13442/13442 co-relation queries the response was YES. [2024-06-14 15:32:28,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2656 conditions, 512 events. 263/512 cut-off events. For 13442/13442 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2243 event pairs, 53 based on Foata normal form. 8/519 useless extension candidates. Maximal degree in co-relation 2607. Up to 295 conditions per place. [2024-06-14 15:32:28,498 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 66 selfloop transitions, 25 changer transitions 7/100 dead transitions. [2024-06-14 15:32:28,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 100 transitions, 920 flow [2024-06-14 15:32:28,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:32:28,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:32:28,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-14 15:32:28,499 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2024-06-14 15:32:28,499 INFO L175 Difference]: Start difference. First operand has 101 places, 75 transitions, 582 flow. Second operand 9 states and 117 transitions. [2024-06-14 15:32:28,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 100 transitions, 920 flow [2024-06-14 15:32:28,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 100 transitions, 876 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-14 15:32:28,511 INFO L231 Difference]: Finished difference. Result has 99 places, 73 transitions, 580 flow [2024-06-14 15:32:28,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=580, PETRI_PLACES=99, PETRI_TRANSITIONS=73} [2024-06-14 15:32:28,511 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 70 predicate places. [2024-06-14 15:32:28,511 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 73 transitions, 580 flow [2024-06-14 15:32:28,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:28,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:32:28,511 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:32:28,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-14 15:32:28,511 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:32:28,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:32:28,512 INFO L85 PathProgramCache]: Analyzing trace with hash -435623335, now seen corresponding path program 6 times [2024-06-14 15:32:28,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:32:28,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690287840] [2024-06-14 15:32:28,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:32:28,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:32:28,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:32:32,946 INFO L134 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:32:32,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:32:32,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690287840] [2024-06-14 15:32:32,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690287840] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:32:32,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:32:32,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:32:32,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175944486] [2024-06-14 15:32:32,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:32:32,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:32:32,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:32:32,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:32:32,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:32:33,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:32:33,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 73 transitions, 580 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:33,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:32:33,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:32:33,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:32:33,377 INFO L124 PetriNetUnfolderBase]: 232/451 cut-off events. [2024-06-14 15:32:33,377 INFO L125 PetriNetUnfolderBase]: For 9821/9821 co-relation queries the response was YES. [2024-06-14 15:32:33,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2205 conditions, 451 events. 232/451 cut-off events. For 9821/9821 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1893 event pairs, 46 based on Foata normal form. 10/460 useless extension candidates. Maximal degree in co-relation 2157. Up to 320 conditions per place. [2024-06-14 15:32:33,380 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 62 selfloop transitions, 16 changer transitions 13/93 dead transitions. [2024-06-14 15:32:33,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 93 transitions, 828 flow [2024-06-14 15:32:33,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:32:33,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:32:33,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-14 15:32:33,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40370370370370373 [2024-06-14 15:32:33,381 INFO L175 Difference]: Start difference. First operand has 99 places, 73 transitions, 580 flow. Second operand 9 states and 109 transitions. [2024-06-14 15:32:33,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 93 transitions, 828 flow [2024-06-14 15:32:33,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 93 transitions, 776 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-14 15:32:33,392 INFO L231 Difference]: Finished difference. Result has 98 places, 69 transitions, 531 flow [2024-06-14 15:32:33,392 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=531, PETRI_PLACES=98, PETRI_TRANSITIONS=69} [2024-06-14 15:32:33,392 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 69 predicate places. [2024-06-14 15:32:33,392 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 69 transitions, 531 flow [2024-06-14 15:32:33,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:33,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:32:33,392 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:32:33,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-14 15:32:33,393 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:32:33,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:32:33,393 INFO L85 PathProgramCache]: Analyzing trace with hash -297098905, now seen corresponding path program 7 times [2024-06-14 15:32:33,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:32:33,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193719604] [2024-06-14 15:32:33,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:32:33,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:32:33,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:32:37,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:32:37,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:32:37,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193719604] [2024-06-14 15:32:37,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193719604] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:32:37,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:32:37,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:32:37,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744474240] [2024-06-14 15:32:37,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:32:37,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:32:37,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:32:37,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:32:37,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:32:38,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:32:38,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 69 transitions, 531 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:38,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:32:38,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:32:38,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:32:38,464 INFO L124 PetriNetUnfolderBase]: 227/448 cut-off events. [2024-06-14 15:32:38,464 INFO L125 PetriNetUnfolderBase]: For 9637/9637 co-relation queries the response was YES. [2024-06-14 15:32:38,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2210 conditions, 448 events. 227/448 cut-off events. For 9637/9637 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1887 event pairs, 44 based on Foata normal form. 8/455 useless extension candidates. Maximal degree in co-relation 2163. Up to 162 conditions per place. [2024-06-14 15:32:38,466 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 52 selfloop transitions, 35 changer transitions 10/99 dead transitions. [2024-06-14 15:32:38,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 99 transitions, 867 flow [2024-06-14 15:32:38,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:32:38,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:32:38,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 122 transitions. [2024-06-14 15:32:38,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45185185185185184 [2024-06-14 15:32:38,468 INFO L175 Difference]: Start difference. First operand has 98 places, 69 transitions, 531 flow. Second operand 9 states and 122 transitions. [2024-06-14 15:32:38,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 99 transitions, 867 flow [2024-06-14 15:32:38,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 99 transitions, 823 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-14 15:32:38,477 INFO L231 Difference]: Finished difference. Result has 93 places, 67 transitions, 548 flow [2024-06-14 15:32:38,477 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=548, PETRI_PLACES=93, PETRI_TRANSITIONS=67} [2024-06-14 15:32:38,477 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 64 predicate places. [2024-06-14 15:32:38,477 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 67 transitions, 548 flow [2024-06-14 15:32:38,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:38,478 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:32:38,478 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:32:38,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-14 15:32:38,478 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:32:38,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:32:38,478 INFO L85 PathProgramCache]: Analyzing trace with hash -297095185, now seen corresponding path program 8 times [2024-06-14 15:32:38,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:32:38,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650348456] [2024-06-14 15:32:38,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:32:38,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:32:38,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:32:42,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:32:42,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:32:42,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650348456] [2024-06-14 15:32:42,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650348456] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:32:42,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:32:42,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:32:42,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745822910] [2024-06-14 15:32:42,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:32:42,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:32:42,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:32:42,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:32:42,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:32:43,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:32:43,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 67 transitions, 548 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:43,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:32:43,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:32:43,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:32:43,444 INFO L124 PetriNetUnfolderBase]: 217/428 cut-off events. [2024-06-14 15:32:43,444 INFO L125 PetriNetUnfolderBase]: For 8833/8833 co-relation queries the response was YES. [2024-06-14 15:32:43,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2123 conditions, 428 events. 217/428 cut-off events. For 8833/8833 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1807 event pairs, 54 based on Foata normal form. 10/437 useless extension candidates. Maximal degree in co-relation 2078. Up to 272 conditions per place. [2024-06-14 15:32:43,446 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 55 selfloop transitions, 23 changer transitions 11/91 dead transitions. [2024-06-14 15:32:43,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 91 transitions, 804 flow [2024-06-14 15:32:43,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:32:43,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:32:43,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-14 15:32:43,447 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2024-06-14 15:32:43,447 INFO L175 Difference]: Start difference. First operand has 93 places, 67 transitions, 548 flow. Second operand 9 states and 114 transitions. [2024-06-14 15:32:43,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 91 transitions, 804 flow [2024-06-14 15:32:43,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 91 transitions, 738 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-14 15:32:43,455 INFO L231 Difference]: Finished difference. Result has 92 places, 64 transitions, 503 flow [2024-06-14 15:32:43,456 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=503, PETRI_PLACES=92, PETRI_TRANSITIONS=64} [2024-06-14 15:32:43,456 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 63 predicate places. [2024-06-14 15:32:43,456 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 64 transitions, 503 flow [2024-06-14 15:32:43,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:43,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:32:43,457 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:32:43,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-14 15:32:43,457 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:32:43,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:32:43,457 INFO L85 PathProgramCache]: Analyzing trace with hash 550710567, now seen corresponding path program 9 times [2024-06-14 15:32:43,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:32:43,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063126340] [2024-06-14 15:32:43,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:32:43,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:32:43,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:32:48,359 INFO L134 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:32:48,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:32:48,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063126340] [2024-06-14 15:32:48,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063126340] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:32:48,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:32:48,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:32:48,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931309606] [2024-06-14 15:32:48,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:32:48,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:32:48,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:32:48,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:32:48,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:32:48,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:32:48,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 64 transitions, 503 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:48,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:32:48,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:32:48,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:32:48,824 INFO L124 PetriNetUnfolderBase]: 209/416 cut-off events. [2024-06-14 15:32:48,824 INFO L125 PetriNetUnfolderBase]: For 8027/8027 co-relation queries the response was YES. [2024-06-14 15:32:48,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2022 conditions, 416 events. 209/416 cut-off events. For 8027/8027 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1734 event pairs, 46 based on Foata normal form. 10/425 useless extension candidates. Maximal degree in co-relation 1978. Up to 286 conditions per place. [2024-06-14 15:32:48,827 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 57 selfloop transitions, 18 changer transitions 11/88 dead transitions. [2024-06-14 15:32:48,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 88 transitions, 753 flow [2024-06-14 15:32:48,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:32:48,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:32:48,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-14 15:32:48,828 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4185185185185185 [2024-06-14 15:32:48,828 INFO L175 Difference]: Start difference. First operand has 92 places, 64 transitions, 503 flow. Second operand 9 states and 113 transitions. [2024-06-14 15:32:48,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 88 transitions, 753 flow [2024-06-14 15:32:48,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 88 transitions, 703 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-14 15:32:48,836 INFO L231 Difference]: Finished difference. Result has 90 places, 61 transitions, 466 flow [2024-06-14 15:32:48,836 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=466, PETRI_PLACES=90, PETRI_TRANSITIONS=61} [2024-06-14 15:32:48,836 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 61 predicate places. [2024-06-14 15:32:48,836 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 61 transitions, 466 flow [2024-06-14 15:32:48,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:48,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:32:48,837 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:32:48,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-14 15:32:48,837 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:32:48,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:32:48,837 INFO L85 PathProgramCache]: Analyzing trace with hash 550716519, now seen corresponding path program 1 times [2024-06-14 15:32:48,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:32:48,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752981199] [2024-06-14 15:32:48,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:32:48,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:32:48,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:32:53,625 INFO L134 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:32:53,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:32:53,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752981199] [2024-06-14 15:32:53,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752981199] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:32:53,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:32:53,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:32:53,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882454417] [2024-06-14 15:32:53,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:32:53,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:32:53,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:32:53,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:32:53,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:32:53,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:32:53,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 61 transitions, 466 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:53,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:32:53,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:32:53,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:32:54,073 INFO L124 PetriNetUnfolderBase]: 190/379 cut-off events. [2024-06-14 15:32:54,073 INFO L125 PetriNetUnfolderBase]: For 5564/5564 co-relation queries the response was YES. [2024-06-14 15:32:54,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1853 conditions, 379 events. 190/379 cut-off events. For 5564/5564 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1524 event pairs, 43 based on Foata normal form. 2/380 useless extension candidates. Maximal degree in co-relation 1810. Up to 276 conditions per place. [2024-06-14 15:32:54,075 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 56 selfloop transitions, 24 changer transitions 0/82 dead transitions. [2024-06-14 15:32:54,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 82 transitions, 698 flow [2024-06-14 15:32:54,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:32:54,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:32:54,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2024-06-14 15:32:54,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-14 15:32:54,077 INFO L175 Difference]: Start difference. First operand has 90 places, 61 transitions, 466 flow. Second operand 8 states and 100 transitions. [2024-06-14 15:32:54,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 82 transitions, 698 flow [2024-06-14 15:32:54,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 82 transitions, 658 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-14 15:32:54,083 INFO L231 Difference]: Finished difference. Result has 88 places, 64 transitions, 521 flow [2024-06-14 15:32:54,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=521, PETRI_PLACES=88, PETRI_TRANSITIONS=64} [2024-06-14 15:32:54,083 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 59 predicate places. [2024-06-14 15:32:54,083 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 64 transitions, 521 flow [2024-06-14 15:32:54,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:54,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:32:54,084 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:32:54,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-14 15:32:54,084 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:32:54,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:32:54,084 INFO L85 PathProgramCache]: Analyzing trace with hash 556280709, now seen corresponding path program 2 times [2024-06-14 15:32:54,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:32:54,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495777884] [2024-06-14 15:32:54,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:32:54,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:32:54,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:32:58,835 INFO L134 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:32:58,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:32:58,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495777884] [2024-06-14 15:32:58,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495777884] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:32:58,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:32:58,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:32:58,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958893974] [2024-06-14 15:32:58,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:32:58,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:32:58,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:32:58,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:32:58,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:32:58,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:32:58,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 64 transitions, 521 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:58,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:32:58,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:32:58,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:32:59,219 INFO L124 PetriNetUnfolderBase]: 194/387 cut-off events. [2024-06-14 15:32:59,220 INFO L125 PetriNetUnfolderBase]: For 5168/5168 co-relation queries the response was YES. [2024-06-14 15:32:59,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1918 conditions, 387 events. 194/387 cut-off events. For 5168/5168 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1585 event pairs, 48 based on Foata normal form. 2/388 useless extension candidates. Maximal degree in co-relation 1875. Up to 301 conditions per place. [2024-06-14 15:32:59,222 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 60 selfloop transitions, 17 changer transitions 0/79 dead transitions. [2024-06-14 15:32:59,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 79 transitions, 721 flow [2024-06-14 15:32:59,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:32:59,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:32:59,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2024-06-14 15:32:59,223 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39166666666666666 [2024-06-14 15:32:59,223 INFO L175 Difference]: Start difference. First operand has 88 places, 64 transitions, 521 flow. Second operand 8 states and 94 transitions. [2024-06-14 15:32:59,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 79 transitions, 721 flow [2024-06-14 15:32:59,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 79 transitions, 682 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-14 15:32:59,230 INFO L231 Difference]: Finished difference. Result has 91 places, 65 transitions, 532 flow [2024-06-14 15:32:59,230 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=532, PETRI_PLACES=91, PETRI_TRANSITIONS=65} [2024-06-14 15:32:59,231 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 62 predicate places. [2024-06-14 15:32:59,231 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 65 transitions, 532 flow [2024-06-14 15:32:59,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:59,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:32:59,231 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:32:59,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-14 15:32:59,231 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:32:59,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:32:59,231 INFO L85 PathProgramCache]: Analyzing trace with hash 556288149, now seen corresponding path program 3 times [2024-06-14 15:32:59,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:32:59,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237654166] [2024-06-14 15:32:59,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:32:59,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:32:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:33:03,892 INFO L134 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:33:03,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:33:03,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237654166] [2024-06-14 15:33:03,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237654166] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:33:03,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:33:03,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:33:03,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838087331] [2024-06-14 15:33:03,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:33:03,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:33:03,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:33:03,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:33:03,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:33:04,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:33:04,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 65 transitions, 532 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:04,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:33:04,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:33:04,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:33:04,238 INFO L124 PetriNetUnfolderBase]: 198/395 cut-off events. [2024-06-14 15:33:04,238 INFO L125 PetriNetUnfolderBase]: For 5714/5714 co-relation queries the response was YES. [2024-06-14 15:33:04,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1979 conditions, 395 events. 198/395 cut-off events. For 5714/5714 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1626 event pairs, 46 based on Foata normal form. 2/396 useless extension candidates. Maximal degree in co-relation 1935. Up to 273 conditions per place. [2024-06-14 15:33:04,240 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 58 selfloop transitions, 20 changer transitions 0/80 dead transitions. [2024-06-14 15:33:04,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 80 transitions, 734 flow [2024-06-14 15:33:04,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:33:04,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:33:04,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2024-06-14 15:33:04,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-14 15:33:04,242 INFO L175 Difference]: Start difference. First operand has 91 places, 65 transitions, 532 flow. Second operand 8 states and 95 transitions. [2024-06-14 15:33:04,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 80 transitions, 734 flow [2024-06-14 15:33:04,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 80 transitions, 694 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-14 15:33:04,249 INFO L231 Difference]: Finished difference. Result has 93 places, 66 transitions, 551 flow [2024-06-14 15:33:04,249 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=551, PETRI_PLACES=93, PETRI_TRANSITIONS=66} [2024-06-14 15:33:04,250 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 64 predicate places. [2024-06-14 15:33:04,250 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 66 transitions, 551 flow [2024-06-14 15:33:04,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:04,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:33:04,250 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:33:04,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-14 15:33:04,250 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:33:04,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:33:04,251 INFO L85 PathProgramCache]: Analyzing trace with hash 556072947, now seen corresponding path program 10 times [2024-06-14 15:33:04,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:33:04,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766781473] [2024-06-14 15:33:04,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:33:04,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:33:04,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:33:09,735 INFO L134 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:33:09,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:33:09,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766781473] [2024-06-14 15:33:09,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766781473] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:33:09,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:33:09,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:33:09,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189390853] [2024-06-14 15:33:09,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:33:09,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:33:09,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:33:09,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:33:09,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:33:09,832 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:33:09,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 66 transitions, 551 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:09,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:33:09,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:33:09,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:33:10,074 INFO L124 PetriNetUnfolderBase]: 222/451 cut-off events. [2024-06-14 15:33:10,074 INFO L125 PetriNetUnfolderBase]: For 9572/9572 co-relation queries the response was YES. [2024-06-14 15:33:10,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2162 conditions, 451 events. 222/451 cut-off events. For 9572/9572 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1987 event pairs, 58 based on Foata normal form. 16/466 useless extension candidates. Maximal degree in co-relation 2117. Up to 291 conditions per place. [2024-06-14 15:33:10,076 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 55 selfloop transitions, 12 changer transitions 17/86 dead transitions. [2024-06-14 15:33:10,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 86 transitions, 785 flow [2024-06-14 15:33:10,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:33:10,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:33:10,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2024-06-14 15:33:10,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-14 15:33:10,078 INFO L175 Difference]: Start difference. First operand has 93 places, 66 transitions, 551 flow. Second operand 9 states and 108 transitions. [2024-06-14 15:33:10,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 86 transitions, 785 flow [2024-06-14 15:33:10,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 86 transitions, 738 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-14 15:33:10,088 INFO L231 Difference]: Finished difference. Result has 96 places, 59 transitions, 471 flow [2024-06-14 15:33:10,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=471, PETRI_PLACES=96, PETRI_TRANSITIONS=59} [2024-06-14 15:33:10,088 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 67 predicate places. [2024-06-14 15:33:10,088 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 59 transitions, 471 flow [2024-06-14 15:33:10,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:10,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:33:10,089 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:33:10,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-14 15:33:10,089 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:33:10,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:33:10,090 INFO L85 PathProgramCache]: Analyzing trace with hash 401821465, now seen corresponding path program 4 times [2024-06-14 15:33:10,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:33:10,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583872472] [2024-06-14 15:33:10,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:33:10,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:33:10,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:33:14,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:33:14,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:33:14,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583872472] [2024-06-14 15:33:14,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583872472] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:33:14,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:33:14,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:33:14,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284092017] [2024-06-14 15:33:14,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:33:14,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:33:14,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:33:14,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:33:14,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:33:14,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:33:14,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 59 transitions, 471 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:14,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:33:14,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:33:14,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:33:14,659 INFO L124 PetriNetUnfolderBase]: 178/367 cut-off events. [2024-06-14 15:33:14,659 INFO L125 PetriNetUnfolderBase]: For 6635/6635 co-relation queries the response was YES. [2024-06-14 15:33:14,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1861 conditions, 367 events. 178/367 cut-off events. For 6635/6635 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1504 event pairs, 48 based on Foata normal form. 2/368 useless extension candidates. Maximal degree in co-relation 1815. Up to 327 conditions per place. [2024-06-14 15:33:14,661 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 58 selfloop transitions, 10 changer transitions 0/70 dead transitions. [2024-06-14 15:33:14,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 70 transitions, 643 flow [2024-06-14 15:33:14,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:33:14,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:33:14,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2024-06-14 15:33:14,662 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3761904761904762 [2024-06-14 15:33:14,662 INFO L175 Difference]: Start difference. First operand has 96 places, 59 transitions, 471 flow. Second operand 7 states and 79 transitions. [2024-06-14 15:33:14,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 70 transitions, 643 flow [2024-06-14 15:33:14,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 70 transitions, 609 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-14 15:33:14,670 INFO L231 Difference]: Finished difference. Result has 89 places, 60 transitions, 477 flow [2024-06-14 15:33:14,670 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=477, PETRI_PLACES=89, PETRI_TRANSITIONS=60} [2024-06-14 15:33:14,670 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 60 predicate places. [2024-06-14 15:33:14,671 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 60 transitions, 477 flow [2024-06-14 15:33:14,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:14,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:33:14,671 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:33:14,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-14 15:33:14,676 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:33:14,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:33:14,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1934464683, now seen corresponding path program 5 times [2024-06-14 15:33:14,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:33:14,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478892753] [2024-06-14 15:33:14,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:33:14,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:33:14,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:33:19,161 INFO L134 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:33:19,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:33:19,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478892753] [2024-06-14 15:33:19,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478892753] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:33:19,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:33:19,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:33:19,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446570342] [2024-06-14 15:33:19,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:33:19,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:33:19,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:33:19,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:33:19,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:33:19,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:33:19,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 60 transitions, 477 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:19,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:33:19,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:33:19,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:33:19,534 INFO L124 PetriNetUnfolderBase]: 182/375 cut-off events. [2024-06-14 15:33:19,534 INFO L125 PetriNetUnfolderBase]: For 5665/5665 co-relation queries the response was YES. [2024-06-14 15:33:19,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1848 conditions, 375 events. 182/375 cut-off events. For 5665/5665 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1566 event pairs, 46 based on Foata normal form. 2/376 useless extension candidates. Maximal degree in co-relation 1804. Up to 218 conditions per place. [2024-06-14 15:33:19,536 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 48 selfloop transitions, 25 changer transitions 0/75 dead transitions. [2024-06-14 15:33:19,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 75 transitions, 713 flow [2024-06-14 15:33:19,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:33:19,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:33:19,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2024-06-14 15:33:19,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4238095238095238 [2024-06-14 15:33:19,537 INFO L175 Difference]: Start difference. First operand has 89 places, 60 transitions, 477 flow. Second operand 7 states and 89 transitions. [2024-06-14 15:33:19,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 75 transitions, 713 flow [2024-06-14 15:33:19,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 75 transitions, 685 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-14 15:33:19,544 INFO L231 Difference]: Finished difference. Result has 91 places, 61 transitions, 520 flow [2024-06-14 15:33:19,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=520, PETRI_PLACES=91, PETRI_TRANSITIONS=61} [2024-06-14 15:33:19,545 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 62 predicate places. [2024-06-14 15:33:19,545 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 61 transitions, 520 flow [2024-06-14 15:33:19,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:19,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:33:19,545 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:33:19,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-14 15:33:19,545 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:33:19,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:33:19,545 INFO L85 PathProgramCache]: Analyzing trace with hash 392617255, now seen corresponding path program 6 times [2024-06-14 15:33:19,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:33:19,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245198663] [2024-06-14 15:33:19,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:33:19,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:33:19,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:33:24,389 INFO L134 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:33:24,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:33:24,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245198663] [2024-06-14 15:33:24,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245198663] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:33:24,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:33:24,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:33:24,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81832363] [2024-06-14 15:33:24,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:33:24,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:33:24,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:33:24,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:33:24,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:33:24,507 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:33:24,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 61 transitions, 520 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:24,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:33:24,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:33:24,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:33:24,754 INFO L124 PetriNetUnfolderBase]: 179/370 cut-off events. [2024-06-14 15:33:24,755 INFO L125 PetriNetUnfolderBase]: For 5776/5776 co-relation queries the response was YES. [2024-06-14 15:33:24,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1846 conditions, 370 events. 179/370 cut-off events. For 5776/5776 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1522 event pairs, 49 based on Foata normal form. 2/371 useless extension candidates. Maximal degree in co-relation 1801. Up to 262 conditions per place. [2024-06-14 15:33:24,757 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 50 selfloop transitions, 25 changer transitions 0/77 dead transitions. [2024-06-14 15:33:24,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 77 transitions, 712 flow [2024-06-14 15:33:24,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:33:24,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:33:24,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2024-06-14 15:33:24,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4380952380952381 [2024-06-14 15:33:24,758 INFO L175 Difference]: Start difference. First operand has 91 places, 61 transitions, 520 flow. Second operand 7 states and 92 transitions. [2024-06-14 15:33:24,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 77 transitions, 712 flow [2024-06-14 15:33:24,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 77 transitions, 662 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-14 15:33:24,767 INFO L231 Difference]: Finished difference. Result has 94 places, 61 transitions, 527 flow [2024-06-14 15:33:24,768 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=527, PETRI_PLACES=94, PETRI_TRANSITIONS=61} [2024-06-14 15:33:24,768 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 65 predicate places. [2024-06-14 15:33:24,768 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 61 transitions, 527 flow [2024-06-14 15:33:24,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:24,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:33:24,769 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:33:24,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-14 15:33:24,769 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:33:24,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:33:24,769 INFO L85 PathProgramCache]: Analyzing trace with hash 135908983, now seen corresponding path program 11 times [2024-06-14 15:33:24,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:33:24,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243957577] [2024-06-14 15:33:24,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:33:24,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:33:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:33:29,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:33:29,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:33:29,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243957577] [2024-06-14 15:33:29,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243957577] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:33:29,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:33:29,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:33:29,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321025554] [2024-06-14 15:33:29,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:33:29,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:33:29,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:33:29,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:33:29,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:33:29,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:33:29,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 61 transitions, 527 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:29,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:33:29,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:33:29,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:33:29,659 INFO L124 PetriNetUnfolderBase]: 166/347 cut-off events. [2024-06-14 15:33:29,659 INFO L125 PetriNetUnfolderBase]: For 5611/5611 co-relation queries the response was YES. [2024-06-14 15:33:29,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1568 conditions, 347 events. 166/347 cut-off events. For 5611/5611 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1428 event pairs, 40 based on Foata normal form. 10/356 useless extension candidates. Maximal degree in co-relation 1522. Up to 213 conditions per place. [2024-06-14 15:33:29,660 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 47 selfloop transitions, 22 changer transitions 11/82 dead transitions. [2024-06-14 15:33:29,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 82 transitions, 747 flow [2024-06-14 15:33:29,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:33:29,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:33:29,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2024-06-14 15:33:29,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-14 15:33:29,661 INFO L175 Difference]: Start difference. First operand has 94 places, 61 transitions, 527 flow. Second operand 8 states and 105 transitions. [2024-06-14 15:33:29,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 82 transitions, 747 flow [2024-06-14 15:33:29,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 82 transitions, 681 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-14 15:33:29,669 INFO L231 Difference]: Finished difference. Result has 96 places, 56 transitions, 453 flow [2024-06-14 15:33:29,670 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=453, PETRI_PLACES=96, PETRI_TRANSITIONS=56} [2024-06-14 15:33:29,670 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 67 predicate places. [2024-06-14 15:33:29,670 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 56 transitions, 453 flow [2024-06-14 15:33:29,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:29,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:33:29,670 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:33:29,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-14 15:33:29,671 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:33:29,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:33:29,671 INFO L85 PathProgramCache]: Analyzing trace with hash 258973110, now seen corresponding path program 1 times [2024-06-14 15:33:29,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:33:29,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708528326] [2024-06-14 15:33:29,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:33:29,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:33:29,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:33:35,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:33:35,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:33:35,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708528326] [2024-06-14 15:33:35,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708528326] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:33:35,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:33:35,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:33:35,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010066040] [2024-06-14 15:33:35,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:33:35,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:33:35,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:33:35,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:33:35,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:33:35,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:33:35,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 56 transitions, 453 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:35,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:33:35,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:33:35,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:33:35,434 INFO L124 PetriNetUnfolderBase]: 146/315 cut-off events. [2024-06-14 15:33:35,434 INFO L125 PetriNetUnfolderBase]: For 4122/4122 co-relation queries the response was YES. [2024-06-14 15:33:35,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1375 conditions, 315 events. 146/315 cut-off events. For 4122/4122 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1285 event pairs, 34 based on Foata normal form. 6/320 useless extension candidates. Maximal degree in co-relation 1328. Up to 211 conditions per place. [2024-06-14 15:33:35,436 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 53 selfloop transitions, 13 changer transitions 6/74 dead transitions. [2024-06-14 15:33:35,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 74 transitions, 645 flow [2024-06-14 15:33:35,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:33:35,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:33:35,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2024-06-14 15:33:35,437 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-06-14 15:33:35,437 INFO L175 Difference]: Start difference. First operand has 96 places, 56 transitions, 453 flow. Second operand 9 states and 105 transitions. [2024-06-14 15:33:35,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 74 transitions, 645 flow [2024-06-14 15:33:35,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 74 transitions, 569 flow, removed 3 selfloop flow, removed 12 redundant places. [2024-06-14 15:33:35,443 INFO L231 Difference]: Finished difference. Result has 91 places, 54 transitions, 392 flow [2024-06-14 15:33:35,443 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=392, PETRI_PLACES=91, PETRI_TRANSITIONS=54} [2024-06-14 15:33:35,443 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 62 predicate places. [2024-06-14 15:33:35,443 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 54 transitions, 392 flow [2024-06-14 15:33:35,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:35,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:33:35,444 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:33:35,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-14 15:33:35,444 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:33:35,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:33:35,444 INFO L85 PathProgramCache]: Analyzing trace with hash -442641686, now seen corresponding path program 2 times [2024-06-14 15:33:35,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:33:35,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798824386] [2024-06-14 15:33:35,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:33:35,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:33:35,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:33:41,041 INFO L134 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:33:41,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:33:41,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798824386] [2024-06-14 15:33:41,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798824386] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:33:41,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:33:41,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:33:41,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751644063] [2024-06-14 15:33:41,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:33:41,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:33:41,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:33:41,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:33:41,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:33:41,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:33:41,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 54 transitions, 392 flow. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 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:33:41,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:33:41,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:33:41,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:33:41,371 INFO L124 PetriNetUnfolderBase]: 133/284 cut-off events. [2024-06-14 15:33:41,371 INFO L125 PetriNetUnfolderBase]: For 2652/2652 co-relation queries the response was YES. [2024-06-14 15:33:41,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1189 conditions, 284 events. 133/284 cut-off events. For 2652/2652 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1097 event pairs, 32 based on Foata normal form. 2/285 useless extension candidates. Maximal degree in co-relation 1146. Up to 187 conditions per place. [2024-06-14 15:33:41,373 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 52 selfloop transitions, 17 changer transitions 0/71 dead transitions. [2024-06-14 15:33:41,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 71 transitions, 574 flow [2024-06-14 15:33:41,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:33:41,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:33:41,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2024-06-14 15:33:41,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37777777777777777 [2024-06-14 15:33:41,389 INFO L175 Difference]: Start difference. First operand has 91 places, 54 transitions, 392 flow. Second operand 9 states and 102 transitions. [2024-06-14 15:33:41,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 71 transitions, 574 flow [2024-06-14 15:33:41,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 71 transitions, 517 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-06-14 15:33:41,395 INFO L231 Difference]: Finished difference. Result has 89 places, 55 transitions, 381 flow [2024-06-14 15:33:41,395 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=381, PETRI_PLACES=89, PETRI_TRANSITIONS=55} [2024-06-14 15:33:41,396 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 60 predicate places. [2024-06-14 15:33:41,396 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 55 transitions, 381 flow [2024-06-14 15:33:41,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 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:33:41,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:33:41,396 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:33:41,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-14 15:33:41,397 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:33:41,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:33:41,397 INFO L85 PathProgramCache]: Analyzing trace with hash -107656330, now seen corresponding path program 3 times [2024-06-14 15:33:41,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:33:41,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918050018] [2024-06-14 15:33:41,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:33:41,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:33:41,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:33:46,785 INFO L134 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:33:46,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:33:46,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918050018] [2024-06-14 15:33:46,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918050018] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:33:46,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:33:46,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:33:46,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433594426] [2024-06-14 15:33:46,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:33:46,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:33:46,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:33:46,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:33:46,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:33:46,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:33:46,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 55 transitions, 381 flow. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 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:33:46,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:33:46,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:33:46,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:33:47,237 INFO L124 PetriNetUnfolderBase]: 141/304 cut-off events. [2024-06-14 15:33:47,238 INFO L125 PetriNetUnfolderBase]: For 3338/3338 co-relation queries the response was YES. [2024-06-14 15:33:47,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1221 conditions, 304 events. 141/304 cut-off events. For 3338/3338 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1206 event pairs, 36 based on Foata normal form. 6/309 useless extension candidates. Maximal degree in co-relation 1178. Up to 215 conditions per place. [2024-06-14 15:33:47,239 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 52 selfloop transitions, 9 changer transitions 13/76 dead transitions. [2024-06-14 15:33:47,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 76 transitions, 587 flow [2024-06-14 15:33:47,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:33:47,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:33:47,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-14 15:33:47,253 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3925925925925926 [2024-06-14 15:33:47,253 INFO L175 Difference]: Start difference. First operand has 89 places, 55 transitions, 381 flow. Second operand 9 states and 106 transitions. [2024-06-14 15:33:47,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 76 transitions, 587 flow [2024-06-14 15:33:47,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 76 transitions, 551 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-14 15:33:47,259 INFO L231 Difference]: Finished difference. Result has 91 places, 50 transitions, 329 flow [2024-06-14 15:33:47,259 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=329, PETRI_PLACES=91, PETRI_TRANSITIONS=50} [2024-06-14 15:33:47,259 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 62 predicate places. [2024-06-14 15:33:47,259 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 50 transitions, 329 flow [2024-06-14 15:33:47,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 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:33:47,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:33:47,260 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:33:47,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-14 15:33:47,260 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:33:47,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:33:47,261 INFO L85 PathProgramCache]: Analyzing trace with hash -428435708, now seen corresponding path program 4 times [2024-06-14 15:33:47,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:33:47,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218545628] [2024-06-14 15:33:47,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:33:47,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:33:47,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:33:52,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:33:52,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:33:52,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218545628] [2024-06-14 15:33:52,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218545628] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:33:52,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:33:52,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:33:52,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894800639] [2024-06-14 15:33:52,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:33:52,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:33:52,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:33:52,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:33:52,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:33:52,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:33:52,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 50 transitions, 329 flow. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 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:33:52,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:33:52,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:33:52,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:33:52,726 INFO L124 PetriNetUnfolderBase]: 129/280 cut-off events. [2024-06-14 15:33:52,726 INFO L125 PetriNetUnfolderBase]: For 3651/3651 co-relation queries the response was YES. [2024-06-14 15:33:52,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1111 conditions, 280 events. 129/280 cut-off events. For 3651/3651 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1068 event pairs, 34 based on Foata normal form. 6/285 useless extension candidates. Maximal degree in co-relation 1067. Up to 216 conditions per place. [2024-06-14 15:33:52,727 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 42 selfloop transitions, 6 changer transitions 14/64 dead transitions. [2024-06-14 15:33:52,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 64 transitions, 489 flow [2024-06-14 15:33:52,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:33:52,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:33:52,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2024-06-14 15:33:52,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37083333333333335 [2024-06-14 15:33:52,728 INFO L175 Difference]: Start difference. First operand has 91 places, 50 transitions, 329 flow. Second operand 8 states and 89 transitions. [2024-06-14 15:33:52,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 64 transitions, 489 flow [2024-06-14 15:33:52,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 64 transitions, 460 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-14 15:33:52,735 INFO L231 Difference]: Finished difference. Result has 86 places, 46 transitions, 295 flow [2024-06-14 15:33:52,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=295, PETRI_PLACES=86, PETRI_TRANSITIONS=46} [2024-06-14 15:33:52,735 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 57 predicate places. [2024-06-14 15:33:52,735 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 46 transitions, 295 flow [2024-06-14 15:33:52,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 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:33:52,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:33:52,735 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:33:52,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-14 15:33:52,736 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:33:52,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:33:52,736 INFO L85 PathProgramCache]: Analyzing trace with hash -713535578, now seen corresponding path program 5 times [2024-06-14 15:33:52,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:33:52,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572222612] [2024-06-14 15:33:52,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:33:52,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:33:52,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:33:58,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:33:58,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:33:58,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572222612] [2024-06-14 15:33:58,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572222612] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:33:58,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:33:58,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:33:58,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108976261] [2024-06-14 15:33:58,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:33:58,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:33:58,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:33:58,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:33:58,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:33:58,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:33:58,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 46 transitions, 295 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:58,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:33:58,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:33:58,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:33:58,637 INFO L124 PetriNetUnfolderBase]: 115/254 cut-off events. [2024-06-14 15:33:58,637 INFO L125 PetriNetUnfolderBase]: For 3664/3664 co-relation queries the response was YES. [2024-06-14 15:33:58,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1018 conditions, 254 events. 115/254 cut-off events. For 3664/3664 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 936 event pairs, 30 based on Foata normal form. 6/259 useless extension candidates. Maximal degree in co-relation 975. Up to 144 conditions per place. [2024-06-14 15:33:58,639 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 39 selfloop transitions, 12 changer transitions 10/63 dead transitions. [2024-06-14 15:33:58,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 63 transitions, 463 flow [2024-06-14 15:33:58,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:33:58,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:33:58,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2024-06-14 15:33:58,640 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-14 15:33:58,640 INFO L175 Difference]: Start difference. First operand has 86 places, 46 transitions, 295 flow. Second operand 8 states and 96 transitions. [2024-06-14 15:33:58,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 63 transitions, 463 flow [2024-06-14 15:33:58,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 63 transitions, 443 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-14 15:33:58,644 INFO L231 Difference]: Finished difference. Result has 80 places, 42 transitions, 274 flow [2024-06-14 15:33:58,644 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=274, PETRI_PLACES=80, PETRI_TRANSITIONS=42} [2024-06-14 15:33:58,645 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 51 predicate places. [2024-06-14 15:33:58,645 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 42 transitions, 274 flow [2024-06-14 15:33:58,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:58,645 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:33:58,645 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:33:58,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-14 15:33:58,646 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:33:58,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:33:58,646 INFO L85 PathProgramCache]: Analyzing trace with hash -713766218, now seen corresponding path program 6 times [2024-06-14 15:33:58,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:33:58,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571770022] [2024-06-14 15:33:58,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:33:58,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:33:58,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:34:03,794 INFO L134 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:34:03,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:34:03,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571770022] [2024-06-14 15:34:03,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571770022] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:34:03,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:34:03,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:34:03,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830082515] [2024-06-14 15:34:03,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:34:03,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:34:03,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:34:03,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:34:03,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:34:03,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:34:03,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 42 transitions, 274 flow. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 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:34:03,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:34:03,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:34:03,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:34:04,199 INFO L124 PetriNetUnfolderBase]: 96/221 cut-off events. [2024-06-14 15:34:04,199 INFO L125 PetriNetUnfolderBase]: For 2394/2394 co-relation queries the response was YES. [2024-06-14 15:34:04,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 854 conditions, 221 events. 96/221 cut-off events. For 2394/2394 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 786 event pairs, 27 based on Foata normal form. 6/226 useless extension candidates. Maximal degree in co-relation 814. Up to 127 conditions per place. [2024-06-14 15:34:04,200 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 34 selfloop transitions, 8 changer transitions 17/61 dead transitions. [2024-06-14 15:34:04,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 61 transitions, 440 flow [2024-06-14 15:34:04,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:34:04,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:34:04,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2024-06-14 15:34:04,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4041666666666667 [2024-06-14 15:34:04,201 INFO L175 Difference]: Start difference. First operand has 80 places, 42 transitions, 274 flow. Second operand 8 states and 97 transitions. [2024-06-14 15:34:04,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 61 transitions, 440 flow [2024-06-14 15:34:04,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 61 transitions, 406 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-14 15:34:04,205 INFO L231 Difference]: Finished difference. Result has 76 places, 32 transitions, 185 flow [2024-06-14 15:34:04,205 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=185, PETRI_PLACES=76, PETRI_TRANSITIONS=32} [2024-06-14 15:34:04,205 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 47 predicate places. [2024-06-14 15:34:04,205 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 32 transitions, 185 flow [2024-06-14 15:34:04,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 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:34:04,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:34:04,205 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:34:04,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-14 15:34:04,205 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:34:04,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:34:04,206 INFO L85 PathProgramCache]: Analyzing trace with hash 437945416, now seen corresponding path program 1 times [2024-06-14 15:34:04,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:34:04,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040641240] [2024-06-14 15:34:04,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:34:04,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:34:04,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:34:09,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:34:09,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:34:09,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040641240] [2024-06-14 15:34:09,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040641240] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:34:09,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:34:09,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:34:09,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883939230] [2024-06-14 15:34:09,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:34:09,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:34:09,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:34:09,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:34:09,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:34:09,900 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:34:09,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 32 transitions, 185 flow. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:34:09,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:34:09,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:34:09,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:34:10,161 INFO L124 PetriNetUnfolderBase]: 66/155 cut-off events. [2024-06-14 15:34:10,161 INFO L125 PetriNetUnfolderBase]: For 1224/1224 co-relation queries the response was YES. [2024-06-14 15:34:10,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 551 conditions, 155 events. 66/155 cut-off events. For 1224/1224 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 445 event pairs, 13 based on Foata normal form. 4/158 useless extension candidates. Maximal degree in co-relation 526. Up to 57 conditions per place. [2024-06-14 15:34:10,162 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 23 selfloop transitions, 6 changer transitions 19/50 dead transitions. [2024-06-14 15:34:10,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 50 transitions, 323 flow [2024-06-14 15:34:10,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:34:10,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:34:10,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2024-06-14 15:34:10,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35 [2024-06-14 15:34:10,163 INFO L175 Difference]: Start difference. First operand has 76 places, 32 transitions, 185 flow. Second operand 10 states and 105 transitions. [2024-06-14 15:34:10,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 50 transitions, 323 flow [2024-06-14 15:34:10,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 50 transitions, 279 flow, removed 5 selfloop flow, removed 15 redundant places. [2024-06-14 15:34:10,165 INFO L231 Difference]: Finished difference. Result has 64 places, 26 transitions, 129 flow [2024-06-14 15:34:10,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=129, PETRI_PLACES=64, PETRI_TRANSITIONS=26} [2024-06-14 15:34:10,165 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 35 predicate places. [2024-06-14 15:34:10,166 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 26 transitions, 129 flow [2024-06-14 15:34:10,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:34:10,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:34:10,166 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:34:10,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-14 15:34:10,166 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:34:10,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:34:10,166 INFO L85 PathProgramCache]: Analyzing trace with hash 2016990996, now seen corresponding path program 2 times [2024-06-14 15:34:10,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:34:10,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159480036] [2024-06-14 15:34:10,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:34:10,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:34:10,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:34:15,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:34:15,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:34:15,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159480036] [2024-06-14 15:34:15,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159480036] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:34:15,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:34:15,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:34:15,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120358399] [2024-06-14 15:34:15,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:34:15,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:34:15,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:34:15,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:34:15,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:34:15,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-14 15:34:15,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 26 transitions, 129 flow. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:34:15,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:34:15,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-14 15:34:15,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:34:15,963 INFO L124 PetriNetUnfolderBase]: 35/88 cut-off events. [2024-06-14 15:34:15,963 INFO L125 PetriNetUnfolderBase]: For 513/513 co-relation queries the response was YES. [2024-06-14 15:34:15,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 88 events. 35/88 cut-off events. For 513/513 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 183 event pairs, 1 based on Foata normal form. 4/91 useless extension candidates. Maximal degree in co-relation 233. Up to 21 conditions per place. [2024-06-14 15:34:15,963 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 0 selfloop transitions, 0 changer transitions 37/37 dead transitions. [2024-06-14 15:34:15,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 37 transitions, 193 flow [2024-06-14 15:34:15,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:34:15,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:34:15,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 92 transitions. [2024-06-14 15:34:15,964 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30666666666666664 [2024-06-14 15:34:15,964 INFO L175 Difference]: Start difference. First operand has 64 places, 26 transitions, 129 flow. Second operand 10 states and 92 transitions. [2024-06-14 15:34:15,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 37 transitions, 193 flow [2024-06-14 15:34:15,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 37 transitions, 161 flow, removed 0 selfloop flow, removed 13 redundant places. [2024-06-14 15:34:15,965 INFO L231 Difference]: Finished difference. Result has 48 places, 0 transitions, 0 flow [2024-06-14 15:34:15,965 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=0, PETRI_PLACES=48, PETRI_TRANSITIONS=0} [2024-06-14 15:34:15,965 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 19 predicate places. [2024-06-14 15:34:15,965 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 0 transitions, 0 flow [2024-06-14 15:34:15,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:34:15,968 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 4 remaining) [2024-06-14 15:34:15,968 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-14 15:34:15,968 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-06-14 15:34:15,969 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-14 15:34:15,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-14 15:34:15,969 INFO L445 BasicCegarLoop]: Path program histogram: [11, 7, 6, 6, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:34:15,971 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-14 15:34:15,971 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-14 15:34:15,974 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-14 15:34:15,974 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-14 15:34:15,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.06 03:34:15 BasicIcfg [2024-06-14 15:34:15,975 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-14 15:34:15,975 INFO L158 Benchmark]: Toolchain (without parser) took 258717.83ms. Allocated memory was 174.1MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 142.8MB in the beginning and 949.1MB in the end (delta: -806.4MB). Peak memory consumption was 611.7MB. Max. memory is 16.1GB. [2024-06-14 15:34:15,975 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 121.6MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-14 15:34:15,976 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 121.6MB. Free memory was 88.5MB in the beginning and 88.3MB in the end (delta: 140.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-14 15:34:15,976 INFO L158 Benchmark]: CACSL2BoogieTranslator took 689.49ms. Allocated memory is still 174.1MB. Free memory was 142.1MB in the beginning and 91.8MB in the end (delta: 50.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-06-14 15:34:15,976 INFO L158 Benchmark]: Boogie Procedure Inliner took 106.63ms. Allocated memory is still 174.1MB. Free memory was 91.8MB in the beginning and 76.0MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-06-14 15:34:15,976 INFO L158 Benchmark]: Boogie Preprocessor took 114.03ms. Allocated memory is still 174.1MB. Free memory was 76.0MB in the beginning and 69.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-06-14 15:34:15,977 INFO L158 Benchmark]: RCFGBuilder took 997.76ms. Allocated memory was 174.1MB in the beginning and 260.0MB in the end (delta: 86.0MB). Free memory was 69.7MB in the beginning and 192.6MB in the end (delta: -122.9MB). Peak memory consumption was 54.8MB. Max. memory is 16.1GB. [2024-06-14 15:34:15,977 INFO L158 Benchmark]: TraceAbstraction took 256803.52ms. Allocated memory was 260.0MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 191.5MB in the beginning and 949.1MB in the end (delta: -757.6MB). Peak memory consumption was 574.1MB. Max. memory is 16.1GB. [2024-06-14 15:34:15,978 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.15ms. Allocated memory is still 121.6MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.14ms. Allocated memory is still 121.6MB. Free memory was 88.5MB in the beginning and 88.3MB in the end (delta: 140.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 689.49ms. Allocated memory is still 174.1MB. Free memory was 142.1MB in the beginning and 91.8MB in the end (delta: 50.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 106.63ms. Allocated memory is still 174.1MB. Free memory was 91.8MB in the beginning and 76.0MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 114.03ms. Allocated memory is still 174.1MB. Free memory was 76.0MB in the beginning and 69.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 997.76ms. Allocated memory was 174.1MB in the beginning and 260.0MB in the end (delta: 86.0MB). Free memory was 69.7MB in the beginning and 192.6MB in the end (delta: -122.9MB). Peak memory consumption was 54.8MB. Max. memory is 16.1GB. * TraceAbstraction took 256803.52ms. Allocated memory was 260.0MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 191.5MB in the beginning and 949.1MB in the end (delta: -757.6MB). Peak memory consumption was 574.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 808]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 809]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 47 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 256.7s, OverallIterations: 53, TraceHistogramMax: 1, PathProgramHistogramMax: 11, EmptinessCheckTime: 0.0s, AutomataDifference: 20.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2960 SdHoareTripleChecker+Valid, 13.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2501 mSDsluCounter, 1594 SdHoareTripleChecker+Invalid, 12.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1350 mSDsCounter, 588 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15729 IncrementalHoareTripleChecker+Invalid, 16317 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 588 mSolverCounterUnsat, 244 mSDtfsCounter, 15729 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 476 GetRequests, 3 SyntacticMatches, 7 SemanticMatches, 466 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 11.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=677occurred in iteration=30, InterpolantAutomatonStates: 407, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 233.4s InterpolantComputationTime, 828 NumberOfCodeBlocks, 828 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 775 ConstructedInterpolants, 0 QuantifiedInterpolants, 34493 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 53 InterpolantComputations, 53 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-06-14 15:34:16,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE