./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.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/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.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/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.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 14:36:42,924 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 14:36:42,989 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 14:36:42,995 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 14:36:42,995 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 14:36:43,026 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 14:36:43,027 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 14:36:43,027 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 14:36:43,028 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 14:36:43,028 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 14:36:43,028 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 14:36:43,029 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 14:36:43,029 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 14:36:43,035 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 14:36:43,035 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 14:36:43,036 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 14:36:43,036 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 14:36:43,037 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 14:36:43,037 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 14:36:43,037 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 14:36:43,037 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 14:36:43,038 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 14:36:43,038 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 14:36:43,038 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 14:36:43,039 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 14:36:43,039 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 14:36:43,039 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 14:36:43,039 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 14:36:43,040 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 14:36:43,040 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 14:36:43,040 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 14:36:43,041 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 14:36:43,041 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 14:36:43,041 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 14:36:43,041 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 14:36:43,041 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 14:36:43,042 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 14:36:43,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 14:36:43,042 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 14:36:43,042 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 14:36:43,042 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 14:36:43,043 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 14:36:43,043 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 14:36:43,043 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-14 14:36:43,202 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 14:36:43,223 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 14:36:43,225 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 14:36:43,226 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 14:36:43,227 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 14:36:43,227 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/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.yml/witness.yml [2024-06-14 14:36:43,360 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 14:36:43,360 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 14:36:43,360 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2024-06-14 14:36:44,620 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 14:36:44,821 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 14:36:44,821 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2024-06-14 14:36:44,845 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/759368d6c/5e48d221d28f4197898023f9ae507753/FLAG4d3622023 [2024-06-14 14:36:44,856 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/759368d6c/5e48d221d28f4197898023f9ae507753 [2024-06-14 14:36:44,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 14:36:44,858 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 14:36:44,859 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 14:36:44,859 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 14:36:44,862 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 14:36:44,863 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:36:43" (1/2) ... [2024-06-14 14:36:44,865 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ca675ba and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:36:44, skipping insertion in model container [2024-06-14 14:36:44,865 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:36:43" (1/2) ... [2024-06-14 14:36:44,867 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@29e71fbd and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:36:44, skipping insertion in model container [2024-06-14 14:36:44,867 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 02:36:44" (2/2) ... [2024-06-14 14:36:44,868 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ca675ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:36:44, skipping insertion in model container [2024-06-14 14:36:44,868 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 02:36:44" (2/2) ... [2024-06-14 14:36:44,868 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 14:36:44,927 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 14:36:44,929 INFO L97 edCorrectnessWitness]: Location invariant before [L815-L815] ((((((((((((((((! multithreaded || y$read_delayed == (_Bool)0) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! 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_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_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_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_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 )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_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_p0_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_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 )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )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_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (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 )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_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$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && 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_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (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)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-14 14:36:44,929 INFO L97 edCorrectnessWitness]: Location invariant before [L816-L816] ((((((((((((((((! multithreaded || y$read_delayed == (_Bool)0) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! 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_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_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_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_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 )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_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_p0_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_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 )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )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_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (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 )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_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$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && 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_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (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)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-14 14:36:44,930 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 14:36:44,930 INFO L106 edCorrectnessWitness]: ghost_update [L813-L813] multithreaded = 1; [2024-06-14 14:36:44,970 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 14:36:45,286 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 14:36:45,296 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-14 14:36:45,562 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 14:36:45,617 INFO L206 MainTranslator]: Completed translation [2024-06-14 14:36:45,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:36:45 WrapperNode [2024-06-14 14:36:45,618 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 14:36:45,619 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 14:36:45,619 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 14:36:45,619 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 14:36:45,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:36:45" (1/1) ... [2024-06-14 14:36:45,656 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:36:45" (1/1) ... [2024-06-14 14:36:45,713 INFO L138 Inliner]: procedures = 174, calls = 36, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 114 [2024-06-14 14:36:45,714 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 14:36:45,715 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 14:36:45,715 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 14:36:45,716 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 14:36:45,724 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:36:45" (1/1) ... [2024-06-14 14:36:45,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:36:45" (1/1) ... [2024-06-14 14:36:45,744 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:36:45" (1/1) ... [2024-06-14 14:36:45,768 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-14 14:36:45,769 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:36:45" (1/1) ... [2024-06-14 14:36:45,770 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:36:45" (1/1) ... [2024-06-14 14:36:45,790 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:36:45" (1/1) ... [2024-06-14 14:36:45,791 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:36:45" (1/1) ... [2024-06-14 14:36:45,796 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:36:45" (1/1) ... [2024-06-14 14:36:45,801 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:36:45" (1/1) ... [2024-06-14 14:36:45,866 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 14:36:45,867 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 14:36:45,867 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 14:36:45,867 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 14:36:45,867 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:36:45" (1/1) ... [2024-06-14 14:36:45,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 14:36:45,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 14:36:45,946 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-14 14:36:45,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-14 14:36:46,006 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-14 14:36:46,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 14:36:46,006 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-14 14:36:46,006 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-14 14:36:46,007 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-14 14:36:46,007 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-14 14:36:46,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 14:36:46,007 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-14 14:36:46,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 14:36:46,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 14:36:46,008 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-14 14:36:46,117 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 14:36:46,118 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 14:36:46,723 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 14:36:46,723 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 14:36:46,908 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 14:36:46,909 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-14 14:36:46,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 02:36:46 BoogieIcfgContainer [2024-06-14 14:36:46,910 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 14:36:46,913 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 14:36:46,913 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 14:36:46,916 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 14:36:46,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:36:43" (1/4) ... [2024-06-14 14:36:46,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd93b90 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 02:36:46, skipping insertion in model container [2024-06-14 14:36:46,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 02:36:44" (2/4) ... [2024-06-14 14:36:46,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd93b90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 02:36:46, skipping insertion in model container [2024-06-14 14:36:46,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:36:45" (3/4) ... [2024-06-14 14:36:46,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd93b90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 02:36:46, skipping insertion in model container [2024-06-14 14:36:46,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 02:36:46" (4/4) ... [2024-06-14 14:36:46,922 INFO L112 eAbstractionObserver]: Analyzing ICFG mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2024-06-14 14:36:46,936 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 14:36:46,936 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-14 14:36:46,936 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 14:36:47,011 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-14 14:36:47,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 31 transitions, 70 flow [2024-06-14 14:36:47,074 INFO L124 PetriNetUnfolderBase]: 0/29 cut-off events. [2024-06-14 14:36:47,075 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 14:36:47,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 29 events. 0/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-14 14:36:47,078 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 31 transitions, 70 flow [2024-06-14 14:36:47,080 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 23 transitions, 52 flow [2024-06-14 14:36:47,092 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 14:36:47,098 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;@1f6a8d93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 14:36:47,098 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-14 14:36:47,103 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 14:36:47,103 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-14 14:36:47,103 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 14:36:47,104 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:36:47,104 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-14 14:36:47,104 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:36:47,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:36:47,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1657040526, now seen corresponding path program 1 times [2024-06-14 14:36:47,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:36:47,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358514302] [2024-06-14 14:36:47,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:36:47,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:36:47,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:36:50,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:36:50,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:36:50,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358514302] [2024-06-14 14:36:50,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358514302] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:36:50,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:36:50,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 14:36:50,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456882399] [2024-06-14 14:36:50,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:36:50,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 14:36:50,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:36:50,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 14:36:50,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 14:36:50,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2024-06-14 14:36:50,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:50,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:36:50,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2024-06-14 14:36:50,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:36:51,208 INFO L124 PetriNetUnfolderBase]: 131/257 cut-off events. [2024-06-14 14:36:51,209 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-14 14:36:51,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 515 conditions, 257 events. 131/257 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 940 event pairs, 75 based on Foata normal form. 1/252 useless extension candidates. Maximal degree in co-relation 501. Up to 235 conditions per place. [2024-06-14 14:36:51,214 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 22 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2024-06-14 14:36:51,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 117 flow [2024-06-14 14:36:51,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 14:36:51,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 14:36:51,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2024-06-14 14:36:51,223 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5806451612903226 [2024-06-14 14:36:51,225 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 52 flow. Second operand 3 states and 54 transitions. [2024-06-14 14:36:51,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 117 flow [2024-06-14 14:36:51,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-14 14:36:51,228 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 71 flow [2024-06-14 14:36:51,230 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2024-06-14 14:36:51,232 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2024-06-14 14:36:51,233 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 71 flow [2024-06-14 14:36:51,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:51,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:36:51,233 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:36:51,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 14:36:51,234 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:36:51,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:36:51,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1016656483, now seen corresponding path program 1 times [2024-06-14 14:36:51,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:36:51,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133535478] [2024-06-14 14:36:51,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:36:51,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:36:51,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:36:54,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:36:54,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:36:54,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133535478] [2024-06-14 14:36:54,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133535478] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:36:54,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:36:54,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 14:36:54,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070199512] [2024-06-14 14:36:54,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:36:54,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 14:36:54,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:36:54,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 14:36:54,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-14 14:36:54,289 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2024-06-14 14:36:54,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 71 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:54,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:36:54,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2024-06-14 14:36:54,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:36:54,479 INFO L124 PetriNetUnfolderBase]: 128/257 cut-off events. [2024-06-14 14:36:54,480 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2024-06-14 14:36:54,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 582 conditions, 257 events. 128/257 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 927 event pairs, 57 based on Foata normal form. 2/257 useless extension candidates. Maximal degree in co-relation 567. Up to 221 conditions per place. [2024-06-14 14:36:54,482 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 26 selfloop transitions, 5 changer transitions 0/35 dead transitions. [2024-06-14 14:36:54,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 159 flow [2024-06-14 14:36:54,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 14:36:54,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 14:36:54,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2024-06-14 14:36:54,492 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5564516129032258 [2024-06-14 14:36:54,492 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 71 flow. Second operand 4 states and 69 transitions. [2024-06-14 14:36:54,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 159 flow [2024-06-14 14:36:54,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 35 transitions, 156 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 14:36:54,493 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 95 flow [2024-06-14 14:36:54,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=95, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2024-06-14 14:36:54,494 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 4 predicate places. [2024-06-14 14:36:54,494 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 95 flow [2024-06-14 14:36:54,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:54,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:36:54,495 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:36:54,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-14 14:36:54,495 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:36:54,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:36:54,496 INFO L85 PathProgramCache]: Analyzing trace with hash 2024054476, now seen corresponding path program 1 times [2024-06-14 14:36:54,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:36:54,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957913593] [2024-06-14 14:36:54,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:36:54,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:36:54,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:36:58,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 14:36:58,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:36:58,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957913593] [2024-06-14 14:36:58,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957913593] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:36:58,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:36:58,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 14:36:58,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698353676] [2024-06-14 14:36:58,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:36:58,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 14:36:58,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:36:58,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 14:36:58,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-14 14:36:58,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-14 14:36:58,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 95 flow. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:58,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:36:58,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-14 14:36:58,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:36:58,461 INFO L124 PetriNetUnfolderBase]: 153/296 cut-off events. [2024-06-14 14:36:58,462 INFO L125 PetriNetUnfolderBase]: For 165/165 co-relation queries the response was YES. [2024-06-14 14:36:58,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 747 conditions, 296 events. 153/296 cut-off events. For 165/165 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1050 event pairs, 43 based on Foata normal form. 2/296 useless extension candidates. Maximal degree in co-relation 730. Up to 246 conditions per place. [2024-06-14 14:36:58,464 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 35 selfloop transitions, 9 changer transitions 0/47 dead transitions. [2024-06-14 14:36:58,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 47 transitions, 240 flow [2024-06-14 14:36:58,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:36:58,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:36:58,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 94 transitions. [2024-06-14 14:36:58,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5053763440860215 [2024-06-14 14:36:58,467 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 95 flow. Second operand 6 states and 94 transitions. [2024-06-14 14:36:58,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 47 transitions, 240 flow [2024-06-14 14:36:58,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 47 transitions, 228 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-14 14:36:58,469 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 134 flow [2024-06-14 14:36:58,469 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=134, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2024-06-14 14:36:58,470 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2024-06-14 14:36:58,470 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 134 flow [2024-06-14 14:36:58,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:58,470 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:36:58,471 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:36:58,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-14 14:36:58,471 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:36:58,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:36:58,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1678819492, now seen corresponding path program 1 times [2024-06-14 14:36:58,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:36:58,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207811722] [2024-06-14 14:36:58,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:36:58,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:36:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:37:01,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:37:01,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:37:01,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207811722] [2024-06-14 14:37:01,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207811722] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:37:01,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:37:01,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:37:01,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940895721] [2024-06-14 14:37:01,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:37:01,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:37:01,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:37:01,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:37:01,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:37:01,881 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-14 14:37:01,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 134 flow. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:37:01,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:37:01,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-14 14:37:01,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:37:02,166 INFO L124 PetriNetUnfolderBase]: 149/286 cut-off events. [2024-06-14 14:37:02,167 INFO L125 PetriNetUnfolderBase]: For 300/300 co-relation queries the response was YES. [2024-06-14 14:37:02,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 810 conditions, 286 events. 149/286 cut-off events. For 300/300 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1000 event pairs, 24 based on Foata normal form. 4/288 useless extension candidates. Maximal degree in co-relation 791. Up to 220 conditions per place. [2024-06-14 14:37:02,171 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 35 selfloop transitions, 10 changer transitions 0/48 dead transitions. [2024-06-14 14:37:02,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 48 transitions, 260 flow [2024-06-14 14:37:02,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:37:02,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:37:02,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 103 transitions. [2024-06-14 14:37:02,176 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47465437788018433 [2024-06-14 14:37:02,176 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 134 flow. Second operand 7 states and 103 transitions. [2024-06-14 14:37:02,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 48 transitions, 260 flow [2024-06-14 14:37:02,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 48 transitions, 243 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-14 14:37:02,179 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 133 flow [2024-06-14 14:37:02,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=133, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2024-06-14 14:37:02,180 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 12 predicate places. [2024-06-14 14:37:02,180 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 133 flow [2024-06-14 14:37:02,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:37:02,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:37:02,181 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:37:02,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-14 14:37:02,181 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:37:02,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:37:02,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1940312150, now seen corresponding path program 1 times [2024-06-14 14:37:02,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:37:02,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967026806] [2024-06-14 14:37:02,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:37:02,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:37:02,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:37:08,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:37:08,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:37:08,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967026806] [2024-06-14 14:37:08,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967026806] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:37:08,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:37:08,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 14:37:08,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475305225] [2024-06-14 14:37:08,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:37:08,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 14:37:08,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:37:08,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 14:37:08,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-14 14:37:08,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:37:08,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 133 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 14:37:08,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:37:08,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:37:08,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:37:09,100 INFO L124 PetriNetUnfolderBase]: 174/316 cut-off events. [2024-06-14 14:37:09,101 INFO L125 PetriNetUnfolderBase]: For 461/461 co-relation queries the response was YES. [2024-06-14 14:37:09,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 958 conditions, 316 events. 174/316 cut-off events. For 461/461 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1055 event pairs, 47 based on Foata normal form. 1/315 useless extension candidates. Maximal degree in co-relation 938. Up to 304 conditions per place. [2024-06-14 14:37:09,104 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 29 selfloop transitions, 6 changer transitions 0/37 dead transitions. [2024-06-14 14:37:09,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 37 transitions, 221 flow [2024-06-14 14:37:09,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 14:37:09,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 14:37:09,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2024-06-14 14:37:09,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-14 14:37:09,110 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 133 flow. Second operand 5 states and 60 transitions. [2024-06-14 14:37:09,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 37 transitions, 221 flow [2024-06-14 14:37:09,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 37 transitions, 197 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-14 14:37:09,118 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 136 flow [2024-06-14 14:37:09,118 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=136, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2024-06-14 14:37:09,121 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 12 predicate places. [2024-06-14 14:37:09,124 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 136 flow [2024-06-14 14:37:09,124 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 14:37:09,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:37:09,125 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:37:09,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-14 14:37:09,153 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:37:09,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:37:09,166 INFO L85 PathProgramCache]: Analyzing trace with hash 46054112, now seen corresponding path program 1 times [2024-06-14 14:37:09,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:37:09,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450452289] [2024-06-14 14:37:09,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:37:09,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:37:09,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:37:15,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:37:15,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:37:15,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450452289] [2024-06-14 14:37:15,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450452289] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:37:15,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:37:15,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:37:15,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816792307] [2024-06-14 14:37:15,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:37:15,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:37:15,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:37:15,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:37:15,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:37:15,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:37:15,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 136 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 14:37:15,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:37:15,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:37:15,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:37:16,273 INFO L124 PetriNetUnfolderBase]: 168/307 cut-off events. [2024-06-14 14:37:16,274 INFO L125 PetriNetUnfolderBase]: For 607/607 co-relation queries the response was YES. [2024-06-14 14:37:16,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 962 conditions, 307 events. 168/307 cut-off events. For 607/607 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1000 event pairs, 44 based on Foata normal form. 3/308 useless extension candidates. Maximal degree in co-relation 940. Up to 286 conditions per place. [2024-06-14 14:37:16,277 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 32 selfloop transitions, 8 changer transitions 0/42 dead transitions. [2024-06-14 14:37:16,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 42 transitions, 242 flow [2024-06-14 14:37:16,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:37:16,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:37:16,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2024-06-14 14:37:16,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3817204301075269 [2024-06-14 14:37:16,280 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 136 flow. Second operand 6 states and 71 transitions. [2024-06-14 14:37:16,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 42 transitions, 242 flow [2024-06-14 14:37:16,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 42 transitions, 231 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-14 14:37:16,283 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 158 flow [2024-06-14 14:37:16,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=158, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2024-06-14 14:37:16,286 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 15 predicate places. [2024-06-14 14:37:16,286 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 158 flow [2024-06-14 14:37:16,286 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 14:37:16,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:37:16,286 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:37:16,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-14 14:37:16,287 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:37:16,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:37:16,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1427463613, now seen corresponding path program 1 times [2024-06-14 14:37:16,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:37:16,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957378804] [2024-06-14 14:37:16,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:37:16,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:37:16,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:37:21,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:37:21,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:37:21,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957378804] [2024-06-14 14:37:21,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957378804] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:37:21,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:37:21,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:37:21,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8859129] [2024-06-14 14:37:21,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:37:21,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:37:21,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:37:21,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:37:21,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:37:21,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:37:21,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 158 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 14:37:21,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:37:21,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:37:21,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:37:21,785 INFO L124 PetriNetUnfolderBase]: 171/312 cut-off events. [2024-06-14 14:37:21,786 INFO L125 PetriNetUnfolderBase]: For 754/754 co-relation queries the response was YES. [2024-06-14 14:37:21,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1046 conditions, 312 events. 171/312 cut-off events. For 754/754 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1023 event pairs, 44 based on Foata normal form. 1/311 useless extension candidates. Maximal degree in co-relation 1023. Up to 284 conditions per place. [2024-06-14 14:37:21,788 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 35 selfloop transitions, 11 changer transitions 0/48 dead transitions. [2024-06-14 14:37:21,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 48 transitions, 302 flow [2024-06-14 14:37:21,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:37:21,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:37:21,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2024-06-14 14:37:21,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4032258064516129 [2024-06-14 14:37:21,790 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 158 flow. Second operand 6 states and 75 transitions. [2024-06-14 14:37:21,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 48 transitions, 302 flow [2024-06-14 14:37:21,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 48 transitions, 285 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-14 14:37:21,793 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 188 flow [2024-06-14 14:37:21,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=188, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2024-06-14 14:37:21,794 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 17 predicate places. [2024-06-14 14:37:21,794 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 188 flow [2024-06-14 14:37:21,794 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 14:37:21,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:37:21,794 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:37:21,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-14 14:37:21,795 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:37:21,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:37:21,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1454482903, now seen corresponding path program 2 times [2024-06-14 14:37:21,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:37:21,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52749795] [2024-06-14 14:37:21,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:37:21,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:37:21,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:37:27,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:37:27,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:37:27,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52749795] [2024-06-14 14:37:27,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52749795] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:37:27,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:37:27,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:37:27,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773107357] [2024-06-14 14:37:27,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:37:27,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:37:27,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:37:27,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:37:27,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:37:27,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:37:27,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 188 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 14:37:27,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:37:27,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:37:27,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:37:27,583 INFO L124 PetriNetUnfolderBase]: 169/309 cut-off events. [2024-06-14 14:37:27,583 INFO L125 PetriNetUnfolderBase]: For 947/947 co-relation queries the response was YES. [2024-06-14 14:37:27,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1090 conditions, 309 events. 169/309 cut-off events. For 947/947 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1027 event pairs, 43 based on Foata normal form. 1/308 useless extension candidates. Maximal degree in co-relation 1066. Up to 294 conditions per place. [2024-06-14 14:37:27,585 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 34 selfloop transitions, 8 changer transitions 0/44 dead transitions. [2024-06-14 14:37:27,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 44 transitions, 286 flow [2024-06-14 14:37:27,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:37:27,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:37:27,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2024-06-14 14:37:27,587 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3709677419354839 [2024-06-14 14:37:27,587 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 188 flow. Second operand 6 states and 69 transitions. [2024-06-14 14:37:27,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 44 transitions, 286 flow [2024-06-14 14:37:27,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 44 transitions, 272 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-14 14:37:27,588 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 195 flow [2024-06-14 14:37:27,589 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=195, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2024-06-14 14:37:27,589 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 21 predicate places. [2024-06-14 14:37:27,589 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 195 flow [2024-06-14 14:37:27,590 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 14:37:27,590 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:37:27,590 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:37:27,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-14 14:37:27,590 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:37:27,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:37:27,591 INFO L85 PathProgramCache]: Analyzing trace with hash -2130829247, now seen corresponding path program 1 times [2024-06-14 14:37:27,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:37:27,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751184836] [2024-06-14 14:37:27,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:37:27,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:37:27,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:37:33,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:37:33,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:37:33,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751184836] [2024-06-14 14:37:33,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751184836] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:37:33,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:37:33,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:37:33,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953833257] [2024-06-14 14:37:33,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:37:33,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:37:33,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:37:33,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:37:33,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:37:33,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:37:33,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 195 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:37:33,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:37:33,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:37:33,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:37:33,838 INFO L124 PetriNetUnfolderBase]: 172/314 cut-off events. [2024-06-14 14:37:33,839 INFO L125 PetriNetUnfolderBase]: For 1171/1171 co-relation queries the response was YES. [2024-06-14 14:37:33,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1137 conditions, 314 events. 172/314 cut-off events. For 1171/1171 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1036 event pairs, 42 based on Foata normal form. 1/313 useless extension candidates. Maximal degree in co-relation 1111. Up to 281 conditions per place. [2024-06-14 14:37:33,842 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 36 selfloop transitions, 11 changer transitions 0/49 dead transitions. [2024-06-14 14:37:33,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 49 transitions, 321 flow [2024-06-14 14:37:33,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:37:33,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:37:33,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2024-06-14 14:37:33,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3978494623655914 [2024-06-14 14:37:33,843 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 195 flow. Second operand 6 states and 74 transitions. [2024-06-14 14:37:33,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 49 transitions, 321 flow [2024-06-14 14:37:33,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 49 transitions, 297 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-06-14 14:37:33,849 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 215 flow [2024-06-14 14:37:33,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=215, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2024-06-14 14:37:33,851 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 21 predicate places. [2024-06-14 14:37:33,851 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 215 flow [2024-06-14 14:37:33,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:37:33,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:37:33,852 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:37:33,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-14 14:37:33,852 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 14:37:33,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:37:33,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1993440455, now seen corresponding path program 1 times [2024-06-14 14:37:33,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:37:33,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600455178] [2024-06-14 14:37:33,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:37:33,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:37:33,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:37:39,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:37:39,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:37:39,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600455178] [2024-06-14 14:37:39,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600455178] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:37:39,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:37:39,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:37:39,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903761415] [2024-06-14 14:37:39,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:37:39,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:37:39,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:37:39,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:37:39,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:37:39,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:37:39,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 215 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:37:39,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:37:39,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:37:39,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:37:39,647 INFO L124 PetriNetUnfolderBase]: 181/329 cut-off events. [2024-06-14 14:37:39,648 INFO L125 PetriNetUnfolderBase]: For 1525/1525 co-relation queries the response was YES. [2024-06-14 14:37:39,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1239 conditions, 329 events. 181/329 cut-off events. For 1525/1525 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1109 event pairs, 45 based on Foata normal form. 3/330 useless extension candidates. Maximal degree in co-relation 1213. Up to 264 conditions per place. [2024-06-14 14:37:39,650 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 44 selfloop transitions, 15 changer transitions 0/61 dead transitions. [2024-06-14 14:37:39,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 61 transitions, 405 flow [2024-06-14 14:37:39,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:37:39,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:37:39,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2024-06-14 14:37:39,651 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.423963133640553 [2024-06-14 14:37:39,651 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 215 flow. Second operand 7 states and 92 transitions. [2024-06-14 14:37:39,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 61 transitions, 405 flow [2024-06-14 14:37:39,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 61 transitions, 378 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-14 14:37:39,653 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 245 flow [2024-06-14 14:37:39,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=245, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2024-06-14 14:37:39,654 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 23 predicate places. [2024-06-14 14:37:39,654 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 245 flow [2024-06-14 14:37:39,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:37:39,654 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:37:39,655 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:37:39,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-14 14:37:39,655 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:37:39,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:37:39,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1993440269, now seen corresponding path program 2 times [2024-06-14 14:37:39,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:37:39,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669626127] [2024-06-14 14:37:39,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:37:39,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:37:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:37:44,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:37:44,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:37:44,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669626127] [2024-06-14 14:37:44,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669626127] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:37:44,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:37:44,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:37:44,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79149695] [2024-06-14 14:37:44,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:37:44,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:37:44,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:37:44,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:37:44,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:37:45,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:37:45,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 245 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:37:45,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:37:45,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:37:45,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:37:45,323 INFO L124 PetriNetUnfolderBase]: 184/334 cut-off events. [2024-06-14 14:37:45,324 INFO L125 PetriNetUnfolderBase]: For 1500/1500 co-relation queries the response was YES. [2024-06-14 14:37:45,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1305 conditions, 334 events. 184/334 cut-off events. For 1500/1500 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1135 event pairs, 42 based on Foata normal form. 1/333 useless extension candidates. Maximal degree in co-relation 1279. Up to 288 conditions per place. [2024-06-14 14:37:45,326 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 40 selfloop transitions, 17 changer transitions 0/59 dead transitions. [2024-06-14 14:37:45,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 59 transitions, 431 flow [2024-06-14 14:37:45,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:37:45,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:37:45,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2024-06-14 14:37:45,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39631336405529954 [2024-06-14 14:37:45,329 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 245 flow. Second operand 7 states and 86 transitions. [2024-06-14 14:37:45,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 59 transitions, 431 flow [2024-06-14 14:37:45,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 59 transitions, 417 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-14 14:37:45,331 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 302 flow [2024-06-14 14:37:45,331 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=302, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2024-06-14 14:37:45,332 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 27 predicate places. [2024-06-14 14:37:45,332 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 302 flow [2024-06-14 14:37:45,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:37:45,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:37:45,333 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:37:45,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-14 14:37:45,333 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:37:45,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:37:45,333 INFO L85 PathProgramCache]: Analyzing trace with hash 2139298283, now seen corresponding path program 3 times [2024-06-14 14:37:45,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:37:45,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706415064] [2024-06-14 14:37:45,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:37:45,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:37:45,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:37:50,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:37:50,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:37:50,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706415064] [2024-06-14 14:37:50,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706415064] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:37:50,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:37:50,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:37:50,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175872297] [2024-06-14 14:37:50,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:37:50,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:37:50,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:37:50,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:37:50,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:37:50,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:37:50,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 302 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:37:50,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:37:50,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:37:50,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:37:50,868 INFO L124 PetriNetUnfolderBase]: 182/331 cut-off events. [2024-06-14 14:37:50,868 INFO L125 PetriNetUnfolderBase]: For 1797/1797 co-relation queries the response was YES. [2024-06-14 14:37:50,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1371 conditions, 331 events. 182/331 cut-off events. For 1797/1797 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1105 event pairs, 45 based on Foata normal form. 1/330 useless extension candidates. Maximal degree in co-relation 1343. Up to 313 conditions per place. [2024-06-14 14:37:50,870 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 43 selfloop transitions, 10 changer transitions 0/55 dead transitions. [2024-06-14 14:37:50,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 55 transitions, 424 flow [2024-06-14 14:37:50,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:37:50,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:37:50,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2024-06-14 14:37:50,872 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35944700460829493 [2024-06-14 14:37:50,872 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 302 flow. Second operand 7 states and 78 transitions. [2024-06-14 14:37:50,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 55 transitions, 424 flow [2024-06-14 14:37:50,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 55 transitions, 396 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-14 14:37:50,875 INFO L231 Difference]: Finished difference. Result has 61 places, 48 transitions, 299 flow [2024-06-14 14:37:50,875 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=299, PETRI_PLACES=61, PETRI_TRANSITIONS=48} [2024-06-14 14:37:50,875 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 31 predicate places. [2024-06-14 14:37:50,876 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 48 transitions, 299 flow [2024-06-14 14:37:50,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:37:50,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:37:50,876 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:37:50,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-14 14:37:50,876 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:37:50,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:37:50,877 INFO L85 PathProgramCache]: Analyzing trace with hash -2124158171, now seen corresponding path program 2 times [2024-06-14 14:37:50,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:37:50,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373170050] [2024-06-14 14:37:50,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:37:50,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:37:50,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:37:55,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:37:55,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:37:55,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373170050] [2024-06-14 14:37:55,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373170050] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:37:55,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:37:55,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:37:55,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151414641] [2024-06-14 14:37:55,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:37:55,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:37:55,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:37:55,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:37:55,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:37:56,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:37:56,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 48 transitions, 299 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:37:56,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:37:56,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:37:56,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:37:56,394 INFO L124 PetriNetUnfolderBase]: 191/346 cut-off events. [2024-06-14 14:37:56,394 INFO L125 PetriNetUnfolderBase]: For 2232/2232 co-relation queries the response was YES. [2024-06-14 14:37:56,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1452 conditions, 346 events. 191/346 cut-off events. For 2232/2232 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1167 event pairs, 41 based on Foata normal form. 3/347 useless extension candidates. Maximal degree in co-relation 1422. Up to 312 conditions per place. [2024-06-14 14:37:56,397 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 49 selfloop transitions, 10 changer transitions 0/61 dead transitions. [2024-06-14 14:37:56,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 61 transitions, 453 flow [2024-06-14 14:37:56,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:37:56,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:37:56,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2024-06-14 14:37:56,398 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3778801843317972 [2024-06-14 14:37:56,399 INFO L175 Difference]: Start difference. First operand has 61 places, 48 transitions, 299 flow. Second operand 7 states and 82 transitions. [2024-06-14 14:37:56,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 61 transitions, 453 flow [2024-06-14 14:37:56,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 61 transitions, 424 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-14 14:37:56,404 INFO L231 Difference]: Finished difference. Result has 62 places, 50 transitions, 311 flow [2024-06-14 14:37:56,404 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=311, PETRI_PLACES=62, PETRI_TRANSITIONS=50} [2024-06-14 14:37:56,405 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 32 predicate places. [2024-06-14 14:37:56,405 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 50 transitions, 311 flow [2024-06-14 14:37:56,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:37:56,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:37:56,406 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:37:56,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-14 14:37:56,406 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:37:56,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:37:56,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1883585071, now seen corresponding path program 3 times [2024-06-14 14:37:56,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:37:56,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874273066] [2024-06-14 14:37:56,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:37:56,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:37:56,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:38:01,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:38:01,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:38:01,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874273066] [2024-06-14 14:38:01,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874273066] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:38:01,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:38:01,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:38:01,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490274769] [2024-06-14 14:38:01,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:38:01,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:38:01,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:38:01,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:38:01,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:38:01,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:38:01,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 50 transitions, 311 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:38:01,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:38:01,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:38:01,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:38:01,944 INFO L124 PetriNetUnfolderBase]: 185/337 cut-off events. [2024-06-14 14:38:01,944 INFO L125 PetriNetUnfolderBase]: For 2425/2425 co-relation queries the response was YES. [2024-06-14 14:38:01,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1436 conditions, 337 events. 185/337 cut-off events. For 2425/2425 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1145 event pairs, 39 based on Foata normal form. 3/338 useless extension candidates. Maximal degree in co-relation 1405. Up to 291 conditions per place. [2024-06-14 14:38:01,946 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 48 selfloop transitions, 13 changer transitions 0/63 dead transitions. [2024-06-14 14:38:01,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 63 transitions, 461 flow [2024-06-14 14:38:01,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:38:01,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:38:01,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2024-06-14 14:38:01,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39631336405529954 [2024-06-14 14:38:01,947 INFO L175 Difference]: Start difference. First operand has 62 places, 50 transitions, 311 flow. Second operand 7 states and 86 transitions. [2024-06-14 14:38:01,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 63 transitions, 461 flow [2024-06-14 14:38:01,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 63 transitions, 438 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-14 14:38:01,950 INFO L231 Difference]: Finished difference. Result has 64 places, 50 transitions, 319 flow [2024-06-14 14:38:01,951 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=319, PETRI_PLACES=64, PETRI_TRANSITIONS=50} [2024-06-14 14:38:01,951 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 34 predicate places. [2024-06-14 14:38:01,951 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 50 transitions, 319 flow [2024-06-14 14:38:01,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:38:01,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:38:01,952 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:38:01,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-14 14:38:01,952 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:38:01,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:38:01,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1886109238, now seen corresponding path program 1 times [2024-06-14 14:38:01,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:38:01,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5365617] [2024-06-14 14:38:01,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:38:01,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:38:01,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:38:08,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 14:38:08,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:38:08,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5365617] [2024-06-14 14:38:08,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5365617] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:38:08,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:38:08,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:38:08,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306079951] [2024-06-14 14:38:08,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:38:08,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:38:08,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:38:08,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:38:08,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:38:08,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:38:08,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 50 transitions, 319 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 14:38:08,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:38:08,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:38:08,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:38:08,502 INFO L124 PetriNetUnfolderBase]: 193/350 cut-off events. [2024-06-14 14:38:08,502 INFO L125 PetriNetUnfolderBase]: For 2755/2755 co-relation queries the response was YES. [2024-06-14 14:38:08,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1542 conditions, 350 events. 193/350 cut-off events. For 2755/2755 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1207 event pairs, 42 based on Foata normal form. 1/349 useless extension candidates. Maximal degree in co-relation 1510. Up to 301 conditions per place. [2024-06-14 14:38:08,504 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 50 selfloop transitions, 17 changer transitions 0/69 dead transitions. [2024-06-14 14:38:08,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 69 transitions, 543 flow [2024-06-14 14:38:08,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:38:08,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:38:08,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2024-06-14 14:38:08,506 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3911290322580645 [2024-06-14 14:38:08,507 INFO L175 Difference]: Start difference. First operand has 64 places, 50 transitions, 319 flow. Second operand 8 states and 97 transitions. [2024-06-14 14:38:08,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 69 transitions, 543 flow [2024-06-14 14:38:08,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 69 transitions, 504 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-14 14:38:08,510 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 351 flow [2024-06-14 14:38:08,510 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=351, PETRI_PLACES=66, PETRI_TRANSITIONS=54} [2024-06-14 14:38:08,511 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 36 predicate places. [2024-06-14 14:38:08,511 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 351 flow [2024-06-14 14:38:08,511 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 14:38:08,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:38:08,511 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:38:08,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-14 14:38:08,512 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:38:08,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:38:08,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1663388406, now seen corresponding path program 2 times [2024-06-14 14:38:08,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:38:08,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261420090] [2024-06-14 14:38:08,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:38:08,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:38:08,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:38:14,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:38:14,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:38:14,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261420090] [2024-06-14 14:38:14,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261420090] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:38:14,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:38:14,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:38:14,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982246827] [2024-06-14 14:38:14,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:38:14,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:38:14,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:38:14,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:38:14,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:38:14,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:38:14,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 351 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 14:38:14,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:38:14,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:38:14,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:38:15,000 INFO L124 PetriNetUnfolderBase]: 191/347 cut-off events. [2024-06-14 14:38:15,000 INFO L125 PetriNetUnfolderBase]: For 3025/3025 co-relation queries the response was YES. [2024-06-14 14:38:15,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1554 conditions, 347 events. 191/347 cut-off events. For 3025/3025 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1196 event pairs, 42 based on Foata normal form. 1/346 useless extension candidates. Maximal degree in co-relation 1521. Up to 311 conditions per place. [2024-06-14 14:38:15,003 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 49 selfloop transitions, 13 changer transitions 0/64 dead transitions. [2024-06-14 14:38:15,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 64 transitions, 499 flow [2024-06-14 14:38:15,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:38:15,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:38:15,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2024-06-14 14:38:15,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3824884792626728 [2024-06-14 14:38:15,005 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 351 flow. Second operand 7 states and 83 transitions. [2024-06-14 14:38:15,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 64 transitions, 499 flow [2024-06-14 14:38:15,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 64 transitions, 466 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-14 14:38:15,009 INFO L231 Difference]: Finished difference. Result has 69 places, 54 transitions, 349 flow [2024-06-14 14:38:15,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=349, PETRI_PLACES=69, PETRI_TRANSITIONS=54} [2024-06-14 14:38:15,009 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 39 predicate places. [2024-06-14 14:38:15,009 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 54 transitions, 349 flow [2024-06-14 14:38:15,010 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 14:38:15,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:38:15,010 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:38:15,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-14 14:38:15,010 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:38:15,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:38:15,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1886018873, now seen corresponding path program 1 times [2024-06-14 14:38:15,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:38:15,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835073095] [2024-06-14 14:38:15,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:38:15,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:38:15,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:38:20,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:38:20,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:38:20,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835073095] [2024-06-14 14:38:20,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835073095] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:38:20,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:38:20,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:38:20,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699029966] [2024-06-14 14:38:20,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:38:20,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:38:20,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:38:20,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:38:20,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:38:20,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:38:20,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 54 transitions, 349 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 14:38:20,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:38:20,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:38:20,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:38:21,261 INFO L124 PetriNetUnfolderBase]: 200/362 cut-off events. [2024-06-14 14:38:21,261 INFO L125 PetriNetUnfolderBase]: For 3700/3700 co-relation queries the response was YES. [2024-06-14 14:38:21,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1640 conditions, 362 events. 200/362 cut-off events. For 3700/3700 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1255 event pairs, 41 based on Foata normal form. 3/363 useless extension candidates. Maximal degree in co-relation 1605. Up to 311 conditions per place. [2024-06-14 14:38:21,264 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 51 selfloop transitions, 15 changer transitions 0/68 dead transitions. [2024-06-14 14:38:21,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 68 transitions, 523 flow [2024-06-14 14:38:21,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:38:21,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:38:21,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2024-06-14 14:38:21,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39631336405529954 [2024-06-14 14:38:21,266 INFO L175 Difference]: Start difference. First operand has 69 places, 54 transitions, 349 flow. Second operand 7 states and 86 transitions. [2024-06-14 14:38:21,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 68 transitions, 523 flow [2024-06-14 14:38:21,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 68 transitions, 492 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-06-14 14:38:21,270 INFO L231 Difference]: Finished difference. Result has 70 places, 56 transitions, 374 flow [2024-06-14 14:38:21,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=374, PETRI_PLACES=70, PETRI_TRANSITIONS=56} [2024-06-14 14:38:21,270 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 40 predicate places. [2024-06-14 14:38:21,270 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 56 transitions, 374 flow [2024-06-14 14:38:21,270 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 14:38:21,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:38:21,271 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:38:21,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-14 14:38:21,271 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:38:21,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:38:21,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1882299803, now seen corresponding path program 2 times [2024-06-14 14:38:21,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:38:21,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230457270] [2024-06-14 14:38:21,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:38:21,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:38:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:38:26,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 14:38:26,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:38:26,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230457270] [2024-06-14 14:38:26,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230457270] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:38:26,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:38:26,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:38:26,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345751702] [2024-06-14 14:38:26,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:38:26,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:38:26,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:38:26,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:38:26,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:38:26,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:38:26,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 56 transitions, 374 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 14:38:26,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:38:26,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:38:26,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:38:27,333 INFO L124 PetriNetUnfolderBase]: 224/401 cut-off events. [2024-06-14 14:38:27,334 INFO L125 PetriNetUnfolderBase]: For 4577/4577 co-relation queries the response was YES. [2024-06-14 14:38:27,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1917 conditions, 401 events. 224/401 cut-off events. For 4577/4577 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1452 event pairs, 41 based on Foata normal form. 3/402 useless extension candidates. Maximal degree in co-relation 1881. Up to 254 conditions per place. [2024-06-14 14:38:27,336 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 57 selfloop transitions, 26 changer transitions 0/85 dead transitions. [2024-06-14 14:38:27,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 85 transitions, 708 flow [2024-06-14 14:38:27,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:38:27,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:38:27,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 110 transitions. [2024-06-14 14:38:27,338 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4435483870967742 [2024-06-14 14:38:27,338 INFO L175 Difference]: Start difference. First operand has 70 places, 56 transitions, 374 flow. Second operand 8 states and 110 transitions. [2024-06-14 14:38:27,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 85 transitions, 708 flow [2024-06-14 14:38:27,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 85 transitions, 667 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-14 14:38:27,342 INFO L231 Difference]: Finished difference. Result has 72 places, 62 transitions, 452 flow [2024-06-14 14:38:27,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=452, PETRI_PLACES=72, PETRI_TRANSITIONS=62} [2024-06-14 14:38:27,343 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 42 predicate places. [2024-06-14 14:38:27,343 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 62 transitions, 452 flow [2024-06-14 14:38:27,343 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 14:38:27,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:38:27,344 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:38:27,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-14 14:38:27,344 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:38:27,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:38:27,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1667107476, now seen corresponding path program 3 times [2024-06-14 14:38:27,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:38:27,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803064831] [2024-06-14 14:38:27,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:38:27,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:38:27,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:38:33,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:38:33,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:38:33,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803064831] [2024-06-14 14:38:33,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803064831] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:38:33,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:38:33,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:38:33,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389642015] [2024-06-14 14:38:33,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:38:33,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:38:33,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:38:33,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:38:33,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:38:33,773 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:38:33,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 62 transitions, 452 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 14:38:33,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:38:33,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:38:33,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:38:34,173 INFO L124 PetriNetUnfolderBase]: 227/406 cut-off events. [2024-06-14 14:38:34,173 INFO L125 PetriNetUnfolderBase]: For 4521/4521 co-relation queries the response was YES. [2024-06-14 14:38:34,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1986 conditions, 406 events. 227/406 cut-off events. For 4521/4521 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1474 event pairs, 48 based on Foata normal form. 1/405 useless extension candidates. Maximal degree in co-relation 1950. Up to 358 conditions per place. [2024-06-14 14:38:34,177 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 54 selfloop transitions, 19 changer transitions 0/75 dead transitions. [2024-06-14 14:38:34,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 75 transitions, 642 flow [2024-06-14 14:38:34,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:38:34,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:38:34,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2024-06-14 14:38:34,179 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3790322580645161 [2024-06-14 14:38:34,179 INFO L175 Difference]: Start difference. First operand has 72 places, 62 transitions, 452 flow. Second operand 8 states and 94 transitions. [2024-06-14 14:38:34,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 75 transitions, 642 flow [2024-06-14 14:38:34,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 75 transitions, 611 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-14 14:38:34,186 INFO L231 Difference]: Finished difference. Result has 77 places, 64 transitions, 486 flow [2024-06-14 14:38:34,186 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=486, PETRI_PLACES=77, PETRI_TRANSITIONS=64} [2024-06-14 14:38:34,187 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 47 predicate places. [2024-06-14 14:38:34,187 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 64 transitions, 486 flow [2024-06-14 14:38:34,187 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 14:38:34,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:38:34,188 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:38:34,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-14 14:38:34,188 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:38:34,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:38:34,189 INFO L85 PathProgramCache]: Analyzing trace with hash -22711855, now seen corresponding path program 3 times [2024-06-14 14:38:34,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:38:34,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411640185] [2024-06-14 14:38:34,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:38:34,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:38:34,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:38:40,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:38:40,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:38:40,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411640185] [2024-06-14 14:38:40,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411640185] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:38:40,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:38:40,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:38:40,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331451191] [2024-06-14 14:38:40,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:38:40,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:38:40,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:38:40,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:38:40,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:38:40,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:38:40,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 64 transitions, 486 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 14:38:40,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:38:40,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:38:40,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:38:40,952 INFO L124 PetriNetUnfolderBase]: 221/397 cut-off events. [2024-06-14 14:38:40,953 INFO L125 PetriNetUnfolderBase]: For 4793/4793 co-relation queries the response was YES. [2024-06-14 14:38:40,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1965 conditions, 397 events. 221/397 cut-off events. For 4793/4793 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1438 event pairs, 45 based on Foata normal form. 3/398 useless extension candidates. Maximal degree in co-relation 1927. Up to 255 conditions per place. [2024-06-14 14:38:40,956 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 55 selfloop transitions, 27 changer transitions 0/84 dead transitions. [2024-06-14 14:38:40,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 84 transitions, 728 flow [2024-06-14 14:38:40,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:38:40,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:38:40,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 106 transitions. [2024-06-14 14:38:40,957 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4274193548387097 [2024-06-14 14:38:40,957 INFO L175 Difference]: Start difference. First operand has 77 places, 64 transitions, 486 flow. Second operand 8 states and 106 transitions. [2024-06-14 14:38:40,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 84 transitions, 728 flow [2024-06-14 14:38:40,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 84 transitions, 669 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-14 14:38:40,963 INFO L231 Difference]: Finished difference. Result has 79 places, 64 transitions, 486 flow [2024-06-14 14:38:40,963 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=486, PETRI_PLACES=79, PETRI_TRANSITIONS=64} [2024-06-14 14:38:40,963 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 49 predicate places. [2024-06-14 14:38:40,964 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 64 transitions, 486 flow [2024-06-14 14:38:40,964 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 14:38:40,964 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:38:40,964 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:38:40,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-14 14:38:40,965 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:38:40,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:38:40,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1893744349, now seen corresponding path program 4 times [2024-06-14 14:38:40,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:38:40,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921385923] [2024-06-14 14:38:40,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:38:40,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:38:41,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:38:46,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:38:46,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:38:46,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921385923] [2024-06-14 14:38:46,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921385923] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:38:46,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:38:46,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:38:46,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003210835] [2024-06-14 14:38:46,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:38:46,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:38:46,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:38:46,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:38:46,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:38:46,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:38:46,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 64 transitions, 486 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 14:38:46,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:38:46,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:38:46,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:38:46,890 INFO L124 PetriNetUnfolderBase]: 245/436 cut-off events. [2024-06-14 14:38:46,890 INFO L125 PetriNetUnfolderBase]: For 6124/6124 co-relation queries the response was YES. [2024-06-14 14:38:46,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2258 conditions, 436 events. 245/436 cut-off events. For 6124/6124 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1609 event pairs, 41 based on Foata normal form. 3/437 useless extension candidates. Maximal degree in co-relation 2219. Up to 342 conditions per place. [2024-06-14 14:38:46,893 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 65 selfloop transitions, 19 changer transitions 0/86 dead transitions. [2024-06-14 14:38:46,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 86 transitions, 816 flow [2024-06-14 14:38:46,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:38:46,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:38:46,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2024-06-14 14:38:46,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40725806451612906 [2024-06-14 14:38:46,895 INFO L175 Difference]: Start difference. First operand has 79 places, 64 transitions, 486 flow. Second operand 8 states and 101 transitions. [2024-06-14 14:38:46,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 86 transitions, 816 flow [2024-06-14 14:38:46,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 86 transitions, 749 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-14 14:38:46,903 INFO L231 Difference]: Finished difference. Result has 80 places, 68 transitions, 514 flow [2024-06-14 14:38:46,903 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=514, PETRI_PLACES=80, PETRI_TRANSITIONS=68} [2024-06-14 14:38:46,903 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 50 predicate places. [2024-06-14 14:38:46,903 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 68 transitions, 514 flow [2024-06-14 14:38:46,904 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 14:38:46,904 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:38:46,904 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:38:46,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-14 14:38:46,904 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:38:46,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:38:46,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1738409273, now seen corresponding path program 5 times [2024-06-14 14:38:46,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:38:46,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833731697] [2024-06-14 14:38:46,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:38:46,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:38:46,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:38:52,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:38:52,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:38:52,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833731697] [2024-06-14 14:38:52,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833731697] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:38:52,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:38:52,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:38:52,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167236364] [2024-06-14 14:38:52,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:38:52,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:38:52,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:38:52,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:38:52,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:38:52,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:38:52,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 68 transitions, 514 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 14:38:52,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:38:52,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:38:52,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:38:52,920 INFO L124 PetriNetUnfolderBase]: 239/427 cut-off events. [2024-06-14 14:38:52,920 INFO L125 PetriNetUnfolderBase]: For 6090/6090 co-relation queries the response was YES. [2024-06-14 14:38:52,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2152 conditions, 427 events. 239/427 cut-off events. For 6090/6090 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1571 event pairs, 39 based on Foata normal form. 3/428 useless extension candidates. Maximal degree in co-relation 2112. Up to 338 conditions per place. [2024-06-14 14:38:52,924 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 63 selfloop transitions, 20 changer transitions 0/85 dead transitions. [2024-06-14 14:38:52,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 85 transitions, 754 flow [2024-06-14 14:38:52,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:38:52,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:38:52,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2024-06-14 14:38:52,946 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39919354838709675 [2024-06-14 14:38:52,946 INFO L175 Difference]: Start difference. First operand has 80 places, 68 transitions, 514 flow. Second operand 8 states and 99 transitions. [2024-06-14 14:38:52,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 85 transitions, 754 flow [2024-06-14 14:38:52,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 85 transitions, 692 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-06-14 14:38:52,954 INFO L231 Difference]: Finished difference. Result has 83 places, 68 transitions, 497 flow [2024-06-14 14:38:52,954 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=497, PETRI_PLACES=83, PETRI_TRANSITIONS=68} [2024-06-14 14:38:52,954 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 53 predicate places. [2024-06-14 14:38:52,955 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 68 transitions, 497 flow [2024-06-14 14:38:52,955 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 14:38:52,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:38:52,956 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:38:52,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-14 14:38:52,956 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:38:52,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:38:52,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1431749996, now seen corresponding path program 4 times [2024-06-14 14:38:52,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:38:52,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989922756] [2024-06-14 14:38:52,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:38:52,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:38:52,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:39:00,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:39:00,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:39:00,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989922756] [2024-06-14 14:39:00,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989922756] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:39:00,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:39:00,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:39:00,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127057515] [2024-06-14 14:39:00,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:39:00,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:39:00,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:39:00,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:39:00,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:39:00,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:39:00,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 68 transitions, 497 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 14:39:00,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:39:00,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:39:00,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:39:00,537 INFO L124 PetriNetUnfolderBase]: 237/424 cut-off events. [2024-06-14 14:39:00,538 INFO L125 PetriNetUnfolderBase]: For 5857/5857 co-relation queries the response was YES. [2024-06-14 14:39:00,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2106 conditions, 424 events. 237/424 cut-off events. For 5857/5857 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1566 event pairs, 53 based on Foata normal form. 1/423 useless extension candidates. Maximal degree in co-relation 2065. Up to 403 conditions per place. [2024-06-14 14:39:00,542 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 64 selfloop transitions, 12 changer transitions 0/78 dead transitions. [2024-06-14 14:39:00,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 78 transitions, 689 flow [2024-06-14 14:39:00,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:39:00,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:39:00,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2024-06-14 14:39:00,543 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35080645161290325 [2024-06-14 14:39:00,544 INFO L175 Difference]: Start difference. First operand has 83 places, 68 transitions, 497 flow. Second operand 8 states and 87 transitions. [2024-06-14 14:39:00,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 78 transitions, 689 flow [2024-06-14 14:39:00,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 78 transitions, 651 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-14 14:39:00,550 INFO L231 Difference]: Finished difference. Result has 85 places, 70 transitions, 514 flow [2024-06-14 14:39:00,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=514, PETRI_PLACES=85, PETRI_TRANSITIONS=70} [2024-06-14 14:39:00,551 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 55 predicate places. [2024-06-14 14:39:00,551 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 70 transitions, 514 flow [2024-06-14 14:39:00,551 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 14:39:00,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:39:00,551 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:39:00,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-14 14:39:00,552 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:39:00,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:39:00,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1424392611, now seen corresponding path program 6 times [2024-06-14 14:39:00,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:39:00,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015925028] [2024-06-14 14:39:00,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:39:00,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:39:00,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:39:05,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:39:05,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:39:05,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015925028] [2024-06-14 14:39:05,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015925028] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:39:05,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:39:05,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:39:05,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220213072] [2024-06-14 14:39:05,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:39:05,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:39:05,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:39:05,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:39:05,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:39:05,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:39:05,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 70 transitions, 514 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 14:39:05,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:39:05,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:39:05,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:39:06,345 INFO L124 PetriNetUnfolderBase]: 231/415 cut-off events. [2024-06-14 14:39:06,346 INFO L125 PetriNetUnfolderBase]: For 6132/6132 co-relation queries the response was YES. [2024-06-14 14:39:06,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2022 conditions, 415 events. 231/415 cut-off events. For 6132/6132 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1525 event pairs, 43 based on Foata normal form. 3/416 useless extension candidates. Maximal degree in co-relation 1980. Up to 368 conditions per place. [2024-06-14 14:39:06,349 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 70 selfloop transitions, 12 changer transitions 0/84 dead transitions. [2024-06-14 14:39:06,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 84 transitions, 708 flow [2024-06-14 14:39:06,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:39:06,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:39:06,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2024-06-14 14:39:06,352 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-14 14:39:06,352 INFO L175 Difference]: Start difference. First operand has 85 places, 70 transitions, 514 flow. Second operand 8 states and 93 transitions. [2024-06-14 14:39:06,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 84 transitions, 708 flow [2024-06-14 14:39:06,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 84 transitions, 659 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-14 14:39:06,359 INFO L231 Difference]: Finished difference. Result has 87 places, 70 transitions, 494 flow [2024-06-14 14:39:06,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=494, PETRI_PLACES=87, PETRI_TRANSITIONS=70} [2024-06-14 14:39:06,359 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 57 predicate places. [2024-06-14 14:39:06,359 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 70 transitions, 494 flow [2024-06-14 14:39:06,360 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 14:39:06,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:39:06,360 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:39:06,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-14 14:39:06,360 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:39:06,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:39:06,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1424115564, now seen corresponding path program 1 times [2024-06-14 14:39:06,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:39:06,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077780333] [2024-06-14 14:39:06,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:39:06,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:39:06,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:39:13,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:39:13,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:39:13,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077780333] [2024-06-14 14:39:13,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077780333] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:39:13,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:39:13,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:39:13,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009239927] [2024-06-14 14:39:13,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:39:13,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:39:13,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:39:13,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:39:13,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:39:13,434 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:39:13,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 70 transitions, 494 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:39:13,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:39:13,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:39:13,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:39:13,807 INFO L124 PetriNetUnfolderBase]: 228/410 cut-off events. [2024-06-14 14:39:13,808 INFO L125 PetriNetUnfolderBase]: For 5914/5914 co-relation queries the response was YES. [2024-06-14 14:39:13,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1968 conditions, 410 events. 228/410 cut-off events. For 5914/5914 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1490 event pairs, 42 based on Foata normal form. 2/410 useless extension candidates. Maximal degree in co-relation 1925. Up to 383 conditions per place. [2024-06-14 14:39:13,811 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 69 selfloop transitions, 11 changer transitions 0/82 dead transitions. [2024-06-14 14:39:13,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 82 transitions, 687 flow [2024-06-14 14:39:13,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:39:13,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:39:13,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2024-06-14 14:39:13,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35080645161290325 [2024-06-14 14:39:13,812 INFO L175 Difference]: Start difference. First operand has 87 places, 70 transitions, 494 flow. Second operand 8 states and 87 transitions. [2024-06-14 14:39:13,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 82 transitions, 687 flow [2024-06-14 14:39:13,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 82 transitions, 644 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-14 14:39:13,819 INFO L231 Difference]: Finished difference. Result has 88 places, 72 transitions, 493 flow [2024-06-14 14:39:13,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=493, PETRI_PLACES=88, PETRI_TRANSITIONS=72} [2024-06-14 14:39:13,819 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 58 predicate places. [2024-06-14 14:39:13,820 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 72 transitions, 493 flow [2024-06-14 14:39:13,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:39:13,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:39:13,822 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:39:13,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-14 14:39:13,822 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:39:13,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:39:13,823 INFO L85 PathProgramCache]: Analyzing trace with hash 22577386, now seen corresponding path program 1 times [2024-06-14 14:39:13,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:39:13,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385014886] [2024-06-14 14:39:13,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:39:13,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:39:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:39:20,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:39:20,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:39:20,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385014886] [2024-06-14 14:39:20,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385014886] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:39:20,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:39:20,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:39:20,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909967001] [2024-06-14 14:39:20,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:39:20,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:39:20,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:39:20,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:39:20,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:39:20,333 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:39:20,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 72 transitions, 493 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:39:20,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:39:20,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:39:20,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:39:20,792 INFO L124 PetriNetUnfolderBase]: 239/431 cut-off events. [2024-06-14 14:39:20,793 INFO L125 PetriNetUnfolderBase]: For 7157/7157 co-relation queries the response was YES. [2024-06-14 14:39:20,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2152 conditions, 431 events. 239/431 cut-off events. For 7157/7157 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1623 event pairs, 28 based on Foata normal form. 2/431 useless extension candidates. Maximal degree in co-relation 2107. Up to 346 conditions per place. [2024-06-14 14:39:20,796 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 71 selfloop transitions, 19 changer transitions 0/92 dead transitions. [2024-06-14 14:39:20,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 92 transitions, 793 flow [2024-06-14 14:39:20,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:39:20,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:39:20,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-14 14:39:20,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37992831541218636 [2024-06-14 14:39:20,798 INFO L175 Difference]: Start difference. First operand has 88 places, 72 transitions, 493 flow. Second operand 9 states and 106 transitions. [2024-06-14 14:39:20,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 92 transitions, 793 flow [2024-06-14 14:39:20,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 92 transitions, 769 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-14 14:39:20,807 INFO L231 Difference]: Finished difference. Result has 92 places, 74 transitions, 545 flow [2024-06-14 14:39:20,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=545, PETRI_PLACES=92, PETRI_TRANSITIONS=74} [2024-06-14 14:39:20,807 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 62 predicate places. [2024-06-14 14:39:20,807 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 74 transitions, 545 flow [2024-06-14 14:39:20,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:39:20,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:39:20,808 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:39:20,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-14 14:39:20,808 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:39:20,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:39:20,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1093955614, now seen corresponding path program 1 times [2024-06-14 14:39:20,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:39:20,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072127784] [2024-06-14 14:39:20,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:39:20,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:39:20,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:39:26,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:39:26,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:39:26,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072127784] [2024-06-14 14:39:26,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072127784] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:39:26,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:39:26,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:39:26,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798534543] [2024-06-14 14:39:26,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:39:26,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:39:26,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:39:26,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:39:26,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:39:27,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:39:27,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 74 transitions, 545 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:39:27,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:39:27,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:39:27,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:39:27,565 INFO L124 PetriNetUnfolderBase]: 247/444 cut-off events. [2024-06-14 14:39:27,565 INFO L125 PetriNetUnfolderBase]: For 7775/7775 co-relation queries the response was YES. [2024-06-14 14:39:27,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2279 conditions, 444 events. 247/444 cut-off events. For 7775/7775 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1696 event pairs, 40 based on Foata normal form. 1/443 useless extension candidates. Maximal degree in co-relation 2233. Up to 381 conditions per place. [2024-06-14 14:39:27,570 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 74 selfloop transitions, 21 changer transitions 0/97 dead transitions. [2024-06-14 14:39:27,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 97 transitions, 866 flow [2024-06-14 14:39:27,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:39:27,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:39:27,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2024-06-14 14:39:27,573 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-14 14:39:27,573 INFO L175 Difference]: Start difference. First operand has 92 places, 74 transitions, 545 flow. Second operand 9 states and 108 transitions. [2024-06-14 14:39:27,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 97 transitions, 866 flow [2024-06-14 14:39:27,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 97 transitions, 824 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-14 14:39:27,586 INFO L231 Difference]: Finished difference. Result has 97 places, 81 transitions, 610 flow [2024-06-14 14:39:27,586 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=610, PETRI_PLACES=97, PETRI_TRANSITIONS=81} [2024-06-14 14:39:27,587 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 67 predicate places. [2024-06-14 14:39:27,587 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 81 transitions, 610 flow [2024-06-14 14:39:27,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:39:27,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:39:27,588 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:39:27,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-14 14:39:27,588 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:39:27,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:39:27,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1660157078, now seen corresponding path program 2 times [2024-06-14 14:39:27,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:39:27,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285285035] [2024-06-14 14:39:27,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:39:27,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:39:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:39:34,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:39:34,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:39:34,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285285035] [2024-06-14 14:39:34,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285285035] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:39:34,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:39:34,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:39:34,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853718473] [2024-06-14 14:39:34,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:39:34,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:39:34,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:39:34,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:39:34,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:39:34,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:39:34,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 81 transitions, 610 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:39:34,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:39:34,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:39:34,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:39:35,195 INFO L124 PetriNetUnfolderBase]: 251/452 cut-off events. [2024-06-14 14:39:35,195 INFO L125 PetriNetUnfolderBase]: For 8861/8861 co-relation queries the response was YES. [2024-06-14 14:39:35,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2393 conditions, 452 events. 251/452 cut-off events. For 8861/8861 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1752 event pairs, 42 based on Foata normal form. 2/452 useless extension candidates. Maximal degree in co-relation 2344. Up to 398 conditions per place. [2024-06-14 14:39:35,198 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 78 selfloop transitions, 18 changer transitions 0/98 dead transitions. [2024-06-14 14:39:35,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 98 transitions, 852 flow [2024-06-14 14:39:35,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:39:35,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:39:35,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2024-06-14 14:39:35,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3763440860215054 [2024-06-14 14:39:35,202 INFO L175 Difference]: Start difference. First operand has 97 places, 81 transitions, 610 flow. Second operand 9 states and 105 transitions. [2024-06-14 14:39:35,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 98 transitions, 852 flow [2024-06-14 14:39:35,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 98 transitions, 826 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-14 14:39:35,235 INFO L231 Difference]: Finished difference. Result has 102 places, 82 transitions, 638 flow [2024-06-14 14:39:35,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=638, PETRI_PLACES=102, PETRI_TRANSITIONS=82} [2024-06-14 14:39:35,240 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 72 predicate places. [2024-06-14 14:39:35,240 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 82 transitions, 638 flow [2024-06-14 14:39:35,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:39:35,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:39:35,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:39:35,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-14 14:39:35,241 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:39:35,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:39:35,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1662953588, now seen corresponding path program 3 times [2024-06-14 14:39:35,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:39:35,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689738519] [2024-06-14 14:39:35,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:39:35,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:39:35,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:39:41,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:39:41,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:39:41,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689738519] [2024-06-14 14:39:41,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689738519] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:39:41,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:39:41,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:39:41,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570786395] [2024-06-14 14:39:41,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:39:41,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:39:41,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:39:41,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:39:41,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:39:41,543 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:39:41,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 82 transitions, 638 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:39:41,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:39:41,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:39:41,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:39:41,889 INFO L124 PetriNetUnfolderBase]: 248/447 cut-off events. [2024-06-14 14:39:41,890 INFO L125 PetriNetUnfolderBase]: For 8863/8863 co-relation queries the response was YES. [2024-06-14 14:39:41,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2374 conditions, 447 events. 248/447 cut-off events. For 8863/8863 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1731 event pairs, 39 based on Foata normal form. 2/447 useless extension candidates. Maximal degree in co-relation 2323. Up to 405 conditions per place. [2024-06-14 14:39:41,893 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 78 selfloop transitions, 14 changer transitions 0/94 dead transitions. [2024-06-14 14:39:41,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 94 transitions, 850 flow [2024-06-14 14:39:41,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:39:41,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:39:41,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2024-06-14 14:39:41,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3709677419354839 [2024-06-14 14:39:41,896 INFO L175 Difference]: Start difference. First operand has 102 places, 82 transitions, 638 flow. Second operand 8 states and 92 transitions. [2024-06-14 14:39:41,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 94 transitions, 850 flow [2024-06-14 14:39:41,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 94 transitions, 800 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-14 14:39:41,907 INFO L231 Difference]: Finished difference. Result has 103 places, 82 transitions, 620 flow [2024-06-14 14:39:41,907 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=620, PETRI_PLACES=103, PETRI_TRANSITIONS=82} [2024-06-14 14:39:41,908 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 73 predicate places. [2024-06-14 14:39:41,908 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 82 transitions, 620 flow [2024-06-14 14:39:41,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:39:41,908 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:39:41,908 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:39:41,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-14 14:39:41,909 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:39:41,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:39:41,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1773776232, now seen corresponding path program 2 times [2024-06-14 14:39:41,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:39:41,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505084327] [2024-06-14 14:39:41,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:39:41,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:39:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:39:47,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:39:47,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:39:47,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505084327] [2024-06-14 14:39:47,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505084327] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:39:47,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:39:47,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:39:47,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362945791] [2024-06-14 14:39:47,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:39:47,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:39:47,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:39:47,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:39:47,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:39:47,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:39:47,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 82 transitions, 620 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:39:47,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:39:47,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:39:47,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:39:48,170 INFO L124 PetriNetUnfolderBase]: 251/452 cut-off events. [2024-06-14 14:39:48,171 INFO L125 PetriNetUnfolderBase]: For 9016/9016 co-relation queries the response was YES. [2024-06-14 14:39:48,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2382 conditions, 452 events. 251/452 cut-off events. For 9016/9016 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1750 event pairs, 39 based on Foata normal form. 1/451 useless extension candidates. Maximal degree in co-relation 2330. Up to 403 conditions per place. [2024-06-14 14:39:48,174 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 76 selfloop transitions, 18 changer transitions 0/96 dead transitions. [2024-06-14 14:39:48,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 96 transitions, 906 flow [2024-06-14 14:39:48,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:39:48,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:39:48,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2024-06-14 14:39:48,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38306451612903225 [2024-06-14 14:39:48,177 INFO L175 Difference]: Start difference. First operand has 103 places, 82 transitions, 620 flow. Second operand 8 states and 95 transitions. [2024-06-14 14:39:48,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 96 transitions, 906 flow [2024-06-14 14:39:48,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 96 transitions, 872 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-14 14:39:48,186 INFO L231 Difference]: Finished difference. Result has 104 places, 84 transitions, 643 flow [2024-06-14 14:39:48,187 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=643, PETRI_PLACES=104, PETRI_TRANSITIONS=84} [2024-06-14 14:39:48,187 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 74 predicate places. [2024-06-14 14:39:48,187 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 84 transitions, 643 flow [2024-06-14 14:39:48,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:39:48,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:39:48,188 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:39:48,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-14 14:39:48,188 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:39:48,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:39:48,188 INFO L85 PathProgramCache]: Analyzing trace with hash 25439120, now seen corresponding path program 3 times [2024-06-14 14:39:48,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:39:48,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452431317] [2024-06-14 14:39:48,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:39:48,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:39:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:39:54,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:39:54,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:39:54,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452431317] [2024-06-14 14:39:54,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452431317] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:39:54,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:39:54,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:39:54,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945510469] [2024-06-14 14:39:54,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:39:54,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:39:54,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:39:54,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:39:54,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:39:54,573 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:39:54,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 84 transitions, 643 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:39:54,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:39:54,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:39:54,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:39:54,979 INFO L124 PetriNetUnfolderBase]: 255/459 cut-off events. [2024-06-14 14:39:54,979 INFO L125 PetriNetUnfolderBase]: For 10061/10061 co-relation queries the response was YES. [2024-06-14 14:39:54,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2414 conditions, 459 events. 255/459 cut-off events. For 10061/10061 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1789 event pairs, 39 based on Foata normal form. 3/460 useless extension candidates. Maximal degree in co-relation 2361. Up to 397 conditions per place. [2024-06-14 14:39:54,988 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 76 selfloop transitions, 21 changer transitions 0/99 dead transitions. [2024-06-14 14:39:54,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 99 transitions, 889 flow [2024-06-14 14:39:54,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:39:54,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:39:54,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2024-06-14 14:39:54,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3911290322580645 [2024-06-14 14:39:54,989 INFO L175 Difference]: Start difference. First operand has 104 places, 84 transitions, 643 flow. Second operand 8 states and 97 transitions. [2024-06-14 14:39:54,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 99 transitions, 889 flow [2024-06-14 14:39:54,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 99 transitions, 838 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-14 14:39:55,000 INFO L231 Difference]: Finished difference. Result has 106 places, 86 transitions, 668 flow [2024-06-14 14:39:55,000 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=668, PETRI_PLACES=106, PETRI_TRANSITIONS=86} [2024-06-14 14:39:55,001 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 76 predicate places. [2024-06-14 14:39:55,001 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 86 transitions, 668 flow [2024-06-14 14:39:55,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:39:55,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:39:55,001 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:39:55,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-14 14:39:55,002 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:39:55,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:39:55,002 INFO L85 PathProgramCache]: Analyzing trace with hash 140903270, now seen corresponding path program 4 times [2024-06-14 14:39:55,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:39:55,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69121524] [2024-06-14 14:39:55,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:39:55,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:39:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:40:02,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:40:02,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:40:02,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69121524] [2024-06-14 14:40:02,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69121524] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:40:02,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:40:02,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:40:02,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826647932] [2024-06-14 14:40:02,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:40:02,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:40:02,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:40:02,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:40:02,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:40:02,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:40:02,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 86 transitions, 668 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:40:02,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:40:02,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:40:02,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:40:02,660 INFO L124 PetriNetUnfolderBase]: 264/474 cut-off events. [2024-06-14 14:40:02,660 INFO L125 PetriNetUnfolderBase]: For 10861/10861 co-relation queries the response was YES. [2024-06-14 14:40:02,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2543 conditions, 474 events. 264/474 cut-off events. For 10861/10861 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1864 event pairs, 43 based on Foata normal form. 3/475 useless extension candidates. Maximal degree in co-relation 2489. Up to 312 conditions per place. [2024-06-14 14:40:02,664 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 70 selfloop transitions, 37 changer transitions 0/109 dead transitions. [2024-06-14 14:40:02,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 109 transitions, 970 flow [2024-06-14 14:40:02,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:40:02,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:40:02,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-14 14:40:02,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4157706093189964 [2024-06-14 14:40:02,666 INFO L175 Difference]: Start difference. First operand has 106 places, 86 transitions, 668 flow. Second operand 9 states and 116 transitions. [2024-06-14 14:40:02,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 109 transitions, 970 flow [2024-06-14 14:40:02,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 109 transitions, 916 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-14 14:40:02,681 INFO L231 Difference]: Finished difference. Result has 109 places, 89 transitions, 732 flow [2024-06-14 14:40:02,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=732, PETRI_PLACES=109, PETRI_TRANSITIONS=89} [2024-06-14 14:40:02,682 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 79 predicate places. [2024-06-14 14:40:02,682 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 89 transitions, 732 flow [2024-06-14 14:40:02,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:40:02,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:40:02,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:40:02,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-14 14:40:02,683 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:40:02,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:40:02,683 INFO L85 PathProgramCache]: Analyzing trace with hash 140725640, now seen corresponding path program 5 times [2024-06-14 14:40:02,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:40:02,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608910820] [2024-06-14 14:40:02,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:40:02,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:40:02,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:40:09,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:40:09,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:40:09,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608910820] [2024-06-14 14:40:09,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608910820] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:40:09,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:40:09,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:40:09,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800027457] [2024-06-14 14:40:09,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:40:09,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:40:09,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:40:09,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:40:09,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:40:09,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:40:09,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 89 transitions, 732 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:40:09,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:40:09,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:40:09,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:40:09,903 INFO L124 PetriNetUnfolderBase]: 282/503 cut-off events. [2024-06-14 14:40:09,903 INFO L125 PetriNetUnfolderBase]: For 12247/12247 co-relation queries the response was YES. [2024-06-14 14:40:09,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2916 conditions, 503 events. 282/503 cut-off events. For 12247/12247 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2007 event pairs, 43 based on Foata normal form. 1/502 useless extension candidates. Maximal degree in co-relation 2861. Up to 320 conditions per place. [2024-06-14 14:40:09,908 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 70 selfloop transitions, 42 changer transitions 0/114 dead transitions. [2024-06-14 14:40:09,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 114 transitions, 1134 flow [2024-06-14 14:40:09,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:40:09,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:40:09,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-14 14:40:09,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4265232974910394 [2024-06-14 14:40:09,910 INFO L175 Difference]: Start difference. First operand has 109 places, 89 transitions, 732 flow. Second operand 9 states and 119 transitions. [2024-06-14 14:40:09,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 114 transitions, 1134 flow [2024-06-14 14:40:09,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 114 transitions, 1038 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-14 14:40:09,930 INFO L231 Difference]: Finished difference. Result has 112 places, 94 transitions, 806 flow [2024-06-14 14:40:09,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=806, PETRI_PLACES=112, PETRI_TRANSITIONS=94} [2024-06-14 14:40:09,931 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 82 predicate places. [2024-06-14 14:40:09,931 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 94 transitions, 806 flow [2024-06-14 14:40:09,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:40:09,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:40:09,932 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:40:09,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-14 14:40:09,932 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:40:09,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:40:09,933 INFO L85 PathProgramCache]: Analyzing trace with hash 140725516, now seen corresponding path program 4 times [2024-06-14 14:40:09,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:40:09,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874773542] [2024-06-14 14:40:09,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:40:09,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:40:09,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:40:16,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:40:16,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:40:16,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874773542] [2024-06-14 14:40:16,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874773542] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:40:16,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:40:16,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:40:16,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891772440] [2024-06-14 14:40:16,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:40:16,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:40:16,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:40:16,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:40:16,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:40:16,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:40:16,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 94 transitions, 806 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:40:16,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:40:16,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:40:16,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:40:17,289 INFO L124 PetriNetUnfolderBase]: 286/511 cut-off events. [2024-06-14 14:40:17,289 INFO L125 PetriNetUnfolderBase]: For 13757/13757 co-relation queries the response was YES. [2024-06-14 14:40:17,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3068 conditions, 511 events. 286/511 cut-off events. For 13757/13757 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2042 event pairs, 49 based on Foata normal form. 2/511 useless extension candidates. Maximal degree in co-relation 3011. Up to 457 conditions per place. [2024-06-14 14:40:17,292 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 86 selfloop transitions, 20 changer transitions 0/108 dead transitions. [2024-06-14 14:40:17,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 108 transitions, 1066 flow [2024-06-14 14:40:17,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:40:17,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:40:17,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions. [2024-06-14 14:40:17,295 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36917562724014336 [2024-06-14 14:40:17,295 INFO L175 Difference]: Start difference. First operand has 112 places, 94 transitions, 806 flow. Second operand 9 states and 103 transitions. [2024-06-14 14:40:17,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 108 transitions, 1066 flow [2024-06-14 14:40:17,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 108 transitions, 992 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-06-14 14:40:17,311 INFO L231 Difference]: Finished difference. Result has 116 places, 95 transitions, 796 flow [2024-06-14 14:40:17,311 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=796, PETRI_PLACES=116, PETRI_TRANSITIONS=95} [2024-06-14 14:40:17,312 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 86 predicate places. [2024-06-14 14:40:17,312 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 95 transitions, 796 flow [2024-06-14 14:40:17,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:40:17,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:40:17,312 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:40:17,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-14 14:40:17,312 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:40:17,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:40:17,313 INFO L85 PathProgramCache]: Analyzing trace with hash 140730290, now seen corresponding path program 6 times [2024-06-14 14:40:17,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:40:17,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035051262] [2024-06-14 14:40:17,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:40:17,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:40:17,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:40:24,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:40:24,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:40:24,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035051262] [2024-06-14 14:40:24,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035051262] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:40:24,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:40:24,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:40:24,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424014461] [2024-06-14 14:40:24,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:40:24,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:40:24,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:40:24,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:40:24,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:40:24,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:40:24,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 95 transitions, 796 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:40:24,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:40:24,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:40:24,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:40:25,037 INFO L124 PetriNetUnfolderBase]: 280/502 cut-off events. [2024-06-14 14:40:25,037 INFO L125 PetriNetUnfolderBase]: For 13336/13336 co-relation queries the response was YES. [2024-06-14 14:40:25,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2929 conditions, 502 events. 280/502 cut-off events. For 13336/13336 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2033 event pairs, 43 based on Foata normal form. 3/503 useless extension candidates. Maximal degree in co-relation 2870. Up to 340 conditions per place. [2024-06-14 14:40:25,041 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 78 selfloop transitions, 36 changer transitions 0/116 dead transitions. [2024-06-14 14:40:25,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 116 transitions, 1100 flow [2024-06-14 14:40:25,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:40:25,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:40:25,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-14 14:40:25,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4265232974910394 [2024-06-14 14:40:25,043 INFO L175 Difference]: Start difference. First operand has 116 places, 95 transitions, 796 flow. Second operand 9 states and 119 transitions. [2024-06-14 14:40:25,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 116 transitions, 1100 flow [2024-06-14 14:40:25,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 116 transitions, 1034 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-14 14:40:25,062 INFO L231 Difference]: Finished difference. Result has 118 places, 95 transitions, 808 flow [2024-06-14 14:40:25,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=808, PETRI_PLACES=118, PETRI_TRANSITIONS=95} [2024-06-14 14:40:25,062 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 88 predicate places. [2024-06-14 14:40:25,063 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 95 transitions, 808 flow [2024-06-14 14:40:25,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:40:25,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:40:25,063 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:40:25,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-14 14:40:25,063 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:40:25,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:40:25,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1423466044, now seen corresponding path program 7 times [2024-06-14 14:40:25,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:40:25,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656017359] [2024-06-14 14:40:25,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:40:25,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:40:25,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:40:31,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:40:31,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:40:31,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656017359] [2024-06-14 14:40:31,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656017359] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:40:31,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:40:31,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:40:31,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870192216] [2024-06-14 14:40:31,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:40:31,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:40:31,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:40:31,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:40:31,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:40:31,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:40:31,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 95 transitions, 808 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:40:31,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:40:31,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:40:31,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:40:31,899 INFO L124 PetriNetUnfolderBase]: 295/527 cut-off events. [2024-06-14 14:40:31,899 INFO L125 PetriNetUnfolderBase]: For 13046/13046 co-relation queries the response was YES. [2024-06-14 14:40:31,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3089 conditions, 527 events. 295/527 cut-off events. For 13046/13046 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2146 event pairs, 39 based on Foata normal form. 1/526 useless extension candidates. Maximal degree in co-relation 3029. Up to 466 conditions per place. [2024-06-14 14:40:31,903 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 94 selfloop transitions, 22 changer transitions 0/118 dead transitions. [2024-06-14 14:40:31,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 118 transitions, 1185 flow [2024-06-14 14:40:31,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:40:31,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:40:31,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2024-06-14 14:40:31,904 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3727598566308244 [2024-06-14 14:40:31,904 INFO L175 Difference]: Start difference. First operand has 118 places, 95 transitions, 808 flow. Second operand 9 states and 104 transitions. [2024-06-14 14:40:31,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 118 transitions, 1185 flow [2024-06-14 14:40:31,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 118 transitions, 1088 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-14 14:40:31,923 INFO L231 Difference]: Finished difference. Result has 122 places, 106 transitions, 908 flow [2024-06-14 14:40:31,923 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=721, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=908, PETRI_PLACES=122, PETRI_TRANSITIONS=106} [2024-06-14 14:40:31,923 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 92 predicate places. [2024-06-14 14:40:31,923 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 106 transitions, 908 flow [2024-06-14 14:40:31,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:40:31,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:40:31,924 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:40:31,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-14 14:40:31,924 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:40:31,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:40:31,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1206496700, now seen corresponding path program 8 times [2024-06-14 14:40:31,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:40:31,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890073546] [2024-06-14 14:40:31,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:40:31,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:40:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:40:38,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:40:38,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:40:38,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890073546] [2024-06-14 14:40:38,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890073546] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:40:38,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:40:38,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:40:38,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696424128] [2024-06-14 14:40:38,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:40:38,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:40:38,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:40:38,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:40:38,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:40:38,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:40:38,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 106 transitions, 908 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:40:38,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:40:38,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:40:38,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:40:38,744 INFO L124 PetriNetUnfolderBase]: 304/542 cut-off events. [2024-06-14 14:40:38,744 INFO L125 PetriNetUnfolderBase]: For 15223/15223 co-relation queries the response was YES. [2024-06-14 14:40:38,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3225 conditions, 542 events. 304/542 cut-off events. For 15223/15223 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2216 event pairs, 41 based on Foata normal form. 3/543 useless extension candidates. Maximal degree in co-relation 3161. Up to 468 conditions per place. [2024-06-14 14:40:38,747 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 102 selfloop transitions, 19 changer transitions 0/123 dead transitions. [2024-06-14 14:40:38,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 123 transitions, 1243 flow [2024-06-14 14:40:38,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:40:38,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:40:38,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2024-06-14 14:40:38,749 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3727598566308244 [2024-06-14 14:40:38,749 INFO L175 Difference]: Start difference. First operand has 122 places, 106 transitions, 908 flow. Second operand 9 states and 104 transitions. [2024-06-14 14:40:38,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 123 transitions, 1243 flow [2024-06-14 14:40:38,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 123 transitions, 1160 flow, removed 35 selfloop flow, removed 4 redundant places. [2024-06-14 14:40:38,771 INFO L231 Difference]: Finished difference. Result has 127 places, 109 transitions, 936 flow [2024-06-14 14:40:38,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=837, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=936, PETRI_PLACES=127, PETRI_TRANSITIONS=109} [2024-06-14 14:40:38,772 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 97 predicate places. [2024-06-14 14:40:38,772 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 109 transitions, 936 flow [2024-06-14 14:40:38,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:40:38,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:40:38,772 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:40:38,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-14 14:40:38,773 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:40:38,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:40:38,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1943884016, now seen corresponding path program 9 times [2024-06-14 14:40:38,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:40:38,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302845034] [2024-06-14 14:40:38,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:40:38,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:40:38,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:40:44,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:40:44,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:40:44,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302845034] [2024-06-14 14:40:44,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302845034] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:40:44,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:40:44,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:40:44,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349954985] [2024-06-14 14:40:44,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:40:44,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:40:44,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:40:44,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:40:44,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:40:44,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:40:44,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 109 transitions, 936 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:40:44,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:40:44,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:40:44,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:40:45,156 INFO L124 PetriNetUnfolderBase]: 307/547 cut-off events. [2024-06-14 14:40:45,157 INFO L125 PetriNetUnfolderBase]: For 14732/14732 co-relation queries the response was YES. [2024-06-14 14:40:45,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3296 conditions, 547 events. 307/547 cut-off events. For 14732/14732 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2240 event pairs, 47 based on Foata normal form. 1/546 useless extension candidates. Maximal degree in co-relation 3231. Up to 495 conditions per place. [2024-06-14 14:40:45,162 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 97 selfloop transitions, 29 changer transitions 0/128 dead transitions. [2024-06-14 14:40:45,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 128 transitions, 1406 flow [2024-06-14 14:40:45,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:40:45,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:40:45,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2024-06-14 14:40:45,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36200716845878134 [2024-06-14 14:40:45,184 INFO L175 Difference]: Start difference. First operand has 127 places, 109 transitions, 936 flow. Second operand 9 states and 101 transitions. [2024-06-14 14:40:45,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 128 transitions, 1406 flow [2024-06-14 14:40:45,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 128 transitions, 1309 flow, removed 30 selfloop flow, removed 7 redundant places. [2024-06-14 14:40:45,227 INFO L231 Difference]: Finished difference. Result has 132 places, 118 transitions, 1067 flow [2024-06-14 14:40:45,227 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=861, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1067, PETRI_PLACES=132, PETRI_TRANSITIONS=118} [2024-06-14 14:40:45,227 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 102 predicate places. [2024-06-14 14:40:45,228 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 118 transitions, 1067 flow [2024-06-14 14:40:45,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:40:45,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:40:45,228 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:40:45,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-14 14:40:45,229 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:40:45,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:40:45,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1943883892, now seen corresponding path program 5 times [2024-06-14 14:40:45,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:40:45,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691758565] [2024-06-14 14:40:45,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:40:45,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:40:45,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:40:51,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:40:51,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:40:51,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691758565] [2024-06-14 14:40:51,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691758565] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:40:51,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:40:51,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:40:51,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133842842] [2024-06-14 14:40:51,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:40:51,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:40:51,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:40:51,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:40:51,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:40:51,620 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:40:51,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 118 transitions, 1067 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:40:51,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:40:51,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:40:51,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:40:51,951 INFO L124 PetriNetUnfolderBase]: 304/542 cut-off events. [2024-06-14 14:40:51,951 INFO L125 PetriNetUnfolderBase]: For 14808/14808 co-relation queries the response was YES. [2024-06-14 14:40:51,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3239 conditions, 542 events. 304/542 cut-off events. For 14808/14808 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2218 event pairs, 46 based on Foata normal form. 2/542 useless extension candidates. Maximal degree in co-relation 3170. Up to 515 conditions per place. [2024-06-14 14:40:51,955 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 113 selfloop transitions, 13 changer transitions 0/128 dead transitions. [2024-06-14 14:40:51,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 128 transitions, 1341 flow [2024-06-14 14:40:51,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:40:51,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:40:51,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2024-06-14 14:40:51,956 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34408602150537637 [2024-06-14 14:40:51,957 INFO L175 Difference]: Start difference. First operand has 132 places, 118 transitions, 1067 flow. Second operand 9 states and 96 transitions. [2024-06-14 14:40:51,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 128 transitions, 1341 flow [2024-06-14 14:40:51,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 128 transitions, 1290 flow, removed 21 selfloop flow, removed 3 redundant places. [2024-06-14 14:40:51,990 INFO L231 Difference]: Finished difference. Result has 138 places, 118 transitions, 1046 flow [2024-06-14 14:40:51,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1016, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1046, PETRI_PLACES=138, PETRI_TRANSITIONS=118} [2024-06-14 14:40:51,990 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 108 predicate places. [2024-06-14 14:40:51,991 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 118 transitions, 1046 flow [2024-06-14 14:40:51,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:40:51,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:40:51,991 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:40:51,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-14 14:40:51,991 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:40:51,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:40:51,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1943888666, now seen corresponding path program 10 times [2024-06-14 14:40:51,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:40:51,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228931575] [2024-06-14 14:40:51,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:40:51,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:40:52,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:40:57,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:40:57,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:40:57,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228931575] [2024-06-14 14:40:57,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228931575] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:40:57,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:40:57,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:40:57,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951302741] [2024-06-14 14:40:57,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:40:57,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:40:57,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:40:57,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:40:57,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:40:57,895 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:40:57,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 118 transitions, 1046 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:40:57,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:40:57,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:40:57,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:40:58,194 INFO L124 PetriNetUnfolderBase]: 308/549 cut-off events. [2024-06-14 14:40:58,195 INFO L125 PetriNetUnfolderBase]: For 15586/15586 co-relation queries the response was YES. [2024-06-14 14:40:58,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3264 conditions, 549 events. 308/549 cut-off events. For 15586/15586 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2264 event pairs, 42 based on Foata normal form. 3/550 useless extension candidates. Maximal degree in co-relation 3193. Up to 464 conditions per place. [2024-06-14 14:40:58,199 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 103 selfloop transitions, 29 changer transitions 0/134 dead transitions. [2024-06-14 14:40:58,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 134 transitions, 1389 flow [2024-06-14 14:40:58,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:40:58,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:40:58,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-14 14:40:58,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835125448028674 [2024-06-14 14:40:58,201 INFO L175 Difference]: Start difference. First operand has 138 places, 118 transitions, 1046 flow. Second operand 9 states and 107 transitions. [2024-06-14 14:40:58,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 134 transitions, 1389 flow [2024-06-14 14:40:58,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 134 transitions, 1305 flow, removed 15 selfloop flow, removed 9 redundant places. [2024-06-14 14:40:58,230 INFO L231 Difference]: Finished difference. Result has 139 places, 121 transitions, 1094 flow [2024-06-14 14:40:58,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=962, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1094, PETRI_PLACES=139, PETRI_TRANSITIONS=121} [2024-06-14 14:40:58,231 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 109 predicate places. [2024-06-14 14:40:58,231 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 121 transitions, 1094 flow [2024-06-14 14:40:58,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:40:58,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:40:58,232 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:40:58,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-14 14:40:58,232 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:40:58,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:40:58,232 INFO L85 PathProgramCache]: Analyzing trace with hash 699900402, now seen corresponding path program 1 times [2024-06-14 14:40:58,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:40:58,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410746094] [2024-06-14 14:40:58,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:40:58,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:40:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:41:05,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:41:05,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:41:05,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410746094] [2024-06-14 14:41:05,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410746094] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:41:05,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:41:05,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:41:05,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089124809] [2024-06-14 14:41:05,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:41:05,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:41:05,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:41:05,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:41:05,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:41:05,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:41:05,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 121 transitions, 1094 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:41:05,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:41:05,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:41:05,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:41:05,955 INFO L124 PetriNetUnfolderBase]: 319/570 cut-off events. [2024-06-14 14:41:05,955 INFO L125 PetriNetUnfolderBase]: For 17251/17251 co-relation queries the response was YES. [2024-06-14 14:41:05,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3484 conditions, 570 events. 319/570 cut-off events. For 17251/17251 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2411 event pairs, 31 based on Foata normal form. 2/570 useless extension candidates. Maximal degree in co-relation 3412. Up to 440 conditions per place. [2024-06-14 14:41:05,959 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 116 selfloop transitions, 25 changer transitions 0/143 dead transitions. [2024-06-14 14:41:05,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 143 transitions, 1530 flow [2024-06-14 14:41:05,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:41:05,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:41:05,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-14 14:41:05,991 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38064516129032255 [2024-06-14 14:41:05,991 INFO L175 Difference]: Start difference. First operand has 139 places, 121 transitions, 1094 flow. Second operand 10 states and 118 transitions. [2024-06-14 14:41:05,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 143 transitions, 1530 flow [2024-06-14 14:41:06,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 143 transitions, 1427 flow, removed 26 selfloop flow, removed 7 redundant places. [2024-06-14 14:41:06,024 INFO L231 Difference]: Finished difference. Result has 142 places, 123 transitions, 1079 flow [2024-06-14 14:41:06,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=991, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1079, PETRI_PLACES=142, PETRI_TRANSITIONS=123} [2024-06-14 14:41:06,025 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 112 predicate places. [2024-06-14 14:41:06,025 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 123 transitions, 1079 flow [2024-06-14 14:41:06,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:41:06,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:41:06,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:41:06,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-14 14:41:06,026 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:41:06,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:41:06,026 INFO L85 PathProgramCache]: Analyzing trace with hash -74732978, now seen corresponding path program 2 times [2024-06-14 14:41:06,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:41:06,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844086919] [2024-06-14 14:41:06,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:41:06,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:41:06,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:41:13,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:41:13,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:41:13,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844086919] [2024-06-14 14:41:13,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844086919] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:41:13,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:41:13,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:41:13,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424589665] [2024-06-14 14:41:13,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:41:13,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:41:13,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:41:13,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:41:13,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:41:13,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:41:13,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 123 transitions, 1079 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:41:13,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:41:13,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:41:13,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:41:13,810 INFO L124 PetriNetUnfolderBase]: 323/578 cut-off events. [2024-06-14 14:41:13,810 INFO L125 PetriNetUnfolderBase]: For 17823/17823 co-relation queries the response was YES. [2024-06-14 14:41:13,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3455 conditions, 578 events. 323/578 cut-off events. For 17823/17823 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2460 event pairs, 45 based on Foata normal form. 2/578 useless extension candidates. Maximal degree in co-relation 3384. Up to 489 conditions per place. [2024-06-14 14:41:13,815 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 112 selfloop transitions, 29 changer transitions 0/143 dead transitions. [2024-06-14 14:41:13,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 143 transitions, 1423 flow [2024-06-14 14:41:13,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:41:13,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:41:13,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-14 14:41:13,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-14 14:41:13,816 INFO L175 Difference]: Start difference. First operand has 142 places, 123 transitions, 1079 flow. Second operand 10 states and 120 transitions. [2024-06-14 14:41:13,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 143 transitions, 1423 flow [2024-06-14 14:41:13,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 143 transitions, 1363 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-06-14 14:41:13,848 INFO L231 Difference]: Finished difference. Result has 146 places, 124 transitions, 1101 flow [2024-06-14 14:41:13,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1027, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1101, PETRI_PLACES=146, PETRI_TRANSITIONS=124} [2024-06-14 14:41:13,848 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 116 predicate places. [2024-06-14 14:41:13,848 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 124 transitions, 1101 flow [2024-06-14 14:41:13,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:41:13,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:41:13,849 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:41:13,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-14 14:41:13,849 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:41:13,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:41:13,849 INFO L85 PathProgramCache]: Analyzing trace with hash 701774352, now seen corresponding path program 3 times [2024-06-14 14:41:13,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:41:13,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836168814] [2024-06-14 14:41:13,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:41:13,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:41:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:41:20,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:41:20,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:41:20,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836168814] [2024-06-14 14:41:20,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836168814] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:41:20,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:41:20,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:41:20,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879336554] [2024-06-14 14:41:20,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:41:20,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:41:20,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:41:20,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:41:20,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:41:21,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:41:21,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 124 transitions, 1101 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:41:21,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:41:21,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:41:21,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:41:21,455 INFO L124 PetriNetUnfolderBase]: 327/586 cut-off events. [2024-06-14 14:41:21,456 INFO L125 PetriNetUnfolderBase]: For 18738/18738 co-relation queries the response was YES. [2024-06-14 14:41:21,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3504 conditions, 586 events. 327/586 cut-off events. For 18738/18738 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2523 event pairs, 43 based on Foata normal form. 2/586 useless extension candidates. Maximal degree in co-relation 3431. Up to 483 conditions per place. [2024-06-14 14:41:21,460 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 113 selfloop transitions, 30 changer transitions 0/145 dead transitions. [2024-06-14 14:41:21,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 145 transitions, 1445 flow [2024-06-14 14:41:21,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:41:21,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:41:21,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-14 14:41:21,461 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3935483870967742 [2024-06-14 14:41:21,461 INFO L175 Difference]: Start difference. First operand has 146 places, 124 transitions, 1101 flow. Second operand 10 states and 122 transitions. [2024-06-14 14:41:21,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 145 transitions, 1445 flow [2024-06-14 14:41:21,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 145 transitions, 1383 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-14 14:41:21,498 INFO L231 Difference]: Finished difference. Result has 148 places, 125 transitions, 1117 flow [2024-06-14 14:41:21,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1039, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1117, PETRI_PLACES=148, PETRI_TRANSITIONS=125} [2024-06-14 14:41:21,499 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 118 predicate places. [2024-06-14 14:41:21,499 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 125 transitions, 1117 flow [2024-06-14 14:41:21,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:41:21,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:41:21,499 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:41:21,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-14 14:41:21,500 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:41:21,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:41:21,500 INFO L85 PathProgramCache]: Analyzing trace with hash -74732823, now seen corresponding path program 1 times [2024-06-14 14:41:21,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:41:21,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506051090] [2024-06-14 14:41:21,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:41:21,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:41:21,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:41:28,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:41:28,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:41:28,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506051090] [2024-06-14 14:41:28,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506051090] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:41:28,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:41:28,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:41:28,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995145416] [2024-06-14 14:41:28,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:41:28,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:41:28,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:41:28,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:41:28,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:41:28,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:41:28,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 125 transitions, 1117 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:41:28,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:41:28,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:41:28,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:41:28,966 INFO L124 PetriNetUnfolderBase]: 343/612 cut-off events. [2024-06-14 14:41:28,966 INFO L125 PetriNetUnfolderBase]: For 21871/21871 co-relation queries the response was YES. [2024-06-14 14:41:28,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3820 conditions, 612 events. 343/612 cut-off events. For 21871/21871 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2656 event pairs, 47 based on Foata normal form. 2/612 useless extension candidates. Maximal degree in co-relation 3746. Up to 524 conditions per place. [2024-06-14 14:41:28,970 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 125 selfloop transitions, 27 changer transitions 0/154 dead transitions. [2024-06-14 14:41:28,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 154 transitions, 1653 flow [2024-06-14 14:41:28,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:41:28,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:41:28,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2024-06-14 14:41:28,971 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-14 14:41:28,971 INFO L175 Difference]: Start difference. First operand has 148 places, 125 transitions, 1117 flow. Second operand 11 states and 132 transitions. [2024-06-14 14:41:28,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 154 transitions, 1653 flow [2024-06-14 14:41:29,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 154 transitions, 1587 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-14 14:41:29,015 INFO L231 Difference]: Finished difference. Result has 151 places, 129 transitions, 1202 flow [2024-06-14 14:41:29,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1051, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1202, PETRI_PLACES=151, PETRI_TRANSITIONS=129} [2024-06-14 14:41:29,015 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 121 predicate places. [2024-06-14 14:41:29,015 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 129 transitions, 1202 flow [2024-06-14 14:41:29,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:41:29,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:41:29,016 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:41:29,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-14 14:41:29,016 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:41:29,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:41:29,017 INFO L85 PathProgramCache]: Analyzing trace with hash 12102982, now seen corresponding path program 4 times [2024-06-14 14:41:29,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:41:29,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953502000] [2024-06-14 14:41:29,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:41:29,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:41:29,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:41:35,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:41:35,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:41:35,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953502000] [2024-06-14 14:41:35,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953502000] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:41:35,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:41:35,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:41:35,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489260390] [2024-06-14 14:41:35,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:41:35,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:41:35,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:41:35,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:41:35,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:41:36,122 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:41:36,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 129 transitions, 1202 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:41:36,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:41:36,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:41:36,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:41:36,697 INFO L124 PetriNetUnfolderBase]: 371/672 cut-off events. [2024-06-14 14:41:36,697 INFO L125 PetriNetUnfolderBase]: For 35541/35541 co-relation queries the response was YES. [2024-06-14 14:41:36,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4110 conditions, 672 events. 371/672 cut-off events. For 35541/35541 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3032 event pairs, 49 based on Foata normal form. 16/686 useless extension candidates. Maximal degree in co-relation 4035. Up to 546 conditions per place. [2024-06-14 14:41:36,702 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 121 selfloop transitions, 19 changer transitions 9/151 dead transitions. [2024-06-14 14:41:36,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 151 transitions, 1616 flow [2024-06-14 14:41:36,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:41:36,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:41:36,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2024-06-14 14:41:36,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4014336917562724 [2024-06-14 14:41:36,729 INFO L175 Difference]: Start difference. First operand has 151 places, 129 transitions, 1202 flow. Second operand 9 states and 112 transitions. [2024-06-14 14:41:36,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 151 transitions, 1616 flow [2024-06-14 14:41:36,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 151 transitions, 1547 flow, removed 26 selfloop flow, removed 6 redundant places. [2024-06-14 14:41:36,771 INFO L231 Difference]: Finished difference. Result has 154 places, 127 transitions, 1167 flow [2024-06-14 14:41:36,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1133, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1167, PETRI_PLACES=154, PETRI_TRANSITIONS=127} [2024-06-14 14:41:36,773 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 124 predicate places. [2024-06-14 14:41:36,773 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 127 transitions, 1167 flow [2024-06-14 14:41:36,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:41:36,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:41:36,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:41:36,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-14 14:41:36,774 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:41:36,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:41:36,774 INFO L85 PathProgramCache]: Analyzing trace with hash 788470037, now seen corresponding path program 2 times [2024-06-14 14:41:36,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:41:36,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972761747] [2024-06-14 14:41:36,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:41:36,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:41:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:41:43,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:41:43,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:41:43,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972761747] [2024-06-14 14:41:43,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972761747] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:41:43,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:41:43,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:41:43,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109592431] [2024-06-14 14:41:43,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:41:43,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:41:43,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:41:43,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:41:43,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:41:43,216 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:41:43,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 127 transitions, 1167 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:41:43,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:41:43,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:41:43,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:41:43,745 INFO L124 PetriNetUnfolderBase]: 345/622 cut-off events. [2024-06-14 14:41:43,745 INFO L125 PetriNetUnfolderBase]: For 24184/24184 co-relation queries the response was YES. [2024-06-14 14:41:43,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3903 conditions, 622 events. 345/622 cut-off events. For 24184/24184 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2759 event pairs, 47 based on Foata normal form. 2/622 useless extension candidates. Maximal degree in co-relation 3826. Up to 559 conditions per place. [2024-06-14 14:41:43,750 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 127 selfloop transitions, 19 changer transitions 2/150 dead transitions. [2024-06-14 14:41:43,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 150 transitions, 1639 flow [2024-06-14 14:41:43,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:41:43,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:41:43,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-14 14:41:43,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38064516129032255 [2024-06-14 14:41:43,751 INFO L175 Difference]: Start difference. First operand has 154 places, 127 transitions, 1167 flow. Second operand 10 states and 118 transitions. [2024-06-14 14:41:43,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 150 transitions, 1639 flow [2024-06-14 14:41:43,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 150 transitions, 1585 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-14 14:41:43,814 INFO L231 Difference]: Finished difference. Result has 156 places, 129 transitions, 1194 flow [2024-06-14 14:41:43,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1113, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1194, PETRI_PLACES=156, PETRI_TRANSITIONS=129} [2024-06-14 14:41:43,814 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 126 predicate places. [2024-06-14 14:41:43,814 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 129 transitions, 1194 flow [2024-06-14 14:41:43,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:41:43,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:41:43,815 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:41:43,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-14 14:41:43,815 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:41:43,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:41:43,816 INFO L85 PathProgramCache]: Analyzing trace with hash -70999294, now seen corresponding path program 5 times [2024-06-14 14:41:43,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:41:43,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783252438] [2024-06-14 14:41:43,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:41:43,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:41:43,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:41:50,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:41:50,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:41:50,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783252438] [2024-06-14 14:41:50,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783252438] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:41:50,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:41:50,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:41:50,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120625034] [2024-06-14 14:41:50,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:41:50,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:41:50,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:41:50,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:41:50,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:41:50,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:41:50,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 129 transitions, 1194 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:41:50,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:41:50,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:41:50,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:41:50,877 INFO L124 PetriNetUnfolderBase]: 349/630 cut-off events. [2024-06-14 14:41:50,877 INFO L125 PetriNetUnfolderBase]: For 25247/25247 co-relation queries the response was YES. [2024-06-14 14:41:50,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3952 conditions, 630 events. 349/630 cut-off events. For 25247/25247 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2794 event pairs, 47 based on Foata normal form. 2/630 useless extension candidates. Maximal degree in co-relation 3874. Up to 564 conditions per place. [2024-06-14 14:41:50,882 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 122 selfloop transitions, 20 changer transitions 0/144 dead transitions. [2024-06-14 14:41:50,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 144 transitions, 1526 flow [2024-06-14 14:41:50,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:41:50,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:41:50,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2024-06-14 14:41:50,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3763440860215054 [2024-06-14 14:41:50,885 INFO L175 Difference]: Start difference. First operand has 156 places, 129 transitions, 1194 flow. Second operand 9 states and 105 transitions. [2024-06-14 14:41:50,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 144 transitions, 1526 flow [2024-06-14 14:41:50,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 144 transitions, 1456 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-14 14:41:50,929 INFO L231 Difference]: Finished difference. Result has 157 places, 130 transitions, 1186 flow [2024-06-14 14:41:50,929 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1124, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1186, PETRI_PLACES=157, PETRI_TRANSITIONS=130} [2024-06-14 14:41:50,930 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 127 predicate places. [2024-06-14 14:41:50,930 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 130 transitions, 1186 flow [2024-06-14 14:41:50,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:41:50,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:41:50,930 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:41:50,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-14 14:41:50,931 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:41:50,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:41:50,931 INFO L85 PathProgramCache]: Analyzing trace with hash 11955112, now seen corresponding path program 6 times [2024-06-14 14:41:50,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:41:50,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090508499] [2024-06-14 14:41:50,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:41:50,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:41:50,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:41:57,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:41:57,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:41:57,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090508499] [2024-06-14 14:41:57,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090508499] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:41:57,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:41:57,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:41:57,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049871750] [2024-06-14 14:41:57,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:41:57,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:41:57,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:41:57,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:41:57,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:41:57,936 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:41:57,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 130 transitions, 1186 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:41:57,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:41:57,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:41:57,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:41:58,339 INFO L124 PetriNetUnfolderBase]: 346/625 cut-off events. [2024-06-14 14:41:58,340 INFO L125 PetriNetUnfolderBase]: For 24014/24014 co-relation queries the response was YES. [2024-06-14 14:41:58,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3814 conditions, 625 events. 346/625 cut-off events. For 24014/24014 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2775 event pairs, 46 based on Foata normal form. 2/625 useless extension candidates. Maximal degree in co-relation 3735. Up to 551 conditions per place. [2024-06-14 14:41:58,344 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 121 selfloop transitions, 21 changer transitions 0/144 dead transitions. [2024-06-14 14:41:58,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 144 transitions, 1502 flow [2024-06-14 14:41:58,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:41:58,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:41:58,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2024-06-14 14:41:58,347 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3727598566308244 [2024-06-14 14:41:58,347 INFO L175 Difference]: Start difference. First operand has 157 places, 130 transitions, 1186 flow. Second operand 9 states and 104 transitions. [2024-06-14 14:41:58,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 144 transitions, 1502 flow [2024-06-14 14:41:58,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 144 transitions, 1446 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-14 14:41:58,391 INFO L231 Difference]: Finished difference. Result has 159 places, 130 transitions, 1176 flow [2024-06-14 14:41:58,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1130, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1176, PETRI_PLACES=159, PETRI_TRANSITIONS=130} [2024-06-14 14:41:58,391 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 129 predicate places. [2024-06-14 14:41:58,392 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 130 transitions, 1176 flow [2024-06-14 14:41:58,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:41:58,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:41:58,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 14:41:58,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-14 14:41:58,392 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:41:58,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:41:58,393 INFO L85 PathProgramCache]: Analyzing trace with hash 83958677, now seen corresponding path program 3 times [2024-06-14 14:41:58,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:41:58,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742691566] [2024-06-14 14:41:58,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:41:58,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:41:58,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:42:05,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:42:05,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:42:05,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742691566] [2024-06-14 14:42:05,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742691566] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:42:05,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:42:05,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:42:05,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812954502] [2024-06-14 14:42:05,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:42:05,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:42:05,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:42:05,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:42:05,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:42:05,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:42:05,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 130 transitions, 1176 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:42:05,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:42:05,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:42:05,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:42:06,323 INFO L124 PetriNetUnfolderBase]: 342/619 cut-off events. [2024-06-14 14:42:06,324 INFO L125 PetriNetUnfolderBase]: For 22761/22761 co-relation queries the response was YES. [2024-06-14 14:42:06,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3682 conditions, 619 events. 342/619 cut-off events. For 22761/22761 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2750 event pairs, 45 based on Foata normal form. 2/619 useless extension candidates. Maximal degree in co-relation 3602. Up to 571 conditions per place. [2024-06-14 14:42:06,328 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 130 selfloop transitions, 15 changer transitions 2/149 dead transitions. [2024-06-14 14:42:06,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 149 transitions, 1520 flow [2024-06-14 14:42:06,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:42:06,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:42:06,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2024-06-14 14:42:06,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36451612903225805 [2024-06-14 14:42:06,329 INFO L175 Difference]: Start difference. First operand has 159 places, 130 transitions, 1176 flow. Second operand 10 states and 113 transitions. [2024-06-14 14:42:06,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 149 transitions, 1520 flow [2024-06-14 14:42:06,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 149 transitions, 1440 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-14 14:42:06,374 INFO L231 Difference]: Finished difference. Result has 162 places, 130 transitions, 1133 flow [2024-06-14 14:42:06,374 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1098, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1133, PETRI_PLACES=162, PETRI_TRANSITIONS=130} [2024-06-14 14:42:06,374 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 132 predicate places. [2024-06-14 14:42:06,374 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 130 transitions, 1133 flow [2024-06-14 14:42:06,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:42:06,375 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:42:06,375 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:42:06,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-14 14:42:06,375 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:42:06,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:42:06,375 INFO L85 PathProgramCache]: Analyzing trace with hash -708837889, now seen corresponding path program 4 times [2024-06-14 14:42:06,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:42:06,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298458540] [2024-06-14 14:42:06,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:42:06,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:42:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:42:12,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:42:12,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:42:12,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298458540] [2024-06-14 14:42:12,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298458540] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:42:12,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:42:12,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:42:12,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43380102] [2024-06-14 14:42:12,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:42:12,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:42:12,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:42:12,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:42:12,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:42:12,845 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:42:12,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 130 transitions, 1133 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:42:12,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:42:12,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:42:12,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:42:13,261 INFO L124 PetriNetUnfolderBase]: 348/629 cut-off events. [2024-06-14 14:42:13,261 INFO L125 PetriNetUnfolderBase]: For 23764/23764 co-relation queries the response was YES. [2024-06-14 14:42:13,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3719 conditions, 629 events. 348/629 cut-off events. For 23764/23764 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2805 event pairs, 37 based on Foata normal form. 2/629 useless extension candidates. Maximal degree in co-relation 3638. Up to 449 conditions per place. [2024-06-14 14:42:13,266 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 110 selfloop transitions, 42 changer transitions 0/154 dead transitions. [2024-06-14 14:42:13,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 154 transitions, 1565 flow [2024-06-14 14:42:13,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:42:13,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:42:13,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-14 14:42:13,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4161290322580645 [2024-06-14 14:42:13,267 INFO L175 Difference]: Start difference. First operand has 162 places, 130 transitions, 1133 flow. Second operand 10 states and 129 transitions. [2024-06-14 14:42:13,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 154 transitions, 1565 flow [2024-06-14 14:42:13,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 154 transitions, 1513 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-14 14:42:13,314 INFO L231 Difference]: Finished difference. Result has 162 places, 132 transitions, 1222 flow [2024-06-14 14:42:13,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1081, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1222, PETRI_PLACES=162, PETRI_TRANSITIONS=132} [2024-06-14 14:42:13,315 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 132 predicate places. [2024-06-14 14:42:13,315 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 132 transitions, 1222 flow [2024-06-14 14:42:13,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:42:13,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:42:13,315 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:42:13,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-14 14:42:13,316 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:42:13,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:42:13,316 INFO L85 PathProgramCache]: Analyzing trace with hash -708838044, now seen corresponding path program 7 times [2024-06-14 14:42:13,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:42:13,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740700259] [2024-06-14 14:42:13,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:42:13,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:42:13,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:42:18,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:42:18,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:42:18,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740700259] [2024-06-14 14:42:18,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740700259] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:42:18,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:42:18,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:42:18,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863055241] [2024-06-14 14:42:18,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:42:18,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:42:18,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:42:18,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:42:18,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:42:18,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:42:18,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 132 transitions, 1222 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:42:18,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:42:18,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:42:18,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:42:19,295 INFO L124 PetriNetUnfolderBase]: 368/673 cut-off events. [2024-06-14 14:42:19,295 INFO L125 PetriNetUnfolderBase]: For 36618/36618 co-relation queries the response was YES. [2024-06-14 14:42:19,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4036 conditions, 673 events. 368/673 cut-off events. For 36618/36618 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3056 event pairs, 41 based on Foata normal form. 12/683 useless extension candidates. Maximal degree in co-relation 3954. Up to 451 conditions per place. [2024-06-14 14:42:19,301 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 111 selfloop transitions, 40 changer transitions 6/159 dead transitions. [2024-06-14 14:42:19,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 159 transitions, 1690 flow [2024-06-14 14:42:19,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:42:19,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:42:19,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions. [2024-06-14 14:42:19,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4258064516129032 [2024-06-14 14:42:19,304 INFO L175 Difference]: Start difference. First operand has 162 places, 132 transitions, 1222 flow. Second operand 10 states and 132 transitions. [2024-06-14 14:42:19,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 159 transitions, 1690 flow [2024-06-14 14:42:19,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 159 transitions, 1556 flow, removed 23 selfloop flow, removed 9 redundant places. [2024-06-14 14:42:19,355 INFO L231 Difference]: Finished difference. Result has 163 places, 132 transitions, 1186 flow [2024-06-14 14:42:19,355 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1088, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1186, PETRI_PLACES=163, PETRI_TRANSITIONS=132} [2024-06-14 14:42:19,356 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 133 predicate places. [2024-06-14 14:42:19,356 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 132 transitions, 1186 flow [2024-06-14 14:42:19,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:42:19,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:42:19,356 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:42:19,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-14 14:42:19,357 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:42:19,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:42:19,357 INFO L85 PathProgramCache]: Analyzing trace with hash -703475664, now seen corresponding path program 8 times [2024-06-14 14:42:19,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:42:19,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484327759] [2024-06-14 14:42:19,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:42:19,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:42:19,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:42:25,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:42:25,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:42:25,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484327759] [2024-06-14 14:42:25,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484327759] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:42:25,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:42:25,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:42:25,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492971850] [2024-06-14 14:42:25,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:42:25,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:42:25,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:42:25,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:42:25,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:42:25,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:42:25,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 132 transitions, 1186 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:42:25,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:42:25,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:42:25,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:42:26,029 INFO L124 PetriNetUnfolderBase]: 382/707 cut-off events. [2024-06-14 14:42:26,030 INFO L125 PetriNetUnfolderBase]: For 38053/38053 co-relation queries the response was YES. [2024-06-14 14:42:26,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4119 conditions, 707 events. 382/707 cut-off events. For 38053/38053 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3285 event pairs, 45 based on Foata normal form. 12/717 useless extension candidates. Maximal degree in co-relation 4037. Up to 485 conditions per place. [2024-06-14 14:42:26,037 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 109 selfloop transitions, 41 changer transitions 6/158 dead transitions. [2024-06-14 14:42:26,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 158 transitions, 1656 flow [2024-06-14 14:42:26,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:42:26,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:42:26,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-14 14:42:26,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4161290322580645 [2024-06-14 14:42:26,039 INFO L175 Difference]: Start difference. First operand has 163 places, 132 transitions, 1186 flow. Second operand 10 states and 129 transitions. [2024-06-14 14:42:26,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 158 transitions, 1656 flow [2024-06-14 14:42:26,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 158 transitions, 1568 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-14 14:42:26,128 INFO L231 Difference]: Finished difference. Result has 165 places, 132 transitions, 1200 flow [2024-06-14 14:42:26,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1098, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1200, PETRI_PLACES=165, PETRI_TRANSITIONS=132} [2024-06-14 14:42:26,128 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 135 predicate places. [2024-06-14 14:42:26,129 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 132 transitions, 1200 flow [2024-06-14 14:42:26,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:42:26,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:42:26,129 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:42:26,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-14 14:42:26,129 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:42:26,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:42:26,130 INFO L85 PathProgramCache]: Analyzing trace with hash 73035541, now seen corresponding path program 5 times [2024-06-14 14:42:26,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:42:26,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439626247] [2024-06-14 14:42:26,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:42:26,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:42:26,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:42:35,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 14:42:35,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:42:35,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439626247] [2024-06-14 14:42:35,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439626247] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:42:35,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:42:35,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:42:35,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653563429] [2024-06-14 14:42:35,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:42:35,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:42:35,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:42:35,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:42:35,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:42:35,470 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-14 14:42:35,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 132 transitions, 1200 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:42:35,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:42:35,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-14 14:42:35,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:42:35,791 INFO L124 PetriNetUnfolderBase]: 382/707 cut-off events. [2024-06-14 14:42:35,792 INFO L125 PetriNetUnfolderBase]: For 27688/27688 co-relation queries the response was YES. [2024-06-14 14:42:35,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4156 conditions, 707 events. 382/707 cut-off events. For 27688/27688 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3307 event pairs, 53 based on Foata normal form. 2/707 useless extension candidates. Maximal degree in co-relation 4073. Up to 549 conditions per place. [2024-06-14 14:42:35,797 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 113 selfloop transitions, 38 changer transitions 1/154 dead transitions. [2024-06-14 14:42:35,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 154 transitions, 1640 flow [2024-06-14 14:42:35,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:42:35,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:42:35,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2024-06-14 14:42:35,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36451612903225805 [2024-06-14 14:42:35,805 INFO L175 Difference]: Start difference. First operand has 165 places, 132 transitions, 1200 flow. Second operand 10 states and 113 transitions. [2024-06-14 14:42:35,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 154 transitions, 1640 flow [2024-06-14 14:42:35,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 154 transitions, 1548 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-14 14:42:35,858 INFO L231 Difference]: Finished difference. Result has 167 places, 134 transitions, 1245 flow [2024-06-14 14:42:35,859 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1108, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1245, PETRI_PLACES=167, PETRI_TRANSITIONS=134} [2024-06-14 14:42:35,859 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 137 predicate places. [2024-06-14 14:42:35,859 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 134 transitions, 1245 flow [2024-06-14 14:42:35,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:42:35,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:42:35,860 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:42:35,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-14 14:42:35,861 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:42:35,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:42:35,861 INFO L85 PathProgramCache]: Analyzing trace with hash -708982194, now seen corresponding path program 9 times [2024-06-14 14:42:35,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:42:35,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772094754] [2024-06-14 14:42:35,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:42:35,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:42:35,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:42:42,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:42:42,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:42:42,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772094754] [2024-06-14 14:42:42,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772094754] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:42:42,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:42:42,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:42:42,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413544919] [2024-06-14 14:42:42,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:42:42,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:42:42,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:42:42,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:42:42,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:42:42,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:42:42,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 134 transitions, 1245 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:42:42,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:42:42,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:42:42,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:42:42,876 INFO L124 PetriNetUnfolderBase]: 386/715 cut-off events. [2024-06-14 14:42:42,876 INFO L125 PetriNetUnfolderBase]: For 28849/28849 co-relation queries the response was YES. [2024-06-14 14:42:42,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4238 conditions, 715 events. 386/715 cut-off events. For 28849/28849 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3351 event pairs, 67 based on Foata normal form. 2/715 useless extension candidates. Maximal degree in co-relation 4154. Up to 622 conditions per place. [2024-06-14 14:42:42,883 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 112 selfloop transitions, 36 changer transitions 4/154 dead transitions. [2024-06-14 14:42:42,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 154 transitions, 1663 flow [2024-06-14 14:42:42,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:42:42,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:42:42,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2024-06-14 14:42:42,884 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3774193548387097 [2024-06-14 14:42:42,884 INFO L175 Difference]: Start difference. First operand has 167 places, 134 transitions, 1245 flow. Second operand 10 states and 117 transitions. [2024-06-14 14:42:42,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 154 transitions, 1663 flow [2024-06-14 14:42:42,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 154 transitions, 1536 flow, removed 24 selfloop flow, removed 8 redundant places. [2024-06-14 14:42:42,944 INFO L231 Difference]: Finished difference. Result has 169 places, 136 transitions, 1246 flow [2024-06-14 14:42:42,944 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1124, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1246, PETRI_PLACES=169, PETRI_TRANSITIONS=136} [2024-06-14 14:42:42,948 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 139 predicate places. [2024-06-14 14:42:42,948 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 136 transitions, 1246 flow [2024-06-14 14:42:42,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:42:42,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:42:42,949 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:42:42,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-14 14:42:42,949 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:42:42,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:42:42,949 INFO L85 PathProgramCache]: Analyzing trace with hash -708982039, now seen corresponding path program 6 times [2024-06-14 14:42:42,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:42:42,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60431113] [2024-06-14 14:42:42,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:42:42,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:42:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:42:49,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:42:49,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:42:49,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60431113] [2024-06-14 14:42:49,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60431113] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:42:49,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:42:49,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:42:49,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668313766] [2024-06-14 14:42:49,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:42:49,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:42:49,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:42:49,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:42:49,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:42:49,307 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:42:49,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 136 transitions, 1246 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:42:49,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:42:49,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:42:49,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:42:49,742 INFO L124 PetriNetUnfolderBase]: 352/645 cut-off events. [2024-06-14 14:42:49,742 INFO L125 PetriNetUnfolderBase]: For 29358/29358 co-relation queries the response was YES. [2024-06-14 14:42:49,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3963 conditions, 645 events. 352/645 cut-off events. For 29358/29358 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 2934 event pairs, 41 based on Foata normal form. 2/645 useless extension candidates. Maximal degree in co-relation 3878. Up to 474 conditions per place. [2024-06-14 14:42:49,750 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 110 selfloop transitions, 44 changer transitions 0/156 dead transitions. [2024-06-14 14:42:49,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 156 transitions, 1650 flow [2024-06-14 14:42:49,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:42:49,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:42:49,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-14 14:42:49,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4064516129032258 [2024-06-14 14:42:49,751 INFO L175 Difference]: Start difference. First operand has 169 places, 136 transitions, 1246 flow. Second operand 10 states and 126 transitions. [2024-06-14 14:42:49,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 156 transitions, 1650 flow [2024-06-14 14:42:49,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 156 transitions, 1553 flow, removed 28 selfloop flow, removed 6 redundant places. [2024-06-14 14:42:49,846 INFO L231 Difference]: Finished difference. Result has 173 places, 138 transitions, 1302 flow [2024-06-14 14:42:49,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1151, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1302, PETRI_PLACES=173, PETRI_TRANSITIONS=138} [2024-06-14 14:42:49,847 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 143 predicate places. [2024-06-14 14:42:49,847 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 138 transitions, 1302 flow [2024-06-14 14:42:49,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:42:49,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:42:49,848 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:42:49,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-14 14:42:49,848 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:42:49,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:42:49,849 INFO L85 PathProgramCache]: Analyzing trace with hash 67525136, now seen corresponding path program 10 times [2024-06-14 14:42:49,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:42:49,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626464467] [2024-06-14 14:42:49,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:42:49,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:42:49,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:42:56,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:42:56,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:42:56,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626464467] [2024-06-14 14:42:56,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626464467] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:42:56,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:42:56,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:42:56,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838533864] [2024-06-14 14:42:56,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:42:56,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:42:56,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:42:56,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:42:56,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:42:57,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:42:57,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 138 transitions, 1302 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:42:57,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:42:57,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:42:57,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:42:57,467 INFO L124 PetriNetUnfolderBase]: 356/653 cut-off events. [2024-06-14 14:42:57,468 INFO L125 PetriNetUnfolderBase]: For 30285/30285 co-relation queries the response was YES. [2024-06-14 14:42:57,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4038 conditions, 653 events. 356/653 cut-off events. For 30285/30285 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 2990 event pairs, 45 based on Foata normal form. 2/653 useless extension candidates. Maximal degree in co-relation 3951. Up to 534 conditions per place. [2024-06-14 14:42:57,472 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 113 selfloop transitions, 39 changer transitions 0/154 dead transitions. [2024-06-14 14:42:57,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 154 transitions, 1664 flow [2024-06-14 14:42:57,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:42:57,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:42:57,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-14 14:42:57,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38064516129032255 [2024-06-14 14:42:57,474 INFO L175 Difference]: Start difference. First operand has 173 places, 138 transitions, 1302 flow. Second operand 10 states and 118 transitions. [2024-06-14 14:42:57,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 154 transitions, 1664 flow [2024-06-14 14:42:57,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 154 transitions, 1516 flow, removed 27 selfloop flow, removed 9 redundant places. [2024-06-14 14:42:57,525 INFO L231 Difference]: Finished difference. Result has 174 places, 139 transitions, 1262 flow [2024-06-14 14:42:57,525 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1156, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1262, PETRI_PLACES=174, PETRI_TRANSITIONS=139} [2024-06-14 14:42:57,525 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 144 predicate places. [2024-06-14 14:42:57,525 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 139 transitions, 1262 flow [2024-06-14 14:42:57,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:42:57,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:42:57,526 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:42:57,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-14 14:42:57,526 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:42:57,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:42:57,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1599820053, now seen corresponding path program 1 times [2024-06-14 14:42:57,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:42:57,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124716623] [2024-06-14 14:42:57,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:42:57,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:42:57,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:43:03,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:43:03,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:43:03,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124716623] [2024-06-14 14:43:03,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124716623] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:43:03,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:43:03,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:43:03,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820586598] [2024-06-14 14:43:03,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:43:03,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:43:03,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:43:03,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:43:03,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:43:03,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:43:03,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 139 transitions, 1262 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:43:03,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:43:03,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:43:03,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:43:04,188 INFO L124 PetriNetUnfolderBase]: 360/661 cut-off events. [2024-06-14 14:43:04,189 INFO L125 PetriNetUnfolderBase]: For 30725/30725 co-relation queries the response was YES. [2024-06-14 14:43:04,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3982 conditions, 661 events. 360/661 cut-off events. For 30725/30725 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3029 event pairs, 39 based on Foata normal form. 2/661 useless extension candidates. Maximal degree in co-relation 3895. Up to 626 conditions per place. [2024-06-14 14:43:04,194 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 137 selfloop transitions, 13 changer transitions 0/152 dead transitions. [2024-06-14 14:43:04,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 152 transitions, 1594 flow [2024-06-14 14:43:04,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:43:04,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:43:04,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-14 14:43:04,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35125448028673834 [2024-06-14 14:43:04,195 INFO L175 Difference]: Start difference. First operand has 174 places, 139 transitions, 1262 flow. Second operand 9 states and 98 transitions. [2024-06-14 14:43:04,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 152 transitions, 1594 flow [2024-06-14 14:43:04,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 152 transitions, 1498 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-14 14:43:04,252 INFO L231 Difference]: Finished difference. Result has 175 places, 140 transitions, 1204 flow [2024-06-14 14:43:04,252 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1166, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1204, PETRI_PLACES=175, PETRI_TRANSITIONS=140} [2024-06-14 14:43:04,252 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 145 predicate places. [2024-06-14 14:43:04,253 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 140 transitions, 1204 flow [2024-06-14 14:43:04,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:43:04,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:43:04,253 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:43:04,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-14 14:43:04,253 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:43:04,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:43:04,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1253309276, now seen corresponding path program 11 times [2024-06-14 14:43:04,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:43:04,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759028840] [2024-06-14 14:43:04,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:43:04,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:43:04,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:43:11,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:43:11,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:43:11,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759028840] [2024-06-14 14:43:11,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759028840] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:43:11,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:43:11,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:43:11,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219677367] [2024-06-14 14:43:11,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:43:11,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:43:11,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:43:11,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:43:11,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:43:11,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:43:11,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 140 transitions, 1204 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:43:11,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:43:11,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:43:11,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:43:12,181 INFO L124 PetriNetUnfolderBase]: 380/705 cut-off events. [2024-06-14 14:43:12,181 INFO L125 PetriNetUnfolderBase]: For 46841/46841 co-relation queries the response was YES. [2024-06-14 14:43:12,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4152 conditions, 705 events. 380/705 cut-off events. For 46841/46841 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3299 event pairs, 43 based on Foata normal form. 12/715 useless extension candidates. Maximal degree in co-relation 4064. Up to 583 conditions per place. [2024-06-14 14:43:12,190 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 129 selfloop transitions, 20 changer transitions 9/160 dead transitions. [2024-06-14 14:43:12,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 160 transitions, 1638 flow [2024-06-14 14:43:12,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:43:12,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:43:12,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2024-06-14 14:43:12,199 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3774193548387097 [2024-06-14 14:43:12,199 INFO L175 Difference]: Start difference. First operand has 175 places, 140 transitions, 1204 flow. Second operand 10 states and 117 transitions. [2024-06-14 14:43:12,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 160 transitions, 1638 flow [2024-06-14 14:43:12,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 160 transitions, 1602 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-14 14:43:12,267 INFO L231 Difference]: Finished difference. Result has 178 places, 137 transitions, 1204 flow [2024-06-14 14:43:12,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1168, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1204, PETRI_PLACES=178, PETRI_TRANSITIONS=137} [2024-06-14 14:43:12,267 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 148 predicate places. [2024-06-14 14:43:12,268 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 137 transitions, 1204 flow [2024-06-14 14:43:12,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:43:12,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:43:12,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:43:12,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-14 14:43:12,268 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:43:12,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:43:12,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1522021458, now seen corresponding path program 12 times [2024-06-14 14:43:12,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:43:12,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858494778] [2024-06-14 14:43:12,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:43:12,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:43:12,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:43:18,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:43:18,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:43:18,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858494778] [2024-06-14 14:43:18,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858494778] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:43:18,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:43:18,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:43:18,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322210462] [2024-06-14 14:43:18,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:43:18,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:43:18,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:43:18,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:43:18,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:43:18,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:43:18,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 137 transitions, 1204 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:43:18,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:43:18,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:43:18,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:43:19,358 INFO L124 PetriNetUnfolderBase]: 374/703 cut-off events. [2024-06-14 14:43:19,358 INFO L125 PetriNetUnfolderBase]: For 51960/51960 co-relation queries the response was YES. [2024-06-14 14:43:19,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4174 conditions, 703 events. 374/703 cut-off events. For 51960/51960 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3356 event pairs, 39 based on Foata normal form. 14/715 useless extension candidates. Maximal degree in co-relation 4086. Up to 538 conditions per place. [2024-06-14 14:43:19,363 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 116 selfloop transitions, 29 changer transitions 12/159 dead transitions. [2024-06-14 14:43:19,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 159 transitions, 1650 flow [2024-06-14 14:43:19,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:43:19,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:43:19,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-14 14:43:19,365 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3967741935483871 [2024-06-14 14:43:19,365 INFO L175 Difference]: Start difference. First operand has 178 places, 137 transitions, 1204 flow. Second operand 10 states and 123 transitions. [2024-06-14 14:43:19,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 159 transitions, 1650 flow [2024-06-14 14:43:19,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 159 transitions, 1568 flow, removed 11 selfloop flow, removed 10 redundant places. [2024-06-14 14:43:19,437 INFO L231 Difference]: Finished difference. Result has 178 places, 133 transitions, 1178 flow [2024-06-14 14:43:19,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1122, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1178, PETRI_PLACES=178, PETRI_TRANSITIONS=133} [2024-06-14 14:43:19,438 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 148 predicate places. [2024-06-14 14:43:19,438 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 133 transitions, 1178 flow [2024-06-14 14:43:19,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:43:19,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:43:19,439 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:43:19,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-14 14:43:19,439 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:43:19,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:43:19,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1522021303, now seen corresponding path program 7 times [2024-06-14 14:43:19,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:43:19,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844107133] [2024-06-14 14:43:19,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:43:19,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:43:19,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:43:26,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:43:26,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:43:26,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844107133] [2024-06-14 14:43:26,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844107133] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:43:26,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:43:26,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:43:26,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329010961] [2024-06-14 14:43:26,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:43:26,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:43:26,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:43:26,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:43:26,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:43:26,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:43:26,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 133 transitions, 1178 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:43:26,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:43:26,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:43:26,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:43:27,024 INFO L124 PetriNetUnfolderBase]: 346/647 cut-off events. [2024-06-14 14:43:27,024 INFO L125 PetriNetUnfolderBase]: For 34704/34704 co-relation queries the response was YES. [2024-06-14 14:43:27,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3955 conditions, 647 events. 346/647 cut-off events. For 34704/34704 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3035 event pairs, 41 based on Foata normal form. 2/647 useless extension candidates. Maximal degree in co-relation 3868. Up to 570 conditions per place. [2024-06-14 14:43:27,029 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 120 selfloop transitions, 26 changer transitions 0/148 dead transitions. [2024-06-14 14:43:27,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 148 transitions, 1556 flow [2024-06-14 14:43:27,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:43:27,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:43:27,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2024-06-14 14:43:27,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36129032258064514 [2024-06-14 14:43:27,031 INFO L175 Difference]: Start difference. First operand has 178 places, 133 transitions, 1178 flow. Second operand 10 states and 112 transitions. [2024-06-14 14:43:27,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 148 transitions, 1556 flow [2024-06-14 14:43:27,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 148 transitions, 1464 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-06-14 14:43:27,119 INFO L231 Difference]: Finished difference. Result has 179 places, 135 transitions, 1205 flow [2024-06-14 14:43:27,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1086, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1205, PETRI_PLACES=179, PETRI_TRANSITIONS=135} [2024-06-14 14:43:27,119 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 149 predicate places. [2024-06-14 14:43:27,119 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 135 transitions, 1205 flow [2024-06-14 14:43:27,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:43:27,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:43:27,120 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:43:27,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-14 14:43:27,120 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:43:27,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:43:27,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1519548467, now seen corresponding path program 2 times [2024-06-14 14:43:27,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:43:27,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21381580] [2024-06-14 14:43:27,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:43:27,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:43:27,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:43:33,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:43:33,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:43:33,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21381580] [2024-06-14 14:43:33,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21381580] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:43:33,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:43:33,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:43:33,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075132483] [2024-06-14 14:43:33,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:43:33,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:43:33,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:43:33,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:43:33,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:43:33,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:43:33,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 135 transitions, 1205 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:43:33,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:43:33,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:43:33,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:43:34,102 INFO L124 PetriNetUnfolderBase]: 350/655 cut-off events. [2024-06-14 14:43:34,103 INFO L125 PetriNetUnfolderBase]: For 35518/35518 co-relation queries the response was YES. [2024-06-14 14:43:34,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3965 conditions, 655 events. 350/655 cut-off events. For 35518/35518 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3059 event pairs, 39 based on Foata normal form. 2/655 useless extension candidates. Maximal degree in co-relation 3877. Up to 620 conditions per place. [2024-06-14 14:43:34,106 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 134 selfloop transitions, 12 changer transitions 0/148 dead transitions. [2024-06-14 14:43:34,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 148 transitions, 1531 flow [2024-06-14 14:43:34,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:43:34,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:43:34,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2024-06-14 14:43:34,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34408602150537637 [2024-06-14 14:43:34,108 INFO L175 Difference]: Start difference. First operand has 179 places, 135 transitions, 1205 flow. Second operand 9 states and 96 transitions. [2024-06-14 14:43:34,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 148 transitions, 1531 flow [2024-06-14 14:43:34,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 148 transitions, 1428 flow, removed 27 selfloop flow, removed 8 redundant places. [2024-06-14 14:43:34,171 INFO L231 Difference]: Finished difference. Result has 180 places, 136 transitions, 1140 flow [2024-06-14 14:43:34,171 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1102, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1140, PETRI_PLACES=180, PETRI_TRANSITIONS=136} [2024-06-14 14:43:34,172 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 150 predicate places. [2024-06-14 14:43:34,172 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 136 transitions, 1140 flow [2024-06-14 14:43:34,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:43:34,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:43:34,172 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:43:34,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-14 14:43:34,173 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:43:34,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:43:34,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1253309431, now seen corresponding path program 8 times [2024-06-14 14:43:34,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:43:34,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172423823] [2024-06-14 14:43:34,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:43:34,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:43:34,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:43:41,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:43:41,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:43:41,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172423823] [2024-06-14 14:43:41,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172423823] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:43:41,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:43:41,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:43:41,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872203490] [2024-06-14 14:43:41,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:43:41,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:43:41,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:43:41,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:43:41,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:43:41,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:43:41,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 136 transitions, 1140 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:43:41,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:43:41,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:43:41,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:43:42,102 INFO L124 PetriNetUnfolderBase]: 356/665 cut-off events. [2024-06-14 14:43:42,102 INFO L125 PetriNetUnfolderBase]: For 36769/36769 co-relation queries the response was YES. [2024-06-14 14:43:42,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3992 conditions, 665 events. 356/665 cut-off events. For 36769/36769 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3133 event pairs, 45 based on Foata normal form. 2/665 useless extension candidates. Maximal degree in co-relation 3903. Up to 619 conditions per place. [2024-06-14 14:43:42,108 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 132 selfloop transitions, 17 changer transitions 0/151 dead transitions. [2024-06-14 14:43:42,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 151 transitions, 1528 flow [2024-06-14 14:43:42,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:43:42,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:43:42,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2024-06-14 14:43:42,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-14 14:43:42,110 INFO L175 Difference]: Start difference. First operand has 180 places, 136 transitions, 1140 flow. Second operand 10 states and 110 transitions. [2024-06-14 14:43:42,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 151 transitions, 1528 flow [2024-06-14 14:43:42,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 151 transitions, 1500 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-14 14:43:42,172 INFO L231 Difference]: Finished difference. Result has 183 places, 138 transitions, 1217 flow [2024-06-14 14:43:42,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1112, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1217, PETRI_PLACES=183, PETRI_TRANSITIONS=138} [2024-06-14 14:43:42,172 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 153 predicate places. [2024-06-14 14:43:42,172 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 138 transitions, 1217 flow [2024-06-14 14:43:42,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:43:42,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:43:42,173 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:43:42,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-14 14:43:42,173 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:43:42,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:43:42,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1253524757, now seen corresponding path program 3 times [2024-06-14 14:43:42,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:43:42,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199386813] [2024-06-14 14:43:42,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:43:42,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:43:42,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:43:48,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:43:48,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:43:48,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199386813] [2024-06-14 14:43:48,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199386813] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:43:48,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:43:48,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:43:48,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356220963] [2024-06-14 14:43:48,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:43:48,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:43:48,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:43:48,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:43:48,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:43:48,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:43:48,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 138 transitions, 1217 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 14:43:48,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:43:48,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:43:48,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:43:49,170 INFO L124 PetriNetUnfolderBase]: 360/673 cut-off events. [2024-06-14 14:43:49,170 INFO L125 PetriNetUnfolderBase]: For 38132/38132 co-relation queries the response was YES. [2024-06-14 14:43:49,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4070 conditions, 673 events. 360/673 cut-off events. For 38132/38132 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3188 event pairs, 45 based on Foata normal form. 2/673 useless extension candidates. Maximal degree in co-relation 3980. Up to 643 conditions per place. [2024-06-14 14:43:49,175 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 135 selfloop transitions, 13 changer transitions 0/150 dead transitions. [2024-06-14 14:43:49,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 150 transitions, 1547 flow [2024-06-14 14:43:49,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:43:49,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:43:49,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-14 14:43:49,176 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34767025089605735 [2024-06-14 14:43:49,176 INFO L175 Difference]: Start difference. First operand has 183 places, 138 transitions, 1217 flow. Second operand 9 states and 97 transitions. [2024-06-14 14:43:49,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 150 transitions, 1547 flow [2024-06-14 14:43:49,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 150 transitions, 1438 flow, removed 29 selfloop flow, removed 9 redundant places. [2024-06-14 14:43:49,242 INFO L231 Difference]: Finished difference. Result has 183 places, 139 transitions, 1150 flow [2024-06-14 14:43:49,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1108, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1150, PETRI_PLACES=183, PETRI_TRANSITIONS=139} [2024-06-14 14:43:49,243 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 153 predicate places. [2024-06-14 14:43:49,243 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 139 transitions, 1150 flow [2024-06-14 14:43:49,243 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 14:43:49,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:43:49,243 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:43:49,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-14 14:43:49,244 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:43:49,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:43:49,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1522169328, now seen corresponding path program 13 times [2024-06-14 14:43:49,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:43:49,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379372937] [2024-06-14 14:43:49,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:43:49,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:43:49,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:43:56,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:43:56,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:43:56,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379372937] [2024-06-14 14:43:56,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379372937] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:43:56,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:43:56,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:43:56,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147005520] [2024-06-14 14:43:56,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:43:56,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:43:56,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:43:56,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:43:56,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:43:56,357 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:43:56,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 139 transitions, 1150 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:43:56,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:43:56,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:43:56,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:43:56,792 INFO L124 PetriNetUnfolderBase]: 364/681 cut-off events. [2024-06-14 14:43:56,792 INFO L125 PetriNetUnfolderBase]: For 38762/38762 co-relation queries the response was YES. [2024-06-14 14:43:56,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4055 conditions, 681 events. 364/681 cut-off events. For 38762/38762 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3232 event pairs, 39 based on Foata normal form. 2/681 useless extension candidates. Maximal degree in co-relation 3964. Up to 571 conditions per place. [2024-06-14 14:43:56,798 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 118 selfloop transitions, 36 changer transitions 0/156 dead transitions. [2024-06-14 14:43:56,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 156 transitions, 1642 flow [2024-06-14 14:43:56,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:43:56,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:43:56,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2024-06-14 14:43:56,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3774193548387097 [2024-06-14 14:43:56,817 INFO L175 Difference]: Start difference. First operand has 183 places, 139 transitions, 1150 flow. Second operand 10 states and 117 transitions. [2024-06-14 14:43:56,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 156 transitions, 1642 flow [2024-06-14 14:43:56,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 156 transitions, 1601 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-14 14:43:56,903 INFO L231 Difference]: Finished difference. Result has 186 places, 140 transitions, 1213 flow [2024-06-14 14:43:56,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1109, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1213, PETRI_PLACES=186, PETRI_TRANSITIONS=140} [2024-06-14 14:43:56,905 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 156 predicate places. [2024-06-14 14:43:56,906 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 140 transitions, 1213 flow [2024-06-14 14:43:56,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:43:56,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:43:56,906 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:43:56,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-14 14:43:56,906 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:43:56,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:43:56,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1516653343, now seen corresponding path program 9 times [2024-06-14 14:43:56,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:43:56,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527332997] [2024-06-14 14:43:56,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:43:56,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:43:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:44:03,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:44:03,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:44:03,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527332997] [2024-06-14 14:44:03,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527332997] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:44:03,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:44:03,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:44:03,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298229694] [2024-06-14 14:44:03,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:44:03,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:44:03,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:44:03,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:44:03,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:44:03,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:44:03,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 140 transitions, 1213 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:44:03,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:44:03,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:44:03,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:44:04,103 INFO L124 PetriNetUnfolderBase]: 376/701 cut-off events. [2024-06-14 14:44:04,103 INFO L125 PetriNetUnfolderBase]: For 40776/40776 co-relation queries the response was YES. [2024-06-14 14:44:04,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4265 conditions, 701 events. 376/701 cut-off events. For 40776/40776 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3389 event pairs, 43 based on Foata normal form. 2/701 useless extension candidates. Maximal degree in co-relation 4174. Up to 621 conditions per place. [2024-06-14 14:44:04,109 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 132 selfloop transitions, 25 changer transitions 0/159 dead transitions. [2024-06-14 14:44:04,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 159 transitions, 1639 flow [2024-06-14 14:44:04,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:44:04,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:44:04,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2024-06-14 14:44:04,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3774193548387097 [2024-06-14 14:44:04,124 INFO L175 Difference]: Start difference. First operand has 186 places, 140 transitions, 1213 flow. Second operand 10 states and 117 transitions. [2024-06-14 14:44:04,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 159 transitions, 1639 flow [2024-06-14 14:44:04,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 159 transitions, 1503 flow, removed 18 selfloop flow, removed 9 redundant places. [2024-06-14 14:44:04,210 INFO L231 Difference]: Finished difference. Result has 187 places, 144 transitions, 1216 flow [2024-06-14 14:44:04,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1077, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1216, PETRI_PLACES=187, PETRI_TRANSITIONS=144} [2024-06-14 14:44:04,211 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 157 predicate places. [2024-06-14 14:44:04,211 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 144 transitions, 1216 flow [2024-06-14 14:44:04,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:44:04,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:44:04,212 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:44:04,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-14 14:44:04,212 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:44:04,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:44:04,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1516443597, now seen corresponding path program 4 times [2024-06-14 14:44:04,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:44:04,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709296161] [2024-06-14 14:44:04,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:44:04,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:44:04,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:44:11,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:44:11,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:44:11,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709296161] [2024-06-14 14:44:11,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709296161] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:44:11,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:44:11,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:44:11,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991237694] [2024-06-14 14:44:11,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:44:11,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:44:11,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:44:11,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:44:11,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:44:11,289 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:44:11,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 144 transitions, 1216 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 14:44:11,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:44:11,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:44:11,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:44:11,607 INFO L124 PetriNetUnfolderBase]: 373/696 cut-off events. [2024-06-14 14:44:11,607 INFO L125 PetriNetUnfolderBase]: For 37594/37594 co-relation queries the response was YES. [2024-06-14 14:44:11,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3954 conditions, 696 events. 373/696 cut-off events. For 37594/37594 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 3352 event pairs, 46 based on Foata normal form. 2/696 useless extension candidates. Maximal degree in co-relation 3865. Up to 654 conditions per place. [2024-06-14 14:44:11,612 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 137 selfloop transitions, 17 changer transitions 0/156 dead transitions. [2024-06-14 14:44:11,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 156 transitions, 1550 flow [2024-06-14 14:44:11,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:44:11,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:44:11,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2024-06-14 14:44:11,614 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36200716845878134 [2024-06-14 14:44:11,615 INFO L175 Difference]: Start difference. First operand has 187 places, 144 transitions, 1216 flow. Second operand 9 states and 101 transitions. [2024-06-14 14:44:11,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 156 transitions, 1550 flow [2024-06-14 14:44:11,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 156 transitions, 1441 flow, removed 32 selfloop flow, removed 7 redundant places. [2024-06-14 14:44:11,680 INFO L231 Difference]: Finished difference. Result has 189 places, 144 transitions, 1145 flow [2024-06-14 14:44:11,680 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1107, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1145, PETRI_PLACES=189, PETRI_TRANSITIONS=144} [2024-06-14 14:44:11,680 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 159 predicate places. [2024-06-14 14:44:11,680 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 144 transitions, 1145 flow [2024-06-14 14:44:11,681 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 14:44:11,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:44:11,681 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:44:11,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-14 14:44:11,681 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:44:11,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:44:11,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1516451533, now seen corresponding path program 10 times [2024-06-14 14:44:11,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:44:11,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612845030] [2024-06-14 14:44:11,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:44:11,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:44:11,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:44:18,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:44:18,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:44:18,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612845030] [2024-06-14 14:44:18,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612845030] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:44:18,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:44:18,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:44:18,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517078980] [2024-06-14 14:44:18,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:44:18,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:44:18,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:44:18,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:44:18,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:44:18,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:44:18,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 144 transitions, 1145 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:44:18,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:44:18,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:44:18,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:44:18,641 INFO L124 PetriNetUnfolderBase]: 379/706 cut-off events. [2024-06-14 14:44:18,641 INFO L125 PetriNetUnfolderBase]: For 38844/38844 co-relation queries the response was YES. [2024-06-14 14:44:18,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3985 conditions, 706 events. 379/706 cut-off events. For 38844/38844 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3412 event pairs, 42 based on Foata normal form. 2/706 useless extension candidates. Maximal degree in co-relation 3895. Up to 626 conditions per place. [2024-06-14 14:44:18,646 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 133 selfloop transitions, 25 changer transitions 0/160 dead transitions. [2024-06-14 14:44:18,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 160 transitions, 1561 flow [2024-06-14 14:44:18,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:44:18,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:44:18,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-14 14:44:18,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3709677419354839 [2024-06-14 14:44:18,647 INFO L175 Difference]: Start difference. First operand has 189 places, 144 transitions, 1145 flow. Second operand 10 states and 115 transitions. [2024-06-14 14:44:18,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 160 transitions, 1561 flow [2024-06-14 14:44:18,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 160 transitions, 1502 flow, removed 6 selfloop flow, removed 9 redundant places. [2024-06-14 14:44:18,716 INFO L231 Difference]: Finished difference. Result has 190 places, 146 transitions, 1215 flow [2024-06-14 14:44:18,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1086, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1215, PETRI_PLACES=190, PETRI_TRANSITIONS=146} [2024-06-14 14:44:18,716 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 160 predicate places. [2024-06-14 14:44:18,716 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 146 transitions, 1215 flow [2024-06-14 14:44:18,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:44:18,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:44:18,717 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:44:18,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-14 14:44:18,717 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:44:18,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:44:18,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1516658923, now seen corresponding path program 11 times [2024-06-14 14:44:18,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:44:18,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129939615] [2024-06-14 14:44:18,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:44:18,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:44:18,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:44:25,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:44:25,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:44:25,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129939615] [2024-06-14 14:44:25,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129939615] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:44:25,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:44:25,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:44:25,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471072108] [2024-06-14 14:44:25,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:44:25,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:44:25,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:44:25,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:44:25,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:44:26,136 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:44:26,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 146 transitions, 1215 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:44:26,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:44:26,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:44:26,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:44:26,532 INFO L124 PetriNetUnfolderBase]: 385/716 cut-off events. [2024-06-14 14:44:26,532 INFO L125 PetriNetUnfolderBase]: For 41071/41071 co-relation queries the response was YES. [2024-06-14 14:44:26,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4140 conditions, 716 events. 385/716 cut-off events. For 41071/41071 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3458 event pairs, 44 based on Foata normal form. 2/716 useless extension candidates. Maximal degree in co-relation 4050. Up to 619 conditions per place. [2024-06-14 14:44:26,538 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 131 selfloop transitions, 30 changer transitions 0/163 dead transitions. [2024-06-14 14:44:26,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 163 transitions, 1643 flow [2024-06-14 14:44:26,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:44:26,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:44:26,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-14 14:44:26,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38064516129032255 [2024-06-14 14:44:26,539 INFO L175 Difference]: Start difference. First operand has 190 places, 146 transitions, 1215 flow. Second operand 10 states and 118 transitions. [2024-06-14 14:44:26,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 163 transitions, 1643 flow [2024-06-14 14:44:26,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 163 transitions, 1502 flow, removed 36 selfloop flow, removed 10 redundant places. [2024-06-14 14:44:26,604 INFO L231 Difference]: Finished difference. Result has 190 places, 148 transitions, 1217 flow [2024-06-14 14:44:26,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1076, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1217, PETRI_PLACES=190, PETRI_TRANSITIONS=148} [2024-06-14 14:44:26,605 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 160 predicate places. [2024-06-14 14:44:26,605 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 148 transitions, 1217 flow [2024-06-14 14:44:26,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:44:26,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:44:26,605 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:44:26,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-14 14:44:26,606 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:44:26,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:44:26,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1516659078, now seen corresponding path program 14 times [2024-06-14 14:44:26,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:44:26,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850699144] [2024-06-14 14:44:26,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:44:26,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:44:26,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:44:33,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:44:33,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:44:33,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850699144] [2024-06-14 14:44:33,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850699144] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:44:33,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:44:33,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:44:33,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060280129] [2024-06-14 14:44:33,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:44:33,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:44:33,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:44:33,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:44:33,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:44:33,804 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:44:33,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 148 transitions, 1217 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:44:33,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:44:33,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:44:33,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:44:34,281 INFO L124 PetriNetUnfolderBase]: 409/768 cut-off events. [2024-06-14 14:44:34,282 INFO L125 PetriNetUnfolderBase]: For 67659/67659 co-relation queries the response was YES. [2024-06-14 14:44:34,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4332 conditions, 768 events. 409/768 cut-off events. For 67659/67659 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 3767 event pairs, 44 based on Foata normal form. 14/780 useless extension candidates. Maximal degree in co-relation 4243. Up to 589 conditions per place. [2024-06-14 14:44:34,288 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 128 selfloop transitions, 23 changer transitions 17/170 dead transitions. [2024-06-14 14:44:34,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 170 transitions, 1696 flow [2024-06-14 14:44:34,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:44:34,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:44:34,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-14 14:44:34,289 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-14 14:44:34,289 INFO L175 Difference]: Start difference. First operand has 190 places, 148 transitions, 1217 flow. Second operand 10 states and 124 transitions. [2024-06-14 14:44:34,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 170 transitions, 1696 flow [2024-06-14 14:44:34,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 170 transitions, 1571 flow, removed 34 selfloop flow, removed 8 redundant places. [2024-06-14 14:44:34,366 INFO L231 Difference]: Finished difference. Result has 192 places, 139 transitions, 1106 flow [2024-06-14 14:44:34,367 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1092, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1106, PETRI_PLACES=192, PETRI_TRANSITIONS=139} [2024-06-14 14:44:34,367 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 162 predicate places. [2024-06-14 14:44:34,367 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 139 transitions, 1106 flow [2024-06-14 14:44:34,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:44:34,368 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:44:34,368 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:44:34,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-14 14:44:34,368 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:44:34,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:44:34,368 INFO L85 PathProgramCache]: Analyzing trace with hash 907374869, now seen corresponding path program 12 times [2024-06-14 14:44:34,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:44:34,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666056522] [2024-06-14 14:44:34,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:44:34,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:44:34,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:44:41,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:44:41,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:44:41,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666056522] [2024-06-14 14:44:41,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666056522] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:44:41,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:44:41,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:44:41,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312991264] [2024-06-14 14:44:41,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:44:41,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:44:41,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:44:41,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:44:41,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:44:41,748 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:44:41,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 139 transitions, 1106 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:44:41,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:44:41,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:44:41,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:44:42,111 INFO L124 PetriNetUnfolderBase]: 355/672 cut-off events. [2024-06-14 14:44:42,111 INFO L125 PetriNetUnfolderBase]: For 37450/37450 co-relation queries the response was YES. [2024-06-14 14:44:42,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3623 conditions, 672 events. 355/672 cut-off events. For 37450/37450 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3253 event pairs, 37 based on Foata normal form. 2/672 useless extension candidates. Maximal degree in co-relation 3533. Up to 553 conditions per place. [2024-06-14 14:44:42,117 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 117 selfloop transitions, 37 changer transitions 0/156 dead transitions. [2024-06-14 14:44:42,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 156 transitions, 1522 flow [2024-06-14 14:44:42,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:44:42,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:44:42,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-14 14:44:42,118 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38064516129032255 [2024-06-14 14:44:42,118 INFO L175 Difference]: Start difference. First operand has 192 places, 139 transitions, 1106 flow. Second operand 10 states and 118 transitions. [2024-06-14 14:44:42,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 156 transitions, 1522 flow [2024-06-14 14:44:42,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 156 transitions, 1442 flow, removed 18 selfloop flow, removed 10 redundant places. [2024-06-14 14:44:42,187 INFO L231 Difference]: Finished difference. Result has 188 places, 141 transitions, 1185 flow [2024-06-14 14:44:42,188 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1034, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1185, PETRI_PLACES=188, PETRI_TRANSITIONS=141} [2024-06-14 14:44:42,188 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 158 predicate places. [2024-06-14 14:44:42,188 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 141 transitions, 1185 flow [2024-06-14 14:44:42,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:44:42,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:44:42,188 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:44:42,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-14 14:44:42,189 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:44:42,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:44:42,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1522165608, now seen corresponding path program 15 times [2024-06-14 14:44:42,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:44:42,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590184651] [2024-06-14 14:44:42,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:44:42,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:44:42,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:44:48,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:44:48,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:44:48,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590184651] [2024-06-14 14:44:48,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590184651] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:44:48,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:44:48,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:44:48,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995833613] [2024-06-14 14:44:48,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:44:48,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:44:48,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:44:48,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:44:48,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:44:48,872 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:44:48,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 141 transitions, 1185 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:44:48,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:44:48,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:44:48,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:44:49,216 INFO L124 PetriNetUnfolderBase]: 352/667 cut-off events. [2024-06-14 14:44:49,216 INFO L125 PetriNetUnfolderBase]: For 31750/31750 co-relation queries the response was YES. [2024-06-14 14:44:49,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3438 conditions, 667 events. 352/667 cut-off events. For 31750/31750 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3232 event pairs, 42 based on Foata normal form. 2/667 useless extension candidates. Maximal degree in co-relation 3349. Up to 610 conditions per place. [2024-06-14 14:44:49,221 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 122 selfloop transitions, 28 changer transitions 0/152 dead transitions. [2024-06-14 14:44:49,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 152 transitions, 1509 flow [2024-06-14 14:44:49,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:44:49,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:44:49,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2024-06-14 14:44:49,223 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35161290322580646 [2024-06-14 14:44:49,223 INFO L175 Difference]: Start difference. First operand has 188 places, 141 transitions, 1185 flow. Second operand 10 states and 109 transitions. [2024-06-14 14:44:49,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 152 transitions, 1509 flow [2024-06-14 14:44:49,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 152 transitions, 1362 flow, removed 38 selfloop flow, removed 8 redundant places. [2024-06-14 14:44:49,283 INFO L231 Difference]: Finished difference. Result has 190 places, 141 transitions, 1098 flow [2024-06-14 14:44:49,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1038, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1098, PETRI_PLACES=190, PETRI_TRANSITIONS=141} [2024-06-14 14:44:49,283 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 160 predicate places. [2024-06-14 14:44:49,283 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 141 transitions, 1098 flow [2024-06-14 14:44:49,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:44:49,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:44:49,284 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 14:44:49,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-14 14:44:49,284 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:44:49,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:44:49,284 INFO L85 PathProgramCache]: Analyzing trace with hash 222077449, now seen corresponding path program 1 times [2024-06-14 14:44:49,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:44:49,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844030859] [2024-06-14 14:44:49,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:44:49,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:44:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:44:55,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:44:55,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:44:55,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844030859] [2024-06-14 14:44:55,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844030859] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:44:55,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:44:55,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:44:55,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747164712] [2024-06-14 14:44:55,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:44:55,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:44:55,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:44:55,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:44:55,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:44:56,100 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:44:56,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 141 transitions, 1098 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:44:56,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:44:56,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:44:56,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:44:56,644 INFO L124 PetriNetUnfolderBase]: 393/754 cut-off events. [2024-06-14 14:44:56,644 INFO L125 PetriNetUnfolderBase]: For 65724/65724 co-relation queries the response was YES. [2024-06-14 14:44:56,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4411 conditions, 754 events. 393/754 cut-off events. For 65724/65724 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3736 event pairs, 59 based on Foata normal form. 8/760 useless extension candidates. Maximal degree in co-relation 4321. Up to 464 conditions per place. [2024-06-14 14:44:56,650 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 136 selfloop transitions, 21 changer transitions 18/177 dead transitions. [2024-06-14 14:44:56,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 177 transitions, 1763 flow [2024-06-14 14:44:56,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 14:44:56,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 14:44:56,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 146 transitions. [2024-06-14 14:44:56,651 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3924731182795699 [2024-06-14 14:44:56,651 INFO L175 Difference]: Start difference. First operand has 190 places, 141 transitions, 1098 flow. Second operand 12 states and 146 transitions. [2024-06-14 14:44:56,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 177 transitions, 1763 flow [2024-06-14 14:44:56,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 177 transitions, 1693 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-14 14:44:56,796 INFO L231 Difference]: Finished difference. Result has 193 places, 137 transitions, 1050 flow [2024-06-14 14:44:56,797 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1028, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1050, PETRI_PLACES=193, PETRI_TRANSITIONS=137} [2024-06-14 14:44:56,797 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 163 predicate places. [2024-06-14 14:44:56,797 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 137 transitions, 1050 flow [2024-06-14 14:44:56,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:44:56,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:44:56,798 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 14:44:56,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-14 14:44:56,798 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:44:56,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:44:56,799 INFO L85 PathProgramCache]: Analyzing trace with hash 280285219, now seen corresponding path program 2 times [2024-06-14 14:44:56,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:44:56,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260146884] [2024-06-14 14:44:56,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:44:56,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:44:56,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:45:03,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:45:03,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:45:03,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260146884] [2024-06-14 14:45:03,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260146884] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:45:03,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:45:03,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:45:03,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836703417] [2024-06-14 14:45:03,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:45:03,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:45:03,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:45:03,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:45:03,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:45:03,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:45:03,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 137 transitions, 1050 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:45:03,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:45:03,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:45:03,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:45:04,493 INFO L124 PetriNetUnfolderBase]: 402/775 cut-off events. [2024-06-14 14:45:04,493 INFO L125 PetriNetUnfolderBase]: For 90466/90466 co-relation queries the response was YES. [2024-06-14 14:45:04,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5296 conditions, 775 events. 402/775 cut-off events. For 90466/90466 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3898 event pairs, 74 based on Foata normal form. 8/781 useless extension candidates. Maximal degree in co-relation 5205. Up to 591 conditions per place. [2024-06-14 14:45:04,500 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 136 selfloop transitions, 22 changer transitions 9/169 dead transitions. [2024-06-14 14:45:04,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 169 transitions, 1691 flow [2024-06-14 14:45:04,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 14:45:04,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 14:45:04,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 143 transitions. [2024-06-14 14:45:04,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3844086021505376 [2024-06-14 14:45:04,501 INFO L175 Difference]: Start difference. First operand has 193 places, 137 transitions, 1050 flow. Second operand 12 states and 143 transitions. [2024-06-14 14:45:04,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 169 transitions, 1691 flow [2024-06-14 14:45:04,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 169 transitions, 1644 flow, removed 8 selfloop flow, removed 11 redundant places. [2024-06-14 14:45:04,631 INFO L231 Difference]: Finished difference. Result has 188 places, 135 transitions, 1044 flow [2024-06-14 14:45:04,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1011, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1044, PETRI_PLACES=188, PETRI_TRANSITIONS=135} [2024-06-14 14:45:04,631 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 158 predicate places. [2024-06-14 14:45:04,632 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 135 transitions, 1044 flow [2024-06-14 14:45:04,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:45:04,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:45:04,632 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 14:45:04,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-14 14:45:04,632 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:45:04,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:45:04,633 INFO L85 PathProgramCache]: Analyzing trace with hash 280289869, now seen corresponding path program 3 times [2024-06-14 14:45:04,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:45:04,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749036361] [2024-06-14 14:45:04,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:45:04,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:45:04,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:45:11,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:45:11,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:45:11,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749036361] [2024-06-14 14:45:11,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749036361] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:45:11,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:45:11,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:45:11,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957985799] [2024-06-14 14:45:11,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:45:11,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:45:11,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:45:11,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:45:11,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:45:11,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:45:11,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 135 transitions, 1044 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:45:11,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:45:11,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:45:11,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:45:12,083 INFO L124 PetriNetUnfolderBase]: 371/714 cut-off events. [2024-06-14 14:45:12,084 INFO L125 PetriNetUnfolderBase]: For 66667/66667 co-relation queries the response was YES. [2024-06-14 14:45:12,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4313 conditions, 714 events. 371/714 cut-off events. For 66667/66667 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3514 event pairs, 65 based on Foata normal form. 10/722 useless extension candidates. Maximal degree in co-relation 4225. Up to 591 conditions per place. [2024-06-14 14:45:12,090 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 126 selfloop transitions, 19 changer transitions 15/162 dead transitions. [2024-06-14 14:45:12,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 162 transitions, 1495 flow [2024-06-14 14:45:12,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 14:45:12,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 14:45:12,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 137 transitions. [2024-06-14 14:45:12,091 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3682795698924731 [2024-06-14 14:45:12,091 INFO L175 Difference]: Start difference. First operand has 188 places, 135 transitions, 1044 flow. Second operand 12 states and 137 transitions. [2024-06-14 14:45:12,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 162 transitions, 1495 flow [2024-06-14 14:45:12,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 162 transitions, 1449 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-06-14 14:45:12,190 INFO L231 Difference]: Finished difference. Result has 187 places, 131 transitions, 1012 flow [2024-06-14 14:45:12,190 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=998, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1012, PETRI_PLACES=187, PETRI_TRANSITIONS=131} [2024-06-14 14:45:12,190 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 157 predicate places. [2024-06-14 14:45:12,191 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 131 transitions, 1012 flow [2024-06-14 14:45:12,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:45:12,191 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:45:12,191 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 14:45:12,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-14 14:45:12,191 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:45:12,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:45:12,192 INFO L85 PathProgramCache]: Analyzing trace with hash 280169899, now seen corresponding path program 4 times [2024-06-14 14:45:12,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:45:12,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643766560] [2024-06-14 14:45:12,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:45:12,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:45:12,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:45:20,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:45:20,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:45:20,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643766560] [2024-06-14 14:45:20,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643766560] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:45:20,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:45:20,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:45:20,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713764842] [2024-06-14 14:45:20,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:45:20,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:45:20,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:45:20,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:45:20,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:45:20,470 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:45:20,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 131 transitions, 1012 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:45:20,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:45:20,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:45:20,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:45:20,945 INFO L124 PetriNetUnfolderBase]: 358/691 cut-off events. [2024-06-14 14:45:20,945 INFO L125 PetriNetUnfolderBase]: For 59826/59826 co-relation queries the response was YES. [2024-06-14 14:45:20,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4132 conditions, 691 events. 358/691 cut-off events. For 59826/59826 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3370 event pairs, 59 based on Foata normal form. 8/697 useless extension candidates. Maximal degree in co-relation 4045. Up to 573 conditions per place. [2024-06-14 14:45:20,951 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 120 selfloop transitions, 16 changer transitions 20/158 dead transitions. [2024-06-14 14:45:20,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 158 transitions, 1417 flow [2024-06-14 14:45:20,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 14:45:20,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 14:45:20,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 135 transitions. [2024-06-14 14:45:20,952 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3629032258064516 [2024-06-14 14:45:20,953 INFO L175 Difference]: Start difference. First operand has 187 places, 131 transitions, 1012 flow. Second operand 12 states and 135 transitions. [2024-06-14 14:45:20,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 158 transitions, 1417 flow [2024-06-14 14:45:21,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 158 transitions, 1373 flow, removed 3 selfloop flow, removed 11 redundant places. [2024-06-14 14:45:21,046 INFO L231 Difference]: Finished difference. Result has 182 places, 126 transitions, 971 flow [2024-06-14 14:45:21,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=968, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=971, PETRI_PLACES=182, PETRI_TRANSITIONS=126} [2024-06-14 14:45:21,047 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 152 predicate places. [2024-06-14 14:45:21,047 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 126 transitions, 971 flow [2024-06-14 14:45:21,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:45:21,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:45:21,047 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 14:45:21,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-14 14:45:21,048 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:45:21,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:45:21,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1827010539, now seen corresponding path program 5 times [2024-06-14 14:45:21,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:45:21,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733700757] [2024-06-14 14:45:21,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:45:21,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:45:21,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:45:27,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:45:27,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:45:27,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733700757] [2024-06-14 14:45:27,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733700757] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:45:27,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:45:27,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:45:27,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717761293] [2024-06-14 14:45:27,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:45:27,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:45:27,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:45:27,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:45:27,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:45:28,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:45:28,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 126 transitions, 971 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:45:28,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:45:28,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:45:28,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:45:28,732 INFO L124 PetriNetUnfolderBase]: 343/661 cut-off events. [2024-06-14 14:45:28,732 INFO L125 PetriNetUnfolderBase]: For 56412/56412 co-relation queries the response was YES. [2024-06-14 14:45:28,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3971 conditions, 661 events. 343/661 cut-off events. For 56412/56412 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3178 event pairs, 51 based on Foata normal form. 8/667 useless extension candidates. Maximal degree in co-relation 3886. Up to 464 conditions per place. [2024-06-14 14:45:28,737 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 125 selfloop transitions, 15 changer transitions 12/154 dead transitions. [2024-06-14 14:45:28,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 154 transitions, 1560 flow [2024-06-14 14:45:28,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:45:28,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:45:28,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2024-06-14 14:45:28,738 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375366568914956 [2024-06-14 14:45:28,738 INFO L175 Difference]: Start difference. First operand has 182 places, 126 transitions, 971 flow. Second operand 11 states and 128 transitions. [2024-06-14 14:45:28,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 154 transitions, 1560 flow [2024-06-14 14:45:28,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 154 transitions, 1504 flow, removed 12 selfloop flow, removed 12 redundant places. [2024-06-14 14:45:28,819 INFO L231 Difference]: Finished difference. Result has 173 places, 123 transitions, 939 flow [2024-06-14 14:45:28,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=927, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=939, PETRI_PLACES=173, PETRI_TRANSITIONS=123} [2024-06-14 14:45:28,820 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 143 predicate places. [2024-06-14 14:45:28,820 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 123 transitions, 939 flow [2024-06-14 14:45:28,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:45:28,820 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:45:28,820 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 14:45:28,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-14 14:45:28,820 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:45:28,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:45:28,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1692246997, now seen corresponding path program 6 times [2024-06-14 14:45:28,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:45:28,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567262732] [2024-06-14 14:45:28,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:45:28,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:45:28,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:45:36,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:45:36,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:45:36,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567262732] [2024-06-14 14:45:36,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567262732] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:45:36,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:45:36,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:45:36,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575472891] [2024-06-14 14:45:36,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:45:36,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:45:36,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:45:36,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:45:36,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:45:37,001 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:45:37,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 123 transitions, 939 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:45:37,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:45:37,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:45:37,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:45:37,424 INFO L124 PetriNetUnfolderBase]: 337/651 cut-off events. [2024-06-14 14:45:37,425 INFO L125 PetriNetUnfolderBase]: For 53304/53304 co-relation queries the response was YES. [2024-06-14 14:45:37,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3893 conditions, 651 events. 337/651 cut-off events. For 53304/53304 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3141 event pairs, 61 based on Foata normal form. 10/659 useless extension candidates. Maximal degree in co-relation 3812. Up to 561 conditions per place. [2024-06-14 14:45:37,429 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 119 selfloop transitions, 11 changer transitions 14/146 dead transitions. [2024-06-14 14:45:37,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 146 transitions, 1346 flow [2024-06-14 14:45:37,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 14:45:37,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 14:45:37,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 127 transitions. [2024-06-14 14:45:37,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34139784946236557 [2024-06-14 14:45:37,431 INFO L175 Difference]: Start difference. First operand has 173 places, 123 transitions, 939 flow. Second operand 12 states and 127 transitions. [2024-06-14 14:45:37,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 146 transitions, 1346 flow [2024-06-14 14:45:37,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 146 transitions, 1316 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-14 14:45:37,507 INFO L231 Difference]: Finished difference. Result has 172 places, 120 transitions, 916 flow [2024-06-14 14:45:37,507 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=909, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=916, PETRI_PLACES=172, PETRI_TRANSITIONS=120} [2024-06-14 14:45:37,507 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 142 predicate places. [2024-06-14 14:45:37,507 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 120 transitions, 916 flow [2024-06-14 14:45:37,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:45:37,508 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:45:37,508 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 14:45:37,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-14 14:45:37,508 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:45:37,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:45:37,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1827125859, now seen corresponding path program 7 times [2024-06-14 14:45:37,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:45:37,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120857945] [2024-06-14 14:45:37,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:45:37,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:45:37,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:45:44,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:45:44,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:45:44,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120857945] [2024-06-14 14:45:44,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120857945] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:45:44,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:45:44,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:45:44,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935147234] [2024-06-14 14:45:44,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:45:44,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:45:44,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:45:44,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:45:44,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:45:44,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:45:44,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 120 transitions, 916 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:45:44,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:45:44,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:45:44,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:45:45,068 INFO L124 PetriNetUnfolderBase]: 345/671 cut-off events. [2024-06-14 14:45:45,068 INFO L125 PetriNetUnfolderBase]: For 57947/57947 co-relation queries the response was YES. [2024-06-14 14:45:45,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4328 conditions, 671 events. 345/671 cut-off events. For 57947/57947 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3253 event pairs, 67 based on Foata normal form. 8/677 useless extension candidates. Maximal degree in co-relation 4248. Up to 520 conditions per place. [2024-06-14 14:45:45,073 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 123 selfloop transitions, 13 changer transitions 7/145 dead transitions. [2024-06-14 14:45:45,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 145 transitions, 1464 flow [2024-06-14 14:45:45,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:45:45,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:45:45,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2024-06-14 14:45:45,074 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-14 14:45:45,074 INFO L175 Difference]: Start difference. First operand has 172 places, 120 transitions, 916 flow. Second operand 11 states and 124 transitions. [2024-06-14 14:45:45,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 145 transitions, 1464 flow [2024-06-14 14:45:45,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 145 transitions, 1434 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-14 14:45:45,157 INFO L231 Difference]: Finished difference. Result has 169 places, 118 transitions, 902 flow [2024-06-14 14:45:45,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=902, PETRI_PLACES=169, PETRI_TRANSITIONS=118} [2024-06-14 14:45:45,173 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 139 predicate places. [2024-06-14 14:45:45,173 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 118 transitions, 902 flow [2024-06-14 14:45:45,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:45:45,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:45:45,173 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 14:45:45,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-14 14:45:45,173 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:45:45,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:45:45,174 INFO L85 PathProgramCache]: Analyzing trace with hash 370729909, now seen corresponding path program 8 times [2024-06-14 14:45:45,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:45:45,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747472050] [2024-06-14 14:45:45,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:45:45,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:45:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:45:52,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:45:52,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:45:52,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747472050] [2024-06-14 14:45:52,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747472050] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:45:52,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:45:52,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:45:52,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621430146] [2024-06-14 14:45:52,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:45:52,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:45:52,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:45:52,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:45:52,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:45:52,395 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:45:52,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 118 transitions, 902 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:45:52,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:45:52,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:45:52,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:45:52,853 INFO L124 PetriNetUnfolderBase]: 318/618 cut-off events. [2024-06-14 14:45:52,854 INFO L125 PetriNetUnfolderBase]: For 45041/45041 co-relation queries the response was YES. [2024-06-14 14:45:52,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3723 conditions, 618 events. 318/618 cut-off events. For 45041/45041 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2936 event pairs, 60 based on Foata normal form. 6/622 useless extension candidates. Maximal degree in co-relation 3644. Up to 548 conditions per place. [2024-06-14 14:45:52,857 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 120 selfloop transitions, 16 changer transitions 0/138 dead transitions. [2024-06-14 14:45:52,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 138 transitions, 1284 flow [2024-06-14 14:45:52,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:45:52,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:45:52,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 118 transitions. [2024-06-14 14:45:52,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3460410557184751 [2024-06-14 14:45:52,859 INFO L175 Difference]: Start difference. First operand has 169 places, 118 transitions, 902 flow. Second operand 11 states and 118 transitions. [2024-06-14 14:45:52,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 138 transitions, 1284 flow [2024-06-14 14:45:52,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 138 transitions, 1256 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-14 14:45:52,925 INFO L231 Difference]: Finished difference. Result has 168 places, 120 transitions, 986 flow [2024-06-14 14:45:52,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=986, PETRI_PLACES=168, PETRI_TRANSITIONS=120} [2024-06-14 14:45:52,925 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 138 predicate places. [2024-06-14 14:45:52,925 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 120 transitions, 986 flow [2024-06-14 14:45:52,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:45:52,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:45:52,926 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 14:45:52,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-14 14:45:52,926 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:45:52,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:45:52,927 INFO L85 PathProgramCache]: Analyzing trace with hash 375193909, now seen corresponding path program 9 times [2024-06-14 14:45:52,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:45:52,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179002096] [2024-06-14 14:45:52,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:45:52,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:45:52,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:45:59,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:45:59,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:45:59,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179002096] [2024-06-14 14:45:59,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179002096] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:45:59,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:45:59,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:45:59,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547504152] [2024-06-14 14:45:59,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:45:59,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:45:59,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:45:59,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:45:59,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:46:00,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:46:00,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 120 transitions, 986 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:46:00,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:46:00,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:46:00,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:46:00,574 INFO L124 PetriNetUnfolderBase]: 308/600 cut-off events. [2024-06-14 14:46:00,575 INFO L125 PetriNetUnfolderBase]: For 34122/34122 co-relation queries the response was YES. [2024-06-14 14:46:00,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3240 conditions, 600 events. 308/600 cut-off events. For 34122/34122 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2826 event pairs, 48 based on Foata normal form. 8/606 useless extension candidates. Maximal degree in co-relation 3162. Up to 526 conditions per place. [2024-06-14 14:46:00,580 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 116 selfloop transitions, 8 changer transitions 13/139 dead transitions. [2024-06-14 14:46:00,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 139 transitions, 1334 flow [2024-06-14 14:46:00,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:46:00,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:46:00,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2024-06-14 14:46:00,581 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33724340175953077 [2024-06-14 14:46:00,582 INFO L175 Difference]: Start difference. First operand has 168 places, 120 transitions, 986 flow. Second operand 11 states and 115 transitions. [2024-06-14 14:46:00,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 139 transitions, 1334 flow [2024-06-14 14:46:00,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 139 transitions, 1240 flow, removed 33 selfloop flow, removed 9 redundant places. [2024-06-14 14:46:00,686 INFO L231 Difference]: Finished difference. Result has 170 places, 116 transitions, 877 flow [2024-06-14 14:46:00,686 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=877, PETRI_PLACES=170, PETRI_TRANSITIONS=116} [2024-06-14 14:46:00,687 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 140 predicate places. [2024-06-14 14:46:00,687 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 116 transitions, 877 flow [2024-06-14 14:46:00,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:46:00,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:46:00,687 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 14:46:00,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-14 14:46:00,688 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:46:00,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:46:00,688 INFO L85 PathProgramCache]: Analyzing trace with hash -332723063, now seen corresponding path program 1 times [2024-06-14 14:46:00,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:46:00,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016326943] [2024-06-14 14:46:00,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:46:00,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:46:00,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:46:08,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 14:46:08,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:46:08,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016326943] [2024-06-14 14:46:08,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016326943] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:46:08,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:46:08,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:46:08,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729379297] [2024-06-14 14:46:08,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:46:08,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:46:08,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:46:08,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:46:08,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:46:08,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:46:08,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 116 transitions, 877 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:46:08,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:46:08,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:46:08,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:46:08,871 INFO L124 PetriNetUnfolderBase]: 294/570 cut-off events. [2024-06-14 14:46:08,872 INFO L125 PetriNetUnfolderBase]: For 27517/27517 co-relation queries the response was YES. [2024-06-14 14:46:08,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2973 conditions, 570 events. 294/570 cut-off events. For 27517/27517 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2667 event pairs, 46 based on Foata normal form. 2/570 useless extension candidates. Maximal degree in co-relation 2894. Up to 444 conditions per place. [2024-06-14 14:46:08,876 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 103 selfloop transitions, 29 changer transitions 0/134 dead transitions. [2024-06-14 14:46:08,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 134 transitions, 1192 flow [2024-06-14 14:46:08,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:46:08,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:46:08,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2024-06-14 14:46:08,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3774193548387097 [2024-06-14 14:46:08,877 INFO L175 Difference]: Start difference. First operand has 170 places, 116 transitions, 877 flow. Second operand 10 states and 117 transitions. [2024-06-14 14:46:08,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 134 transitions, 1192 flow [2024-06-14 14:46:08,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 134 transitions, 1147 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-14 14:46:08,928 INFO L231 Difference]: Finished difference. Result has 164 places, 119 transitions, 922 flow [2024-06-14 14:46:08,928 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=832, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=922, PETRI_PLACES=164, PETRI_TRANSITIONS=119} [2024-06-14 14:46:08,929 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 134 predicate places. [2024-06-14 14:46:08,929 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 119 transitions, 922 flow [2024-06-14 14:46:08,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:46:08,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:46:08,929 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 14:46:08,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-14 14:46:08,929 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:46:08,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:46:08,930 INFO L85 PathProgramCache]: Analyzing trace with hash -332907637, now seen corresponding path program 10 times [2024-06-14 14:46:08,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:46:08,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184153198] [2024-06-14 14:46:08,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:46:08,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:46:08,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:46:16,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:46:16,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:46:16,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184153198] [2024-06-14 14:46:16,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184153198] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:46:16,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:46:16,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:46:16,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993325330] [2024-06-14 14:46:16,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:46:16,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:46:16,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:46:16,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:46:16,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:46:16,233 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:46:16,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 119 transitions, 922 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:46:16,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:46:16,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:46:16,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:46:16,675 INFO L124 PetriNetUnfolderBase]: 335/657 cut-off events. [2024-06-14 14:46:16,675 INFO L125 PetriNetUnfolderBase]: For 49374/49374 co-relation queries the response was YES. [2024-06-14 14:46:16,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3958 conditions, 657 events. 335/657 cut-off events. For 49374/49374 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3199 event pairs, 59 based on Foata normal form. 8/663 useless extension candidates. Maximal degree in co-relation 3880. Up to 425 conditions per place. [2024-06-14 14:46:16,679 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 106 selfloop transitions, 29 changer transitions 7/144 dead transitions. [2024-06-14 14:46:16,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 144 transitions, 1462 flow [2024-06-14 14:46:16,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:46:16,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:46:16,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2024-06-14 14:46:16,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39589442815249265 [2024-06-14 14:46:16,681 INFO L175 Difference]: Start difference. First operand has 164 places, 119 transitions, 922 flow. Second operand 11 states and 135 transitions. [2024-06-14 14:46:16,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 144 transitions, 1462 flow [2024-06-14 14:46:16,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 144 transitions, 1400 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-14 14:46:16,742 INFO L231 Difference]: Finished difference. Result has 168 places, 117 transitions, 909 flow [2024-06-14 14:46:16,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=860, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=909, PETRI_PLACES=168, PETRI_TRANSITIONS=117} [2024-06-14 14:46:16,742 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 138 predicate places. [2024-06-14 14:46:16,743 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 117 transitions, 909 flow [2024-06-14 14:46:16,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:46:16,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:46:16,743 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 14:46:16,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-14 14:46:16,743 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:46:16,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:46:16,744 INFO L85 PathProgramCache]: Analyzing trace with hash -503605417, now seen corresponding path program 11 times [2024-06-14 14:46:16,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:46:16,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851398085] [2024-06-14 14:46:16,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:46:16,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:46:16,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:46:23,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:46:23,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:46:23,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851398085] [2024-06-14 14:46:23,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851398085] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:46:23,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:46:23,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:46:23,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966094322] [2024-06-14 14:46:23,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:46:23,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:46:23,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:46:23,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:46:23,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:46:23,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:46:23,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 117 transitions, 909 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:46:23,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:46:23,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:46:23,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:46:24,034 INFO L124 PetriNetUnfolderBase]: 333/655 cut-off events. [2024-06-14 14:46:24,034 INFO L125 PetriNetUnfolderBase]: For 54220/54220 co-relation queries the response was YES. [2024-06-14 14:46:24,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4031 conditions, 655 events. 333/655 cut-off events. For 54220/54220 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3194 event pairs, 67 based on Foata normal form. 10/663 useless extension candidates. Maximal degree in co-relation 3952. Up to 441 conditions per place. [2024-06-14 14:46:24,046 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 89 selfloop transitions, 37 changer transitions 11/139 dead transitions. [2024-06-14 14:46:24,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 139 transitions, 1295 flow [2024-06-14 14:46:24,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:46:24,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:46:24,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2024-06-14 14:46:24,048 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39882697947214074 [2024-06-14 14:46:24,048 INFO L175 Difference]: Start difference. First operand has 168 places, 117 transitions, 909 flow. Second operand 11 states and 136 transitions. [2024-06-14 14:46:24,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 139 transitions, 1295 flow [2024-06-14 14:46:24,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 139 transitions, 1235 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-14 14:46:24,121 INFO L231 Difference]: Finished difference. Result has 167 places, 114 transitions, 910 flow [2024-06-14 14:46:24,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=849, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=910, PETRI_PLACES=167, PETRI_TRANSITIONS=114} [2024-06-14 14:46:24,122 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 137 predicate places. [2024-06-14 14:46:24,122 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 114 transitions, 910 flow [2024-06-14 14:46:24,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:46:24,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:46:24,122 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 14:46:24,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-14 14:46:24,122 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:46:24,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:46:24,123 INFO L85 PathProgramCache]: Analyzing trace with hash -498956843, now seen corresponding path program 2 times [2024-06-14 14:46:24,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:46:24,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680052340] [2024-06-14 14:46:24,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:46:24,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:46:24,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:46:30,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:46:30,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:46:30,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680052340] [2024-06-14 14:46:30,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680052340] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:46:30,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:46:30,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:46:30,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355592669] [2024-06-14 14:46:30,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:46:30,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:46:30,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:46:30,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:46:30,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:46:30,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:46:30,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 114 transitions, 910 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:46:30,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:46:30,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:46:30,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:46:31,176 INFO L124 PetriNetUnfolderBase]: 313/615 cut-off events. [2024-06-14 14:46:31,176 INFO L125 PetriNetUnfolderBase]: For 40753/40753 co-relation queries the response was YES. [2024-06-14 14:46:31,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3826 conditions, 615 events. 313/615 cut-off events. For 40753/40753 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2944 event pairs, 69 based on Foata normal form. 2/615 useless extension candidates. Maximal degree in co-relation 3748. Up to 489 conditions per place. [2024-06-14 14:46:31,180 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 99 selfloop transitions, 29 changer transitions 0/130 dead transitions. [2024-06-14 14:46:31,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 130 transitions, 1210 flow [2024-06-14 14:46:31,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:46:31,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:46:31,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-14 14:46:31,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38064516129032255 [2024-06-14 14:46:31,181 INFO L175 Difference]: Start difference. First operand has 167 places, 114 transitions, 910 flow. Second operand 10 states and 118 transitions. [2024-06-14 14:46:31,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 130 transitions, 1210 flow [2024-06-14 14:46:31,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 130 transitions, 1128 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-14 14:46:31,252 INFO L231 Difference]: Finished difference. Result has 164 places, 115 transitions, 904 flow [2024-06-14 14:46:31,252 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=904, PETRI_PLACES=164, PETRI_TRANSITIONS=115} [2024-06-14 14:46:31,252 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 134 predicate places. [2024-06-14 14:46:31,252 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 115 transitions, 904 flow [2024-06-14 14:46:31,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:46:31,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:46:31,253 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 14:46:31,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-14 14:46:31,253 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:46:31,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:46:31,253 INFO L85 PathProgramCache]: Analyzing trace with hash -326236313, now seen corresponding path program 3 times [2024-06-14 14:46:31,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:46:31,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047839126] [2024-06-14 14:46:31,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:46:31,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:46:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:46:38,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:46:38,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:46:38,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047839126] [2024-06-14 14:46:38,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047839126] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:46:38,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:46:38,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:46:38,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467765937] [2024-06-14 14:46:38,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:46:38,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:46:38,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:46:38,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:46:38,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:46:38,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:46:38,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 115 transitions, 904 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:46:38,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:46:38,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:46:38,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:46:38,857 INFO L124 PetriNetUnfolderBase]: 321/631 cut-off events. [2024-06-14 14:46:38,858 INFO L125 PetriNetUnfolderBase]: For 39422/39422 co-relation queries the response was YES. [2024-06-14 14:46:38,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3845 conditions, 631 events. 321/631 cut-off events. For 39422/39422 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3073 event pairs, 66 based on Foata normal form. 2/631 useless extension candidates. Maximal degree in co-relation 3768. Up to 488 conditions per place. [2024-06-14 14:46:38,862 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 100 selfloop transitions, 33 changer transitions 0/135 dead transitions. [2024-06-14 14:46:38,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 135 transitions, 1248 flow [2024-06-14 14:46:38,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:46:38,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:46:38,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-14 14:46:38,863 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3709677419354839 [2024-06-14 14:46:38,863 INFO L175 Difference]: Start difference. First operand has 164 places, 115 transitions, 904 flow. Second operand 10 states and 115 transitions. [2024-06-14 14:46:38,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 135 transitions, 1248 flow [2024-06-14 14:46:38,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 135 transitions, 1177 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-14 14:46:38,924 INFO L231 Difference]: Finished difference. Result has 168 places, 120 transitions, 976 flow [2024-06-14 14:46:38,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=833, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=976, PETRI_PLACES=168, PETRI_TRANSITIONS=120} [2024-06-14 14:46:38,924 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 138 predicate places. [2024-06-14 14:46:38,924 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 120 transitions, 976 flow [2024-06-14 14:46:38,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:46:38,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:46:38,925 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 14:46:38,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-14 14:46:38,925 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:46:38,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:46:38,925 INFO L85 PathProgramCache]: Analyzing trace with hash -2024189169, now seen corresponding path program 4 times [2024-06-14 14:46:38,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:46:38,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576844390] [2024-06-14 14:46:38,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:46:38,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:46:38,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:46:45,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:46:45,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:46:45,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576844390] [2024-06-14 14:46:45,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576844390] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:46:45,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:46:45,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:46:45,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760705202] [2024-06-14 14:46:45,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:46:45,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:46:45,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:46:45,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:46:45,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:46:45,506 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:46:45,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 120 transitions, 976 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 14:46:45,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:46:45,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:46:45,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:46:45,780 INFO L124 PetriNetUnfolderBase]: 325/639 cut-off events. [2024-06-14 14:46:45,780 INFO L125 PetriNetUnfolderBase]: For 41274/41274 co-relation queries the response was YES. [2024-06-14 14:46:45,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4000 conditions, 639 events. 325/639 cut-off events. For 41274/41274 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3115 event pairs, 65 based on Foata normal form. 2/639 useless extension candidates. Maximal degree in co-relation 3921. Up to 487 conditions per place. [2024-06-14 14:46:45,786 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 100 selfloop transitions, 33 changer transitions 0/135 dead transitions. [2024-06-14 14:46:45,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 135 transitions, 1292 flow [2024-06-14 14:46:45,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:46:45,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:46:45,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-14 14:46:45,787 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3709677419354839 [2024-06-14 14:46:45,787 INFO L175 Difference]: Start difference. First operand has 168 places, 120 transitions, 976 flow. Second operand 10 states and 115 transitions. [2024-06-14 14:46:45,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 135 transitions, 1292 flow [2024-06-14 14:46:45,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 135 transitions, 1245 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-14 14:46:45,863 INFO L231 Difference]: Finished difference. Result has 174 places, 121 transitions, 1017 flow [2024-06-14 14:46:45,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=929, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1017, PETRI_PLACES=174, PETRI_TRANSITIONS=121} [2024-06-14 14:46:45,863 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 144 predicate places. [2024-06-14 14:46:45,864 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 121 transitions, 1017 flow [2024-06-14 14:46:45,864 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 14:46:45,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:46:45,864 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 14:46:45,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-14 14:46:45,864 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:46:45,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:46:45,865 INFO L85 PathProgramCache]: Analyzing trace with hash -503610067, now seen corresponding path program 12 times [2024-06-14 14:46:45,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:46:45,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232465702] [2024-06-14 14:46:45,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:46:45,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:46:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:46:51,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:46:51,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:46:51,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232465702] [2024-06-14 14:46:51,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232465702] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:46:51,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:46:51,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:46:51,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246136445] [2024-06-14 14:46:51,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:46:51,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:46:51,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:46:51,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:46:51,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:46:52,162 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:46:52,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 121 transitions, 1017 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:46:52,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:46:52,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:46:52,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:46:52,561 INFO L124 PetriNetUnfolderBase]: 337/667 cut-off events. [2024-06-14 14:46:52,562 INFO L125 PetriNetUnfolderBase]: For 51156/51156 co-relation queries the response was YES. [2024-06-14 14:46:52,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4150 conditions, 667 events. 337/667 cut-off events. For 51156/51156 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3310 event pairs, 65 based on Foata normal form. 8/673 useless extension candidates. Maximal degree in co-relation 4070. Up to 459 conditions per place. [2024-06-14 14:46:52,567 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 90 selfloop transitions, 38 changer transitions 11/141 dead transitions. [2024-06-14 14:46:52,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 141 transitions, 1375 flow [2024-06-14 14:46:52,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:46:52,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:46:52,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2024-06-14 14:46:52,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39002932551319647 [2024-06-14 14:46:52,568 INFO L175 Difference]: Start difference. First operand has 174 places, 121 transitions, 1017 flow. Second operand 11 states and 133 transitions. [2024-06-14 14:46:52,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 141 transitions, 1375 flow [2024-06-14 14:46:52,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 141 transitions, 1297 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-14 14:46:52,664 INFO L231 Difference]: Finished difference. Result has 177 places, 118 transitions, 1001 flow [2024-06-14 14:46:52,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=939, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1001, PETRI_PLACES=177, PETRI_TRANSITIONS=118} [2024-06-14 14:46:52,664 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 147 predicate places. [2024-06-14 14:46:52,665 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 118 transitions, 1001 flow [2024-06-14 14:46:52,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:46:52,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:46:52,665 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 14:46:52,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-14 14:46:52,665 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:46:52,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:46:52,666 INFO L85 PathProgramCache]: Analyzing trace with hash -499136767, now seen corresponding path program 13 times [2024-06-14 14:46:52,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:46:52,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674658791] [2024-06-14 14:46:52,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:46:52,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:46:52,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:46:59,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:46:59,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:46:59,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674658791] [2024-06-14 14:46:59,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674658791] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:46:59,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:46:59,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:46:59,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593685693] [2024-06-14 14:46:59,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:46:59,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:46:59,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:46:59,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:46:59,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:46:59,346 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:46:59,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 118 transitions, 1001 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:46:59,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:46:59,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:46:59,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:46:59,785 INFO L124 PetriNetUnfolderBase]: 334/662 cut-off events. [2024-06-14 14:46:59,786 INFO L125 PetriNetUnfolderBase]: For 56520/56520 co-relation queries the response was YES. [2024-06-14 14:46:59,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4203 conditions, 662 events. 334/662 cut-off events. For 56520/56520 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3270 event pairs, 75 based on Foata normal form. 10/670 useless extension candidates. Maximal degree in co-relation 4122. Up to 465 conditions per place. [2024-06-14 14:46:59,790 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 92 selfloop transitions, 34 changer transitions 11/139 dead transitions. [2024-06-14 14:46:59,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 139 transitions, 1393 flow [2024-06-14 14:46:59,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:46:59,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:46:59,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2024-06-14 14:46:59,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39589442815249265 [2024-06-14 14:46:59,791 INFO L175 Difference]: Start difference. First operand has 177 places, 118 transitions, 1001 flow. Second operand 11 states and 135 transitions. [2024-06-14 14:46:59,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 139 transitions, 1393 flow [2024-06-14 14:46:59,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 139 transitions, 1311 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-14 14:46:59,878 INFO L231 Difference]: Finished difference. Result has 173 places, 115 transitions, 974 flow [2024-06-14 14:46:59,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=919, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=974, PETRI_PLACES=173, PETRI_TRANSITIONS=115} [2024-06-14 14:46:59,879 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 143 predicate places. [2024-06-14 14:46:59,879 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 115 transitions, 974 flow [2024-06-14 14:46:59,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:46:59,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:46:59,879 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 14:46:59,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-14 14:46:59,880 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:46:59,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:46:59,880 INFO L85 PathProgramCache]: Analyzing trace with hash -2030864213, now seen corresponding path program 14 times [2024-06-14 14:46:59,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:46:59,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124889876] [2024-06-14 14:46:59,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:46:59,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:46:59,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:47:06,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:47:06,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:47:06,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124889876] [2024-06-14 14:47:06,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124889876] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:47:06,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:47:06,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:47:06,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676838076] [2024-06-14 14:47:06,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:47:06,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:47:06,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:47:06,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:47:06,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:47:07,114 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:47:07,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 115 transitions, 974 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:47:07,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:47:07,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:47:07,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:47:07,426 INFO L124 PetriNetUnfolderBase]: 297/591 cut-off events. [2024-06-14 14:47:07,427 INFO L125 PetriNetUnfolderBase]: For 38148/38148 co-relation queries the response was YES. [2024-06-14 14:47:07,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3249 conditions, 591 events. 297/591 cut-off events. For 38148/38148 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2855 event pairs, 54 based on Foata normal form. 10/599 useless extension candidates. Maximal degree in co-relation 3170. Up to 420 conditions per place. [2024-06-14 14:47:07,431 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 94 selfloop transitions, 26 changer transitions 13/135 dead transitions. [2024-06-14 14:47:07,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 135 transitions, 1354 flow [2024-06-14 14:47:07,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:47:07,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:47:07,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 129 transitions. [2024-06-14 14:47:07,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3782991202346041 [2024-06-14 14:47:07,433 INFO L175 Difference]: Start difference. First operand has 173 places, 115 transitions, 974 flow. Second operand 11 states and 129 transitions. [2024-06-14 14:47:07,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 135 transitions, 1354 flow [2024-06-14 14:47:07,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 135 transitions, 1274 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-14 14:47:07,494 INFO L231 Difference]: Finished difference. Result has 171 places, 111 transitions, 926 flow [2024-06-14 14:47:07,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=926, PETRI_PLACES=171, PETRI_TRANSITIONS=111} [2024-06-14 14:47:07,494 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 141 predicate places. [2024-06-14 14:47:07,494 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 111 transitions, 926 flow [2024-06-14 14:47:07,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:47:07,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:47:07,495 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 14:47:07,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-14 14:47:07,495 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:47:07,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:47:07,495 INFO L85 PathProgramCache]: Analyzing trace with hash -499141417, now seen corresponding path program 15 times [2024-06-14 14:47:07,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:47:07,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372737928] [2024-06-14 14:47:07,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:47:07,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:47:07,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:47:14,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:47:14,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:47:14,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372737928] [2024-06-14 14:47:14,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372737928] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:47:14,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:47:14,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:47:14,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189904687] [2024-06-14 14:47:14,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:47:14,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:47:14,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:47:14,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:47:14,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:47:14,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:47:14,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 111 transitions, 926 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:47:14,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:47:14,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:47:14,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:47:15,064 INFO L124 PetriNetUnfolderBase]: 284/568 cut-off events. [2024-06-14 14:47:15,065 INFO L125 PetriNetUnfolderBase]: For 33405/33405 co-relation queries the response was YES. [2024-06-14 14:47:15,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3060 conditions, 568 events. 284/568 cut-off events. For 33405/33405 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2718 event pairs, 48 based on Foata normal form. 8/574 useless extension candidates. Maximal degree in co-relation 2982. Up to 407 conditions per place. [2024-06-14 14:47:15,069 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 93 selfloop transitions, 25 changer transitions 11/131 dead transitions. [2024-06-14 14:47:15,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 131 transitions, 1262 flow [2024-06-14 14:47:15,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:47:15,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:47:15,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2024-06-14 14:47:15,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3812316715542522 [2024-06-14 14:47:15,070 INFO L175 Difference]: Start difference. First operand has 171 places, 111 transitions, 926 flow. Second operand 11 states and 130 transitions. [2024-06-14 14:47:15,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 131 transitions, 1262 flow [2024-06-14 14:47:15,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 131 transitions, 1192 flow, removed 9 selfloop flow, removed 10 redundant places. [2024-06-14 14:47:15,120 INFO L231 Difference]: Finished difference. Result has 166 places, 108 transitions, 892 flow [2024-06-14 14:47:15,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=860, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=892, PETRI_PLACES=166, PETRI_TRANSITIONS=108} [2024-06-14 14:47:15,120 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 136 predicate places. [2024-06-14 14:47:15,121 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 108 transitions, 892 flow [2024-06-14 14:47:15,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:47:15,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:47:15,121 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 14:47:15,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-14 14:47:15,121 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:47:15,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:47:15,122 INFO L85 PathProgramCache]: Analyzing trace with hash -503725387, now seen corresponding path program 16 times [2024-06-14 14:47:15,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:47:15,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599530986] [2024-06-14 14:47:15,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:47:15,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:47:15,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:47:21,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:47:21,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:47:21,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599530986] [2024-06-14 14:47:21,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599530986] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:47:21,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:47:21,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:47:21,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037242649] [2024-06-14 14:47:21,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:47:21,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:47:21,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:47:21,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:47:21,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:47:21,792 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:47:21,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 108 transitions, 892 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:47:21,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:47:21,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:47:21,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:47:22,149 INFO L124 PetriNetUnfolderBase]: 277/555 cut-off events. [2024-06-14 14:47:22,149 INFO L125 PetriNetUnfolderBase]: For 30974/30974 co-relation queries the response was YES. [2024-06-14 14:47:22,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2950 conditions, 555 events. 277/555 cut-off events. For 30974/30974 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2612 event pairs, 50 based on Foata normal form. 8/561 useless extension candidates. Maximal degree in co-relation 2874. Up to 360 conditions per place. [2024-06-14 14:47:22,154 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 83 selfloop transitions, 29 changer transitions 14/128 dead transitions. [2024-06-14 14:47:22,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 128 transitions, 1216 flow [2024-06-14 14:47:22,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:47:22,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:47:22,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2024-06-14 14:47:22,155 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3812316715542522 [2024-06-14 14:47:22,155 INFO L175 Difference]: Start difference. First operand has 166 places, 108 transitions, 892 flow. Second operand 11 states and 130 transitions. [2024-06-14 14:47:22,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 128 transitions, 1216 flow [2024-06-14 14:47:22,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 128 transitions, 1160 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-14 14:47:22,206 INFO L231 Difference]: Finished difference. Result has 162 places, 104 transitions, 872 flow [2024-06-14 14:47:22,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=872, PETRI_PLACES=162, PETRI_TRANSITIONS=104} [2024-06-14 14:47:22,206 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 132 predicate places. [2024-06-14 14:47:22,206 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 104 transitions, 872 flow [2024-06-14 14:47:22,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:47:22,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:47:22,207 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 14:47:22,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-14 14:47:22,207 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:47:22,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:47:22,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1776894445, now seen corresponding path program 5 times [2024-06-14 14:47:22,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:47:22,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042003622] [2024-06-14 14:47:22,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:47:22,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:47:22,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:47:28,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:47:28,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:47:28,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042003622] [2024-06-14 14:47:28,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042003622] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:47:28,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:47:28,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:47:28,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494132539] [2024-06-14 14:47:28,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:47:28,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:47:28,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:47:28,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:47:28,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:47:28,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:47:28,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 104 transitions, 872 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:47:28,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:47:28,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:47:28,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:47:28,948 INFO L124 PetriNetUnfolderBase]: 258/514 cut-off events. [2024-06-14 14:47:28,948 INFO L125 PetriNetUnfolderBase]: For 22098/22098 co-relation queries the response was YES. [2024-06-14 14:47:28,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2802 conditions, 514 events. 258/514 cut-off events. For 22098/22098 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2335 event pairs, 44 based on Foata normal form. 2/514 useless extension candidates. Maximal degree in co-relation 2728. Up to 471 conditions per place. [2024-06-14 14:47:28,952 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 102 selfloop transitions, 14 changer transitions 0/118 dead transitions. [2024-06-14 14:47:28,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 118 transitions, 1150 flow [2024-06-14 14:47:28,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:47:28,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:47:28,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2024-06-14 14:47:28,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2024-06-14 14:47:28,953 INFO L175 Difference]: Start difference. First operand has 162 places, 104 transitions, 872 flow. Second operand 10 states and 105 transitions. [2024-06-14 14:47:28,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 118 transitions, 1150 flow [2024-06-14 14:47:29,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 118 transitions, 1062 flow, removed 6 selfloop flow, removed 11 redundant places. [2024-06-14 14:47:29,005 INFO L231 Difference]: Finished difference. Result has 154 places, 105 transitions, 836 flow [2024-06-14 14:47:29,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=836, PETRI_PLACES=154, PETRI_TRANSITIONS=105} [2024-06-14 14:47:29,005 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 124 predicate places. [2024-06-14 14:47:29,005 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 105 transitions, 836 flow [2024-06-14 14:47:29,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:47:29,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:47:29,006 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 14:47:29,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-14 14:47:29,006 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:47:29,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:47:29,007 INFO L85 PathProgramCache]: Analyzing trace with hash -433864099, now seen corresponding path program 6 times [2024-06-14 14:47:29,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:47:29,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732447070] [2024-06-14 14:47:29,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:47:29,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:47:29,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:47:37,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:47:37,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:47:37,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732447070] [2024-06-14 14:47:37,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732447070] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:47:37,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:47:37,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:47:37,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979556453] [2024-06-14 14:47:37,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:47:37,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:47:37,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:47:37,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:47:37,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:47:37,229 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:47:37,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 105 transitions, 836 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:47:37,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:47:37,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:47:37,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:47:37,656 INFO L124 PetriNetUnfolderBase]: 262/522 cut-off events. [2024-06-14 14:47:37,656 INFO L125 PetriNetUnfolderBase]: For 19615/19615 co-relation queries the response was YES. [2024-06-14 14:47:37,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2740 conditions, 522 events. 262/522 cut-off events. For 19615/19615 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2386 event pairs, 48 based on Foata normal form. 2/522 useless extension candidates. Maximal degree in co-relation 2670. Up to 473 conditions per place. [2024-06-14 14:47:37,661 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 100 selfloop transitions, 17 changer transitions 0/119 dead transitions. [2024-06-14 14:47:37,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 119 transitions, 1122 flow [2024-06-14 14:47:37,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:47:37,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:47:37,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-14 14:47:37,663 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34516129032258064 [2024-06-14 14:47:37,663 INFO L175 Difference]: Start difference. First operand has 154 places, 105 transitions, 836 flow. Second operand 10 states and 107 transitions. [2024-06-14 14:47:37,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 119 transitions, 1122 flow [2024-06-14 14:47:37,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 119 transitions, 1080 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-14 14:47:37,719 INFO L231 Difference]: Finished difference. Result has 156 places, 106 transitions, 855 flow [2024-06-14 14:47:37,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=855, PETRI_PLACES=156, PETRI_TRANSITIONS=106} [2024-06-14 14:47:37,720 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 126 predicate places. [2024-06-14 14:47:37,720 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 106 transitions, 855 flow [2024-06-14 14:47:37,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:47:37,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:47:37,720 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 14:47:37,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-14 14:47:37,721 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:47:37,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:47:37,721 INFO L85 PathProgramCache]: Analyzing trace with hash 61981175, now seen corresponding path program 17 times [2024-06-14 14:47:37,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:47:37,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463148981] [2024-06-14 14:47:37,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:47:37,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:47:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:47:44,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:47:44,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:47:44,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463148981] [2024-06-14 14:47:44,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463148981] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:47:44,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:47:44,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:47:44,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914438260] [2024-06-14 14:47:44,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:47:44,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:47:44,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:47:44,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:47:44,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:47:44,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:47:44,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 106 transitions, 855 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:47:44,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:47:44,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:47:44,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:47:45,002 INFO L124 PetriNetUnfolderBase]: 278/558 cut-off events. [2024-06-14 14:47:45,002 INFO L125 PetriNetUnfolderBase]: For 29088/29088 co-relation queries the response was YES. [2024-06-14 14:47:45,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2913 conditions, 558 events. 278/558 cut-off events. For 29088/29088 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2617 event pairs, 50 based on Foata normal form. 10/566 useless extension candidates. Maximal degree in co-relation 2842. Up to 423 conditions per place. [2024-06-14 14:47:45,008 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 85 selfloop transitions, 27 changer transitions 11/125 dead transitions. [2024-06-14 14:47:45,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 125 transitions, 1195 flow [2024-06-14 14:47:45,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:47:45,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:47:45,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 126 transitions. [2024-06-14 14:47:45,009 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36950146627565983 [2024-06-14 14:47:45,009 INFO L175 Difference]: Start difference. First operand has 156 places, 106 transitions, 855 flow. Second operand 11 states and 126 transitions. [2024-06-14 14:47:45,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 125 transitions, 1195 flow [2024-06-14 14:47:45,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 125 transitions, 1131 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-14 14:47:45,074 INFO L231 Difference]: Finished difference. Result has 158 places, 103 transitions, 832 flow [2024-06-14 14:47:45,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=832, PETRI_PLACES=158, PETRI_TRANSITIONS=103} [2024-06-14 14:47:45,075 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 128 predicate places. [2024-06-14 14:47:45,075 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 103 transitions, 832 flow [2024-06-14 14:47:45,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:47:45,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:47:45,075 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 14:47:45,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-14 14:47:45,076 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:47:45,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:47:45,076 INFO L85 PathProgramCache]: Analyzing trace with hash -433855729, now seen corresponding path program 7 times [2024-06-14 14:47:45,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:47:45,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300850662] [2024-06-14 14:47:45,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:47:45,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:47:45,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:47:52,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:47:52,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:47:52,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300850662] [2024-06-14 14:47:52,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300850662] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:47:52,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:47:52,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:47:52,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292133485] [2024-06-14 14:47:52,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:47:52,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:47:52,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:47:52,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:47:52,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:47:53,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:47:53,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 103 transitions, 832 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:47:53,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:47:53,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:47:53,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:47:53,446 INFO L124 PetriNetUnfolderBase]: 258/518 cut-off events. [2024-06-14 14:47:53,447 INFO L125 PetriNetUnfolderBase]: For 21283/21283 co-relation queries the response was YES. [2024-06-14 14:47:53,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2750 conditions, 518 events. 258/518 cut-off events. For 21283/21283 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2390 event pairs, 48 based on Foata normal form. 2/518 useless extension candidates. Maximal degree in co-relation 2678. Up to 453 conditions per place. [2024-06-14 14:47:53,450 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 97 selfloop transitions, 18 changer transitions 0/117 dead transitions. [2024-06-14 14:47:53,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 117 transitions, 1114 flow [2024-06-14 14:47:53,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:47:53,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:47:53,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2024-06-14 14:47:53,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34838709677419355 [2024-06-14 14:47:53,452 INFO L175 Difference]: Start difference. First operand has 158 places, 103 transitions, 832 flow. Second operand 10 states and 108 transitions. [2024-06-14 14:47:53,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 117 transitions, 1114 flow [2024-06-14 14:47:53,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 117 transitions, 1052 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-14 14:47:53,483 INFO L231 Difference]: Finished difference. Result has 155 places, 104 transitions, 834 flow [2024-06-14 14:47:53,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=834, PETRI_PLACES=155, PETRI_TRANSITIONS=104} [2024-06-14 14:47:53,483 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 125 predicate places. [2024-06-14 14:47:53,483 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 104 transitions, 834 flow [2024-06-14 14:47:53,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:47:53,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:47:53,484 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 14:47:53,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-14 14:47:53,484 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:47:53,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:47:53,484 INFO L85 PathProgramCache]: Analyzing trace with hash 204554683, now seen corresponding path program 8 times [2024-06-14 14:47:53,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:47:53,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955642785] [2024-06-14 14:47:53,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:47:53,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:47:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:47:59,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:47:59,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:47:59,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955642785] [2024-06-14 14:47:59,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955642785] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:47:59,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:47:59,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:47:59,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144593274] [2024-06-14 14:47:59,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:47:59,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:47:59,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:47:59,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:47:59,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:47:59,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:47:59,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 104 transitions, 834 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 14:47:59,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:47:59,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:47:59,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:48:00,096 INFO L124 PetriNetUnfolderBase]: 264/532 cut-off events. [2024-06-14 14:48:00,097 INFO L125 PetriNetUnfolderBase]: For 20688/20688 co-relation queries the response was YES. [2024-06-14 14:48:00,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2795 conditions, 532 events. 264/532 cut-off events. For 20688/20688 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2495 event pairs, 50 based on Foata normal form. 2/532 useless extension candidates. Maximal degree in co-relation 2724. Up to 485 conditions per place. [2024-06-14 14:48:00,100 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 101 selfloop transitions, 16 changer transitions 0/119 dead transitions. [2024-06-14 14:48:00,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 119 transitions, 1133 flow [2024-06-14 14:48:00,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:48:00,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:48:00,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-14 14:48:00,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34516129032258064 [2024-06-14 14:48:00,103 INFO L175 Difference]: Start difference. First operand has 155 places, 104 transitions, 834 flow. Second operand 10 states and 107 transitions. [2024-06-14 14:48:00,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 119 transitions, 1133 flow [2024-06-14 14:48:00,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 119 transitions, 1079 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-14 14:48:00,142 INFO L231 Difference]: Finished difference. Result has 157 places, 106 transitions, 851 flow [2024-06-14 14:48:00,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=851, PETRI_PLACES=157, PETRI_TRANSITIONS=106} [2024-06-14 14:48:00,143 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 127 predicate places. [2024-06-14 14:48:00,143 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 106 transitions, 851 flow [2024-06-14 14:48:00,143 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 14:48:00,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:48:00,144 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 14:48:00,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-14 14:48:00,144 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:48:00,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:48:00,144 INFO L85 PathProgramCache]: Analyzing trace with hash 204563053, now seen corresponding path program 9 times [2024-06-14 14:48:00,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:48:00,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411369171] [2024-06-14 14:48:00,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:48:00,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:48:00,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:48:06,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:48:06,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:48:06,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411369171] [2024-06-14 14:48:06,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411369171] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:48:06,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:48:06,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:48:06,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042270031] [2024-06-14 14:48:06,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:48:06,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:48:06,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:48:06,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:48:06,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:48:07,036 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:48:07,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 106 transitions, 851 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 14:48:07,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:48:07,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:48:07,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:48:07,433 INFO L124 PetriNetUnfolderBase]: 275/553 cut-off events. [2024-06-14 14:48:07,433 INFO L125 PetriNetUnfolderBase]: For 24189/24189 co-relation queries the response was YES. [2024-06-14 14:48:07,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3038 conditions, 553 events. 275/553 cut-off events. For 24189/24189 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2618 event pairs, 53 based on Foata normal form. 2/553 useless extension candidates. Maximal degree in co-relation 2966. Up to 483 conditions per place. [2024-06-14 14:48:07,439 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 102 selfloop transitions, 18 changer transitions 0/122 dead transitions. [2024-06-14 14:48:07,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 122 transitions, 1271 flow [2024-06-14 14:48:07,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:48:07,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:48:07,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2024-06-14 14:48:07,441 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35161290322580646 [2024-06-14 14:48:07,441 INFO L175 Difference]: Start difference. First operand has 157 places, 106 transitions, 851 flow. Second operand 10 states and 109 transitions. [2024-06-14 14:48:07,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 122 transitions, 1271 flow [2024-06-14 14:48:07,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 122 transitions, 1174 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-14 14:48:07,513 INFO L231 Difference]: Finished difference. Result has 159 places, 108 transitions, 848 flow [2024-06-14 14:48:07,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=848, PETRI_PLACES=159, PETRI_TRANSITIONS=108} [2024-06-14 14:48:07,513 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 129 predicate places. [2024-06-14 14:48:07,513 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 108 transitions, 848 flow [2024-06-14 14:48:07,514 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 14:48:07,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:48:07,514 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 14:48:07,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-14 14:48:07,514 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:48:07,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:48:07,515 INFO L85 PathProgramCache]: Analyzing trace with hash 61976525, now seen corresponding path program 18 times [2024-06-14 14:48:07,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:48:07,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58392213] [2024-06-14 14:48:07,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:48:07,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:48:07,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:48:14,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:48:14,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:48:14,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58392213] [2024-06-14 14:48:14,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58392213] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:48:14,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:48:14,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:48:14,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531760037] [2024-06-14 14:48:14,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:48:14,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:48:14,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:48:14,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:48:14,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:48:14,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:48:14,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 108 transitions, 848 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:48:14,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:48:14,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:48:14,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:48:14,820 INFO L124 PetriNetUnfolderBase]: 287/581 cut-off events. [2024-06-14 14:48:14,820 INFO L125 PetriNetUnfolderBase]: For 31708/31708 co-relation queries the response was YES. [2024-06-14 14:48:14,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3094 conditions, 581 events. 287/581 cut-off events. For 31708/31708 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2804 event pairs, 51 based on Foata normal form. 8/587 useless extension candidates. Maximal degree in co-relation 3022. Up to 452 conditions per place. [2024-06-14 14:48:14,825 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 86 selfloop transitions, 25 changer transitions 13/126 dead transitions. [2024-06-14 14:48:14,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 126 transitions, 1160 flow [2024-06-14 14:48:14,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:48:14,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:48:14,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 123 transitions. [2024-06-14 14:48:14,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36070381231671556 [2024-06-14 14:48:14,827 INFO L175 Difference]: Start difference. First operand has 159 places, 108 transitions, 848 flow. Second operand 11 states and 123 transitions. [2024-06-14 14:48:14,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 126 transitions, 1160 flow [2024-06-14 14:48:14,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 126 transitions, 1114 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-14 14:48:14,905 INFO L231 Difference]: Finished difference. Result has 164 places, 104 transitions, 830 flow [2024-06-14 14:48:14,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=830, PETRI_PLACES=164, PETRI_TRANSITIONS=104} [2024-06-14 14:48:14,906 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 134 predicate places. [2024-06-14 14:48:14,906 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 104 transitions, 830 flow [2024-06-14 14:48:14,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:48:14,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:48:14,907 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 14:48:14,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-14 14:48:14,907 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:48:14,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:48:14,907 INFO L85 PathProgramCache]: Analyzing trace with hash 198067933, now seen corresponding path program 10 times [2024-06-14 14:48:14,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:48:14,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101041819] [2024-06-14 14:48:14,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:48:14,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:48:14,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:48:22,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:48:22,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:48:22,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101041819] [2024-06-14 14:48:22,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101041819] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:48:22,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:48:22,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:48:22,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354643502] [2024-06-14 14:48:22,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:48:22,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:48:22,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:48:22,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:48:22,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:48:22,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:48:22,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 104 transitions, 830 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:48:22,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:48:22,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:48:22,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:48:22,857 INFO L124 PetriNetUnfolderBase]: 272/552 cut-off events. [2024-06-14 14:48:22,858 INFO L125 PetriNetUnfolderBase]: For 29295/29295 co-relation queries the response was YES. [2024-06-14 14:48:22,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2903 conditions, 552 events. 272/552 cut-off events. For 29295/29295 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2624 event pairs, 58 based on Foata normal form. 8/558 useless extension candidates. Maximal degree in co-relation 2829. Up to 481 conditions per place. [2024-06-14 14:48:22,861 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 96 selfloop transitions, 13 changer transitions 9/120 dead transitions. [2024-06-14 14:48:22,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 120 transitions, 1128 flow [2024-06-14 14:48:22,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:48:22,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:48:22,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2024-06-14 14:48:22,862 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3580645161290323 [2024-06-14 14:48:22,862 INFO L175 Difference]: Start difference. First operand has 164 places, 104 transitions, 830 flow. Second operand 10 states and 111 transitions. [2024-06-14 14:48:22,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 120 transitions, 1128 flow [2024-06-14 14:48:22,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 120 transitions, 1044 flow, removed 17 selfloop flow, removed 10 redundant places. [2024-06-14 14:48:22,908 INFO L231 Difference]: Finished difference. Result has 157 places, 101 transitions, 756 flow [2024-06-14 14:48:22,908 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=756, PETRI_PLACES=157, PETRI_TRANSITIONS=101} [2024-06-14 14:48:22,909 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 127 predicate places. [2024-06-14 14:48:22,909 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 101 transitions, 756 flow [2024-06-14 14:48:22,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:48:22,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:48:22,909 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 14:48:22,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-14 14:48:22,909 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:48:22,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:48:22,910 INFO L85 PathProgramCache]: Analyzing trace with hash 197883359, now seen corresponding path program 19 times [2024-06-14 14:48:22,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:48:22,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305744906] [2024-06-14 14:48:22,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:48:22,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:48:22,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:48:29,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:48:29,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:48:29,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305744906] [2024-06-14 14:48:29,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305744906] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:48:29,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:48:29,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:48:29,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055110977] [2024-06-14 14:48:29,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:48:29,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:48:29,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:48:29,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:48:29,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:48:29,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:48:29,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 101 transitions, 756 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:48:29,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:48:29,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:48:29,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:48:30,305 INFO L124 PetriNetUnfolderBase]: 289/583 cut-off events. [2024-06-14 14:48:30,306 INFO L125 PetriNetUnfolderBase]: For 33559/33559 co-relation queries the response was YES. [2024-06-14 14:48:30,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3210 conditions, 583 events. 289/583 cut-off events. For 33559/33559 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2788 event pairs, 53 based on Foata normal form. 8/589 useless extension candidates. Maximal degree in co-relation 3139. Up to 442 conditions per place. [2024-06-14 14:48:30,309 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 92 selfloop transitions, 24 changer transitions 9/127 dead transitions. [2024-06-14 14:48:30,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 127 transitions, 1220 flow [2024-06-14 14:48:30,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 14:48:30,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 14:48:30,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 137 transitions. [2024-06-14 14:48:30,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3682795698924731 [2024-06-14 14:48:30,311 INFO L175 Difference]: Start difference. First operand has 157 places, 101 transitions, 756 flow. Second operand 12 states and 137 transitions. [2024-06-14 14:48:30,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 127 transitions, 1220 flow [2024-06-14 14:48:30,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 127 transitions, 1183 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-14 14:48:30,354 INFO L231 Difference]: Finished difference. Result has 159 places, 101 transitions, 815 flow [2024-06-14 14:48:30,354 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=721, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=815, PETRI_PLACES=159, PETRI_TRANSITIONS=101} [2024-06-14 14:48:30,355 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 129 predicate places. [2024-06-14 14:48:30,355 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 101 transitions, 815 flow [2024-06-14 14:48:30,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:48:30,355 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:48:30,355 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 14:48:30,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-14 14:48:30,356 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:48:30,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:48:30,356 INFO L85 PathProgramCache]: Analyzing trace with hash 57392555, now seen corresponding path program 20 times [2024-06-14 14:48:30,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:48:30,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013862914] [2024-06-14 14:48:30,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:48:30,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:48:30,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:48:36,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:48:36,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:48:36,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013862914] [2024-06-14 14:48:36,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013862914] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:48:36,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:48:36,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:48:36,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163045644] [2024-06-14 14:48:36,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:48:36,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:48:36,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:48:36,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:48:36,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:48:36,888 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:48:36,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 101 transitions, 815 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:48:36,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:48:36,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:48:36,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:48:37,361 INFO L124 PetriNetUnfolderBase]: 298/606 cut-off events. [2024-06-14 14:48:37,361 INFO L125 PetriNetUnfolderBase]: For 41895/41895 co-relation queries the response was YES. [2024-06-14 14:48:37,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3692 conditions, 606 events. 298/606 cut-off events. For 41895/41895 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2937 event pairs, 58 based on Foata normal form. 8/612 useless extension candidates. Maximal degree in co-relation 3619. Up to 341 conditions per place. [2024-06-14 14:48:37,365 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 88 selfloop transitions, 25 changer transitions 10/125 dead transitions. [2024-06-14 14:48:37,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 125 transitions, 1261 flow [2024-06-14 14:48:37,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:48:37,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:48:37,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2024-06-14 14:48:37,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3812316715542522 [2024-06-14 14:48:37,367 INFO L175 Difference]: Start difference. First operand has 159 places, 101 transitions, 815 flow. Second operand 11 states and 130 transitions. [2024-06-14 14:48:37,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 125 transitions, 1261 flow [2024-06-14 14:48:37,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 125 transitions, 1191 flow, removed 13 selfloop flow, removed 11 redundant places. [2024-06-14 14:48:37,415 INFO L231 Difference]: Finished difference. Result has 156 places, 98 transitions, 791 flow [2024-06-14 14:48:37,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=791, PETRI_PLACES=156, PETRI_TRANSITIONS=98} [2024-06-14 14:48:37,415 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 126 predicate places. [2024-06-14 14:48:37,415 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 98 transitions, 791 flow [2024-06-14 14:48:37,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:48:37,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:48:37,416 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 14:48:37,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-14 14:48:37,416 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:48:37,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:48:37,416 INFO L85 PathProgramCache]: Analyzing trace with hash 197888009, now seen corresponding path program 21 times [2024-06-14 14:48:37,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:48:37,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756982077] [2024-06-14 14:48:37,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:48:37,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:48:37,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:48:45,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:48:45,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:48:45,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756982077] [2024-06-14 14:48:45,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756982077] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:48:45,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:48:45,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:48:45,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683881242] [2024-06-14 14:48:45,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:48:45,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:48:45,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:48:45,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:48:45,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:48:45,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:48:45,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 98 transitions, 791 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:48:45,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:48:45,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:48:45,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:48:45,553 INFO L124 PetriNetUnfolderBase]: 271/557 cut-off events. [2024-06-14 14:48:45,554 INFO L125 PetriNetUnfolderBase]: For 33835/33835 co-relation queries the response was YES. [2024-06-14 14:48:45,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3128 conditions, 557 events. 271/557 cut-off events. For 33835/33835 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2665 event pairs, 65 based on Foata normal form. 10/565 useless extension candidates. Maximal degree in co-relation 3057. Up to 471 conditions per place. [2024-06-14 14:48:45,557 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 88 selfloop transitions, 11 changer transitions 14/115 dead transitions. [2024-06-14 14:48:45,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 115 transitions, 1061 flow [2024-06-14 14:48:45,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:48:45,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:48:45,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 120 transitions. [2024-06-14 14:48:45,558 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3519061583577713 [2024-06-14 14:48:45,558 INFO L175 Difference]: Start difference. First operand has 156 places, 98 transitions, 791 flow. Second operand 11 states and 120 transitions. [2024-06-14 14:48:45,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 115 transitions, 1061 flow [2024-06-14 14:48:45,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 115 transitions, 985 flow, removed 17 selfloop flow, removed 10 redundant places. [2024-06-14 14:48:45,598 INFO L231 Difference]: Finished difference. Result has 153 places, 91 transitions, 693 flow [2024-06-14 14:48:45,601 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=715, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=693, PETRI_PLACES=153, PETRI_TRANSITIONS=91} [2024-06-14 14:48:45,616 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 123 predicate places. [2024-06-14 14:48:45,616 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 91 transitions, 693 flow [2024-06-14 14:48:45,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:48:45,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:48:45,617 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 14:48:45,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-14 14:48:45,617 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:48:45,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:48:45,617 INFO L85 PathProgramCache]: Analyzing trace with hash 234889999, now seen corresponding path program 11 times [2024-06-14 14:48:45,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:48:45,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941758242] [2024-06-14 14:48:45,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:48:45,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:48:45,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:48:51,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 14:48:51,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:48:51,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941758242] [2024-06-14 14:48:51,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941758242] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:48:51,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:48:51,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:48:51,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640504578] [2024-06-14 14:48:51,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:48:51,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:48:51,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:48:51,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:48:51,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:48:52,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:48:52,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 91 transitions, 693 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 14:48:52,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:48:52,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:48:52,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:48:52,431 INFO L124 PetriNetUnfolderBase]: 242/498 cut-off events. [2024-06-14 14:48:52,431 INFO L125 PetriNetUnfolderBase]: For 21557/21557 co-relation queries the response was YES. [2024-06-14 14:48:52,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2728 conditions, 498 events. 242/498 cut-off events. For 21557/21557 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2290 event pairs, 60 based on Foata normal form. 2/498 useless extension candidates. Maximal degree in co-relation 2659. Up to 434 conditions per place. [2024-06-14 14:48:52,434 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 87 selfloop transitions, 16 changer transitions 0/105 dead transitions. [2024-06-14 14:48:52,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 105 transitions, 933 flow [2024-06-14 14:48:52,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:48:52,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:48:52,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2024-06-14 14:48:52,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3580645161290323 [2024-06-14 14:48:52,448 INFO L175 Difference]: Start difference. First operand has 153 places, 91 transitions, 693 flow. Second operand 10 states and 111 transitions. [2024-06-14 14:48:52,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 105 transitions, 933 flow [2024-06-14 14:48:52,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 105 transitions, 883 flow, removed 10 selfloop flow, removed 14 redundant places. [2024-06-14 14:48:52,485 INFO L231 Difference]: Finished difference. Result has 143 places, 91 transitions, 679 flow [2024-06-14 14:48:52,486 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=679, PETRI_PLACES=143, PETRI_TRANSITIONS=91} [2024-06-14 14:48:52,486 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 113 predicate places. [2024-06-14 14:48:52,486 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 91 transitions, 679 flow [2024-06-14 14:48:52,486 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 14:48:52,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:48:52,487 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 14:48:52,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-14 14:48:52,487 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:48:52,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:48:52,487 INFO L85 PathProgramCache]: Analyzing trace with hash 228214955, now seen corresponding path program 22 times [2024-06-14 14:48:52,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:48:52,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106581079] [2024-06-14 14:48:52,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:48:52,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:48:52,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:48:58,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:48:58,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:48:58,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106581079] [2024-06-14 14:48:58,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106581079] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:48:58,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:48:58,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:48:58,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365502516] [2024-06-14 14:48:58,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:48:58,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:48:58,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:48:58,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:48:58,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:48:58,756 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:48:58,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 91 transitions, 679 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:48:58,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:48:58,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:48:58,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:48:59,148 INFO L124 PetriNetUnfolderBase]: 258/534 cut-off events. [2024-06-14 14:48:59,149 INFO L125 PetriNetUnfolderBase]: For 26637/26637 co-relation queries the response was YES. [2024-06-14 14:48:59,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2769 conditions, 534 events. 258/534 cut-off events. For 26637/26637 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2520 event pairs, 66 based on Foata normal form. 10/542 useless extension candidates. Maximal degree in co-relation 2703. Up to 407 conditions per place. [2024-06-14 14:48:59,154 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 76 selfloop transitions, 21 changer transitions 11/110 dead transitions. [2024-06-14 14:48:59,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 110 transitions, 973 flow [2024-06-14 14:48:59,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:48:59,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:48:59,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 126 transitions. [2024-06-14 14:48:59,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36950146627565983 [2024-06-14 14:48:59,157 INFO L175 Difference]: Start difference. First operand has 143 places, 91 transitions, 679 flow. Second operand 11 states and 126 transitions. [2024-06-14 14:48:59,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 110 transitions, 973 flow [2024-06-14 14:48:59,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 110 transitions, 887 flow, removed 12 selfloop flow, removed 10 redundant places. [2024-06-14 14:48:59,211 INFO L231 Difference]: Finished difference. Result has 144 places, 88 transitions, 621 flow [2024-06-14 14:48:59,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=621, PETRI_PLACES=144, PETRI_TRANSITIONS=88} [2024-06-14 14:48:59,211 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 114 predicate places. [2024-06-14 14:48:59,211 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 88 transitions, 621 flow [2024-06-14 14:48:59,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:48:59,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:48:59,212 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 14:48:59,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-14 14:48:59,212 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:48:59,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:48:59,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1060152795, now seen corresponding path program 23 times [2024-06-14 14:48:59,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:48:59,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344950480] [2024-06-14 14:48:59,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:48:59,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:48:59,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:49:05,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:49:05,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:49:05,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344950480] [2024-06-14 14:49:05,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344950480] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:49:05,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:49:05,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:49:05,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853991972] [2024-06-14 14:49:05,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:49:05,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:49:05,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:49:05,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:49:05,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:49:06,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:49:06,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 88 transitions, 621 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:49:06,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:49:06,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:49:06,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:49:06,375 INFO L124 PetriNetUnfolderBase]: 246/514 cut-off events. [2024-06-14 14:49:06,375 INFO L125 PetriNetUnfolderBase]: For 25660/25660 co-relation queries the response was YES. [2024-06-14 14:49:06,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2595 conditions, 514 events. 246/514 cut-off events. For 25660/25660 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2406 event pairs, 62 based on Foata normal form. 8/520 useless extension candidates. Maximal degree in co-relation 2529. Up to 397 conditions per place. [2024-06-14 14:49:06,378 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 73 selfloop transitions, 18 changer transitions 13/106 dead transitions. [2024-06-14 14:49:06,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 106 transitions, 887 flow [2024-06-14 14:49:06,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:49:06,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:49:06,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 123 transitions. [2024-06-14 14:49:06,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36070381231671556 [2024-06-14 14:49:06,379 INFO L175 Difference]: Start difference. First operand has 144 places, 88 transitions, 621 flow. Second operand 11 states and 123 transitions. [2024-06-14 14:49:06,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 106 transitions, 887 flow [2024-06-14 14:49:06,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 106 transitions, 835 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-14 14:49:06,412 INFO L231 Difference]: Finished difference. Result has 142 places, 84 transitions, 586 flow [2024-06-14 14:49:06,412 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=586, PETRI_PLACES=142, PETRI_TRANSITIONS=84} [2024-06-14 14:49:06,412 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 112 predicate places. [2024-06-14 14:49:06,412 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 84 transitions, 586 flow [2024-06-14 14:49:06,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:49:06,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:49:06,412 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 14:49:06,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-14 14:49:06,413 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:49:06,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:49:06,413 INFO L85 PathProgramCache]: Analyzing trace with hash -765540069, now seen corresponding path program 24 times [2024-06-14 14:49:06,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:49:06,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423160032] [2024-06-14 14:49:06,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:49:06,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:49:06,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:49:12,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:49:12,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:49:12,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423160032] [2024-06-14 14:49:12,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423160032] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:49:12,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:49:12,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:49:12,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790230430] [2024-06-14 14:49:12,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:49:12,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:49:12,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:49:12,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:49:12,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:49:12,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:49:12,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 84 transitions, 586 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:49:12,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:49:12,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:49:12,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:49:13,336 INFO L124 PetriNetUnfolderBase]: 235/493 cut-off events. [2024-06-14 14:49:13,336 INFO L125 PetriNetUnfolderBase]: For 24601/24601 co-relation queries the response was YES. [2024-06-14 14:49:13,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2384 conditions, 493 events. 235/493 cut-off events. For 24601/24601 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2270 event pairs, 61 based on Foata normal form. 10/501 useless extension candidates. Maximal degree in co-relation 2319. Up to 366 conditions per place. [2024-06-14 14:49:13,339 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 68 selfloop transitions, 22 changer transitions 11/103 dead transitions. [2024-06-14 14:49:13,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 103 transitions, 862 flow [2024-06-14 14:49:13,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:49:13,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:49:13,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2024-06-14 14:49:13,340 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-14 14:49:13,340 INFO L175 Difference]: Start difference. First operand has 142 places, 84 transitions, 586 flow. Second operand 11 states and 124 transitions. [2024-06-14 14:49:13,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 103 transitions, 862 flow [2024-06-14 14:49:13,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 103 transitions, 814 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-14 14:49:13,365 INFO L231 Difference]: Finished difference. Result has 136 places, 81 transitions, 570 flow [2024-06-14 14:49:13,366 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=570, PETRI_PLACES=136, PETRI_TRANSITIONS=81} [2024-06-14 14:49:13,366 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 106 predicate places. [2024-06-14 14:49:13,366 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 81 transitions, 570 flow [2024-06-14 14:49:13,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:49:13,366 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:49:13,366 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 14:49:13,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-14 14:49:13,367 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:49:13,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:49:13,367 INFO L85 PathProgramCache]: Analyzing trace with hash -765544719, now seen corresponding path program 25 times [2024-06-14 14:49:13,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:49:13,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267400217] [2024-06-14 14:49:13,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:49:13,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:49:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:49:19,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:49:19,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:49:19,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267400217] [2024-06-14 14:49:19,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267400217] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:49:19,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:49:19,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:49:19,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099928910] [2024-06-14 14:49:19,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:49:19,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:49:19,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:49:19,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:49:19,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:49:19,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:49:19,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 81 transitions, 570 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:49:19,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:49:19,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:49:19,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:49:19,708 INFO L124 PetriNetUnfolderBase]: 201/427 cut-off events. [2024-06-14 14:49:19,708 INFO L125 PetriNetUnfolderBase]: For 13725/13725 co-relation queries the response was YES. [2024-06-14 14:49:19,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1801 conditions, 427 events. 201/427 cut-off events. For 13725/13725 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1901 event pairs, 39 based on Foata normal form. 8/433 useless extension candidates. Maximal degree in co-relation 1739. Up to 310 conditions per place. [2024-06-14 14:49:19,710 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 64 selfloop transitions, 18 changer transitions 14/98 dead transitions. [2024-06-14 14:49:19,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 98 transitions, 804 flow [2024-06-14 14:49:19,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:49:19,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:49:19,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 121 transitions. [2024-06-14 14:49:19,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-14 14:49:19,711 INFO L175 Difference]: Start difference. First operand has 136 places, 81 transitions, 570 flow. Second operand 11 states and 121 transitions. [2024-06-14 14:49:19,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 98 transitions, 804 flow [2024-06-14 14:49:19,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 98 transitions, 752 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-14 14:49:19,729 INFO L231 Difference]: Finished difference. Result has 134 places, 75 transitions, 517 flow [2024-06-14 14:49:19,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=517, PETRI_PLACES=134, PETRI_TRANSITIONS=75} [2024-06-14 14:49:19,730 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 104 predicate places. [2024-06-14 14:49:19,730 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 75 transitions, 517 flow [2024-06-14 14:49:19,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:49:19,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:49:19,730 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 14:49:19,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-14 14:49:19,731 INFO L420 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:49:19,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:49:19,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1724479080, now seen corresponding path program 1 times [2024-06-14 14:49:19,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:49:19,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737576373] [2024-06-14 14:49:19,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:49:19,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:49:19,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:49:26,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:49:26,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:49:26,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737576373] [2024-06-14 14:49:26,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737576373] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:49:26,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:49:26,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 14:49:26,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587368685] [2024-06-14 14:49:26,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:49:26,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 14:49:26,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:49:26,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 14:49:26,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-06-14 14:49:26,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:49:26,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 75 transitions, 517 flow. Second operand has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:49:26,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:49:26,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:49:26,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:49:27,116 INFO L124 PetriNetUnfolderBase]: 188/400 cut-off events. [2024-06-14 14:49:27,117 INFO L125 PetriNetUnfolderBase]: For 11753/11753 co-relation queries the response was YES. [2024-06-14 14:49:27,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1690 conditions, 400 events. 188/400 cut-off events. For 11753/11753 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1751 event pairs, 43 based on Foata normal form. 6/404 useless extension candidates. Maximal degree in co-relation 1629. Up to 264 conditions per place. [2024-06-14 14:49:27,119 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 62 selfloop transitions, 18 changer transitions 12/94 dead transitions. [2024-06-14 14:49:27,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 94 transitions, 759 flow [2024-06-14 14:49:27,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:49:27,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:49:27,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2024-06-14 14:49:27,120 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-14 14:49:27,120 INFO L175 Difference]: Start difference. First operand has 134 places, 75 transitions, 517 flow. Second operand 11 states and 124 transitions. [2024-06-14 14:49:27,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 94 transitions, 759 flow [2024-06-14 14:49:27,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 94 transitions, 686 flow, removed 9 selfloop flow, removed 13 redundant places. [2024-06-14 14:49:27,134 INFO L231 Difference]: Finished difference. Result has 123 places, 71 transitions, 463 flow [2024-06-14 14:49:27,134 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=463, PETRI_PLACES=123, PETRI_TRANSITIONS=71} [2024-06-14 14:49:27,138 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 93 predicate places. [2024-06-14 14:49:27,138 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 71 transitions, 463 flow [2024-06-14 14:49:27,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:49:27,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:49:27,138 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 14:49:27,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-06-14 14:49:27,139 INFO L420 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:49:27,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:49:27,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1674387012, now seen corresponding path program 2 times [2024-06-14 14:49:27,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:49:27,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321565826] [2024-06-14 14:49:27,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:49:27,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:49:27,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:49:36,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:49:36,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:49:36,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321565826] [2024-06-14 14:49:36,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321565826] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:49:36,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:49:36,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 14:49:36,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417834447] [2024-06-14 14:49:36,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:49:36,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 14:49:36,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:49:36,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 14:49:36,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-06-14 14:49:36,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:49:36,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 71 transitions, 463 flow. Second operand has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:49:36,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:49:36,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:49:36,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:49:36,755 INFO L124 PetriNetUnfolderBase]: 179/381 cut-off events. [2024-06-14 14:49:36,755 INFO L125 PetriNetUnfolderBase]: For 9523/9523 co-relation queries the response was YES. [2024-06-14 14:49:36,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1525 conditions, 381 events. 179/381 cut-off events. For 9523/9523 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1636 event pairs, 43 based on Foata normal form. 6/385 useless extension candidates. Maximal degree in co-relation 1470. Up to 254 conditions per place. [2024-06-14 14:49:36,758 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 58 selfloop transitions, 18 changer transitions 11/89 dead transitions. [2024-06-14 14:49:36,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 89 transitions, 687 flow [2024-06-14 14:49:36,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:49:36,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:49:36,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 121 transitions. [2024-06-14 14:49:36,759 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-14 14:49:36,759 INFO L175 Difference]: Start difference. First operand has 123 places, 71 transitions, 463 flow. Second operand 11 states and 121 transitions. [2024-06-14 14:49:36,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 89 transitions, 687 flow [2024-06-14 14:49:36,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 89 transitions, 643 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-06-14 14:49:36,770 INFO L231 Difference]: Finished difference. Result has 118 places, 68 transitions, 443 flow [2024-06-14 14:49:36,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=443, PETRI_PLACES=118, PETRI_TRANSITIONS=68} [2024-06-14 14:49:36,771 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 88 predicate places. [2024-06-14 14:49:36,771 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 68 transitions, 443 flow [2024-06-14 14:49:36,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:49:36,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:49:36,771 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 14:49:36,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-06-14 14:49:36,772 INFO L420 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:49:36,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:49:36,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1674646482, now seen corresponding path program 3 times [2024-06-14 14:49:36,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:49:36,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24256190] [2024-06-14 14:49:36,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:49:36,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:49:36,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:49:43,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:49:43,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:49:43,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24256190] [2024-06-14 14:49:43,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24256190] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:49:43,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:49:43,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 14:49:43,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808800037] [2024-06-14 14:49:43,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:49:43,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 14:49:43,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:49:43,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 14:49:43,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-14 14:49:43,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:49:43,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 68 transitions, 443 flow. Second operand has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:49:43,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:49:43,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:49:43,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:49:44,309 INFO L124 PetriNetUnfolderBase]: 169/363 cut-off events. [2024-06-14 14:49:44,309 INFO L125 PetriNetUnfolderBase]: For 9006/9006 co-relation queries the response was YES. [2024-06-14 14:49:44,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1456 conditions, 363 events. 169/363 cut-off events. For 9006/9006 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1539 event pairs, 39 based on Foata normal form. 6/367 useless extension candidates. Maximal degree in co-relation 1402. Up to 230 conditions per place. [2024-06-14 14:49:44,312 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 57 selfloop transitions, 16 changer transitions 11/86 dead transitions. [2024-06-14 14:49:44,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 86 transitions, 659 flow [2024-06-14 14:49:44,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:49:44,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:49:44,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 121 transitions. [2024-06-14 14:49:44,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-14 14:49:44,313 INFO L175 Difference]: Start difference. First operand has 118 places, 68 transitions, 443 flow. Second operand 11 states and 121 transitions. [2024-06-14 14:49:44,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 86 transitions, 659 flow [2024-06-14 14:49:44,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 86 transitions, 617 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-14 14:49:44,328 INFO L231 Difference]: Finished difference. Result has 114 places, 63 transitions, 411 flow [2024-06-14 14:49:44,328 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=411, PETRI_PLACES=114, PETRI_TRANSITIONS=63} [2024-06-14 14:49:44,329 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 84 predicate places. [2024-06-14 14:49:44,329 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 63 transitions, 411 flow [2024-06-14 14:49:44,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:49:44,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:49:44,329 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 14:49:44,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-06-14 14:49:44,330 INFO L420 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:49:44,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:49:44,330 INFO L85 PathProgramCache]: Analyzing trace with hash 615017878, now seen corresponding path program 4 times [2024-06-14 14:49:44,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:49:44,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372271332] [2024-06-14 14:49:44,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:49:44,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:49:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:49:51,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:49:51,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:49:51,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372271332] [2024-06-14 14:49:51,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372271332] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:49:51,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:49:51,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 14:49:51,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636543601] [2024-06-14 14:49:51,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:49:51,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 14:49:51,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:49:51,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 14:49:51,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-06-14 14:49:51,676 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:49:51,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 63 transitions, 411 flow. Second operand has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:49:51,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:49:51,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:49:51,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:49:52,046 INFO L124 PetriNetUnfolderBase]: 156/336 cut-off events. [2024-06-14 14:49:52,047 INFO L125 PetriNetUnfolderBase]: For 7935/7935 co-relation queries the response was YES. [2024-06-14 14:49:52,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1356 conditions, 336 events. 156/336 cut-off events. For 7935/7935 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1372 event pairs, 41 based on Foata normal form. 6/340 useless extension candidates. Maximal degree in co-relation 1304. Up to 226 conditions per place. [2024-06-14 14:49:52,049 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 51 selfloop transitions, 11 changer transitions 16/80 dead transitions. [2024-06-14 14:49:52,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 80 transitions, 613 flow [2024-06-14 14:49:52,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:49:52,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:49:52,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 118 transitions. [2024-06-14 14:49:52,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3460410557184751 [2024-06-14 14:49:52,050 INFO L175 Difference]: Start difference. First operand has 114 places, 63 transitions, 411 flow. Second operand 11 states and 118 transitions. [2024-06-14 14:49:52,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 80 transitions, 613 flow [2024-06-14 14:49:52,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 80 transitions, 565 flow, removed 4 selfloop flow, removed 15 redundant places. [2024-06-14 14:49:52,062 INFO L231 Difference]: Finished difference. Result has 105 places, 57 transitions, 358 flow [2024-06-14 14:49:52,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=358, PETRI_PLACES=105, PETRI_TRANSITIONS=57} [2024-06-14 14:49:52,063 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 75 predicate places. [2024-06-14 14:49:52,063 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 57 transitions, 358 flow [2024-06-14 14:49:52,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:49:52,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:49:52,063 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 14:49:52,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-06-14 14:49:52,064 INFO L420 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:49:52,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:49:52,064 INFO L85 PathProgramCache]: Analyzing trace with hash -2056425292, now seen corresponding path program 5 times [2024-06-14 14:49:52,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:49:52,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877958232] [2024-06-14 14:49:52,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:49:52,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:49:52,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:49:59,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:49:59,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:49:59,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877958232] [2024-06-14 14:49:59,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877958232] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:49:59,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:49:59,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 14:49:59,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151267648] [2024-06-14 14:49:59,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:49:59,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 14:49:59,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:49:59,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 14:49:59,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-14 14:50:00,123 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:50:00,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 57 transitions, 358 flow. Second operand has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:50:00,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:50:00,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:50:00,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:50:00,451 INFO L124 PetriNetUnfolderBase]: 145/311 cut-off events. [2024-06-14 14:50:00,451 INFO L125 PetriNetUnfolderBase]: For 6501/6501 co-relation queries the response was YES. [2024-06-14 14:50:00,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1229 conditions, 311 events. 145/311 cut-off events. For 6501/6501 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1212 event pairs, 37 based on Foata normal form. 6/315 useless extension candidates. Maximal degree in co-relation 1180. Up to 229 conditions per place. [2024-06-14 14:50:00,453 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 48 selfloop transitions, 8 changer transitions 17/75 dead transitions. [2024-06-14 14:50:00,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 75 transitions, 552 flow [2024-06-14 14:50:00,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:50:00,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:50:00,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 118 transitions. [2024-06-14 14:50:00,454 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3460410557184751 [2024-06-14 14:50:00,454 INFO L175 Difference]: Start difference. First operand has 105 places, 57 transitions, 358 flow. Second operand 11 states and 118 transitions. [2024-06-14 14:50:00,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 75 transitions, 552 flow [2024-06-14 14:50:00,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 75 transitions, 515 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-14 14:50:00,461 INFO L231 Difference]: Finished difference. Result has 96 places, 51 transitions, 310 flow [2024-06-14 14:50:00,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=310, PETRI_PLACES=96, PETRI_TRANSITIONS=51} [2024-06-14 14:50:00,461 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 66 predicate places. [2024-06-14 14:50:00,461 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 51 transitions, 310 flow [2024-06-14 14:50:00,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:50:00,462 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:50:00,462 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 14:50:00,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-06-14 14:50:00,462 INFO L420 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:50:00,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:50:00,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1912131010, now seen corresponding path program 6 times [2024-06-14 14:50:00,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:50:00,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598279599] [2024-06-14 14:50:00,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:50:00,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:50:00,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:50:07,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:50:07,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:50:07,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598279599] [2024-06-14 14:50:07,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598279599] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:50:07,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:50:07,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 14:50:07,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732285535] [2024-06-14 14:50:07,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:50:07,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 14:50:07,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:50:07,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 14:50:07,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-06-14 14:50:07,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:50:07,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 51 transitions, 310 flow. Second operand has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:50:07,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:50:07,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:50:07,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:50:08,207 INFO L124 PetriNetUnfolderBase]: 131/281 cut-off events. [2024-06-14 14:50:08,207 INFO L125 PetriNetUnfolderBase]: For 5181/5181 co-relation queries the response was YES. [2024-06-14 14:50:08,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1089 conditions, 281 events. 131/281 cut-off events. For 5181/5181 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1053 event pairs, 35 based on Foata normal form. 6/285 useless extension candidates. Maximal degree in co-relation 1044. Up to 208 conditions per place. [2024-06-14 14:50:08,210 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 42 selfloop transitions, 12 changer transitions 12/68 dead transitions. [2024-06-14 14:50:08,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 68 transitions, 486 flow [2024-06-14 14:50:08,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:50:08,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:50:08,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 116 transitions. [2024-06-14 14:50:08,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34017595307917886 [2024-06-14 14:50:08,212 INFO L175 Difference]: Start difference. First operand has 96 places, 51 transitions, 310 flow. Second operand 11 states and 116 transitions. [2024-06-14 14:50:08,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 68 transitions, 486 flow [2024-06-14 14:50:08,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 68 transitions, 460 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-14 14:50:08,218 INFO L231 Difference]: Finished difference. Result has 87 places, 47 transitions, 287 flow [2024-06-14 14:50:08,218 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=287, PETRI_PLACES=87, PETRI_TRANSITIONS=47} [2024-06-14 14:50:08,218 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 57 predicate places. [2024-06-14 14:50:08,218 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 47 transitions, 287 flow [2024-06-14 14:50:08,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:50:08,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:50:08,219 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 14:50:08,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-06-14 14:50:08,219 INFO L420 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:50:08,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:50:08,219 INFO L85 PathProgramCache]: Analyzing trace with hash -564624430, now seen corresponding path program 7 times [2024-06-14 14:50:08,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:50:08,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935433083] [2024-06-14 14:50:08,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:50:08,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:50:08,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:50:14,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:50:14,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:50:14,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935433083] [2024-06-14 14:50:14,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935433083] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:50:14,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:50:14,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 14:50:14,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892791598] [2024-06-14 14:50:14,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:50:14,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 14:50:14,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:50:14,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 14:50:14,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-06-14 14:50:15,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:50:15,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 47 transitions, 287 flow. Second operand has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:50:15,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:50:15,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:50:15,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:50:15,450 INFO L124 PetriNetUnfolderBase]: 118/258 cut-off events. [2024-06-14 14:50:15,450 INFO L125 PetriNetUnfolderBase]: For 3697/3697 co-relation queries the response was YES. [2024-06-14 14:50:15,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 983 conditions, 258 events. 118/258 cut-off events. For 3697/3697 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 935 event pairs, 33 based on Foata normal form. 6/262 useless extension candidates. Maximal degree in co-relation 942. Up to 188 conditions per place. [2024-06-14 14:50:15,452 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 38 selfloop transitions, 8 changer transitions 16/64 dead transitions. [2024-06-14 14:50:15,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 64 transitions, 453 flow [2024-06-14 14:50:15,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:50:15,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:50:15,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2024-06-14 14:50:15,453 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33724340175953077 [2024-06-14 14:50:15,453 INFO L175 Difference]: Start difference. First operand has 87 places, 47 transitions, 287 flow. Second operand 11 states and 115 transitions. [2024-06-14 14:50:15,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 64 transitions, 453 flow [2024-06-14 14:50:15,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 64 transitions, 425 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-14 14:50:15,457 INFO L231 Difference]: Finished difference. Result has 84 places, 41 transitions, 238 flow [2024-06-14 14:50:15,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=238, PETRI_PLACES=84, PETRI_TRANSITIONS=41} [2024-06-14 14:50:15,458 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 54 predicate places. [2024-06-14 14:50:15,458 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 41 transitions, 238 flow [2024-06-14 14:50:15,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:50:15,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:50:15,458 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 14:50:15,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-06-14 14:50:15,458 INFO L420 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:50:15,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:50:15,459 INFO L85 PathProgramCache]: Analyzing trace with hash -2763822, now seen corresponding path program 8 times [2024-06-14 14:50:15,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:50:15,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012170048] [2024-06-14 14:50:15,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:50:15,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:50:15,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:50:21,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:50:21,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:50:21,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012170048] [2024-06-14 14:50:21,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012170048] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:50:21,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:50:21,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:50:21,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380512171] [2024-06-14 14:50:21,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:50:21,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:50:21,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:50:21,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:50:21,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:50:22,071 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:50:22,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 41 transitions, 238 flow. Second operand has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:50:22,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:50:22,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:50:22,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:50:22,360 INFO L124 PetriNetUnfolderBase]: 103/229 cut-off events. [2024-06-14 14:50:22,361 INFO L125 PetriNetUnfolderBase]: For 3325/3325 co-relation queries the response was YES. [2024-06-14 14:50:22,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 874 conditions, 229 events. 103/229 cut-off events. For 3325/3325 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 783 event pairs, 29 based on Foata normal form. 6/233 useless extension candidates. Maximal degree in co-relation 834. Up to 162 conditions per place. [2024-06-14 14:50:22,362 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 33 selfloop transitions, 6 changer transitions 17/58 dead transitions. [2024-06-14 14:50:22,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 58 transitions, 390 flow [2024-06-14 14:50:22,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:50:22,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:50:22,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 113 transitions. [2024-06-14 14:50:22,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3313782991202346 [2024-06-14 14:50:22,363 INFO L175 Difference]: Start difference. First operand has 84 places, 41 transitions, 238 flow. Second operand 11 states and 113 transitions. [2024-06-14 14:50:22,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 58 transitions, 390 flow [2024-06-14 14:50:22,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 58 transitions, 358 flow, removed 3 selfloop flow, removed 11 redundant places. [2024-06-14 14:50:22,366 INFO L231 Difference]: Finished difference. Result has 77 places, 35 transitions, 195 flow [2024-06-14 14:50:22,366 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=195, PETRI_PLACES=77, PETRI_TRANSITIONS=35} [2024-06-14 14:50:22,366 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 47 predicate places. [2024-06-14 14:50:22,366 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 35 transitions, 195 flow [2024-06-14 14:50:22,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:50:22,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:50:22,367 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:50:22,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-06-14 14:50:22,367 INFO L420 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:50:22,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:50:22,367 INFO L85 PathProgramCache]: Analyzing trace with hash 2046229158, now seen corresponding path program 9 times [2024-06-14 14:50:22,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:50:22,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402430579] [2024-06-14 14:50:22,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:50:22,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:50:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:50:29,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:50:29,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:50:29,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402430579] [2024-06-14 14:50:29,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402430579] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:50:29,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:50:29,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 14:50:29,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936003602] [2024-06-14 14:50:29,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:50:29,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 14:50:29,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:50:29,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 14:50:29,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-06-14 14:50:29,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:50:29,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 35 transitions, 195 flow. Second operand has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:50:29,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:50:29,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:50:29,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:50:29,987 INFO L124 PetriNetUnfolderBase]: 87/197 cut-off events. [2024-06-14 14:50:29,987 INFO L125 PetriNetUnfolderBase]: For 2664/2664 co-relation queries the response was YES. [2024-06-14 14:50:29,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 750 conditions, 197 events. 87/197 cut-off events. For 2664/2664 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 640 event pairs, 27 based on Foata normal form. 6/201 useless extension candidates. Maximal degree in co-relation 713. Up to 135 conditions per place. [2024-06-14 14:50:29,988 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 31 selfloop transitions, 8 changer transitions 11/52 dead transitions. [2024-06-14 14:50:29,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 52 transitions, 339 flow [2024-06-14 14:50:29,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:50:29,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:50:29,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2024-06-14 14:50:29,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3284457478005865 [2024-06-14 14:50:29,989 INFO L175 Difference]: Start difference. First operand has 77 places, 35 transitions, 195 flow. Second operand 11 states and 112 transitions. [2024-06-14 14:50:29,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 52 transitions, 339 flow [2024-06-14 14:50:29,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 52 transitions, 307 flow, removed 7 selfloop flow, removed 11 redundant places. [2024-06-14 14:50:29,991 INFO L231 Difference]: Finished difference. Result has 68 places, 32 transitions, 172 flow [2024-06-14 14:50:29,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=172, PETRI_PLACES=68, PETRI_TRANSITIONS=32} [2024-06-14 14:50:29,992 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 38 predicate places. [2024-06-14 14:50:29,992 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 32 transitions, 172 flow [2024-06-14 14:50:29,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:50:29,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:50:29,992 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 14:50:29,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-06-14 14:50:29,993 INFO L420 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:50:29,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:50:29,993 INFO L85 PathProgramCache]: Analyzing trace with hash -192933188, now seen corresponding path program 10 times [2024-06-14 14:50:29,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:50:29,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120192873] [2024-06-14 14:50:29,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:50:29,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:50:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:50:37,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:50:37,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:50:37,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120192873] [2024-06-14 14:50:37,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120192873] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:50:37,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:50:37,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 14:50:37,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796267146] [2024-06-14 14:50:37,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:50:37,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 14:50:37,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:50:37,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 14:50:37,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-06-14 14:50:38,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 14:50:38,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 32 transitions, 172 flow. Second operand has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:50:38,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:50:38,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 14:50:38,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:50:38,301 INFO L124 PetriNetUnfolderBase]: 62/146 cut-off events. [2024-06-14 14:50:38,301 INFO L125 PetriNetUnfolderBase]: For 1182/1182 co-relation queries the response was YES. [2024-06-14 14:50:38,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 486 conditions, 146 events. 62/146 cut-off events. For 1182/1182 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 401 event pairs, 12 based on Foata normal form. 6/150 useless extension candidates. Maximal degree in co-relation 454. Up to 84 conditions per place. [2024-06-14 14:50:38,302 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 23 selfloop transitions, 3 changer transitions 20/48 dead transitions. [2024-06-14 14:50:38,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 48 transitions, 298 flow [2024-06-14 14:50:38,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:50:38,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:50:38,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 111 transitions. [2024-06-14 14:50:38,303 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3255131964809384 [2024-06-14 14:50:38,303 INFO L175 Difference]: Start difference. First operand has 68 places, 32 transitions, 172 flow. Second operand 11 states and 111 transitions. [2024-06-14 14:50:38,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 48 transitions, 298 flow [2024-06-14 14:50:38,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 48 transitions, 276 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-14 14:50:38,304 INFO L231 Difference]: Finished difference. Result has 64 places, 24 transitions, 121 flow [2024-06-14 14:50:38,304 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=121, PETRI_PLACES=64, PETRI_TRANSITIONS=24} [2024-06-14 14:50:38,306 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 34 predicate places. [2024-06-14 14:50:38,306 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 24 transitions, 121 flow [2024-06-14 14:50:38,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:50:38,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:50:38,306 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:50:38,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-06-14 14:50:38,307 INFO L420 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:50:38,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:50:38,307 INFO L85 PathProgramCache]: Analyzing trace with hash 136212222, now seen corresponding path program 1 times [2024-06-14 14:50:38,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:50:38,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491970933] [2024-06-14 14:50:38,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:50:38,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:50:38,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15