./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f 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/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-04 16:57:25,602 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-04 16:57:25,660 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-04 16:57:25,666 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-04 16:57:25,667 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-04 16:57:25,691 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-04 16:57:25,692 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-04 16:57:25,692 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-04 16:57:25,692 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-04 16:57:25,695 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-04 16:57:25,696 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-04 16:57:25,696 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-04 16:57:25,697 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-04 16:57:25,697 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-04 16:57:25,698 INFO L153 SettingsManager]: * Use SBE=true [2024-06-04 16:57:25,698 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-04 16:57:25,698 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-04 16:57:25,698 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-04 16:57:25,699 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-04 16:57:25,699 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-04 16:57:25,700 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-04 16:57:25,700 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-04 16:57:25,700 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-04 16:57:25,700 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-04 16:57:25,701 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-04 16:57:25,701 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-04 16:57:25,701 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-04 16:57:25,701 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-04 16:57:25,702 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-04 16:57:25,702 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-04 16:57:25,703 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-04 16:57:25,703 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-04 16:57:25,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 16:57:25,703 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-04 16:57:25,703 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-04 16:57:25,704 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-04 16:57:25,704 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-04 16:57:25,704 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-04 16:57:25,704 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-04 16:57:25,704 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-04 16:57:25,704 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-04 16:57:25,705 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-04 16:57:25,705 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-04 16:57:25,705 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-04 16:57:25,929 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-04 16:57:25,947 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-04 16:57:25,950 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-04 16:57:25,951 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-04 16:57:25,951 INFO L274 PluginConnector]: CDTParser initialized [2024-06-04 16:57:25,952 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-04 16:57:26,965 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-04 16:57:27,149 INFO L384 CDTParser]: Found 1 translation units. [2024-06-04 16:57:27,149 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-04 16:57:27,159 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d21f189af/703fe30d2d0748568d018b515749b3fd/FLAG009d75c66 [2024-06-04 16:57:27,172 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d21f189af/703fe30d2d0748568d018b515749b3fd [2024-06-04 16:57:27,174 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-04 16:57:27,175 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-04 16:57:27,176 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/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml [2024-06-04 16:57:27,329 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-04 16:57:27,330 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-04 16:57:27,331 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-04 16:57:27,331 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-04 16:57:27,335 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-04 16:57:27,336 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 04:57:27" (1/2) ... [2024-06-04 16:57:27,336 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a033bc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:57:27, skipping insertion in model container [2024-06-04 16:57:27,337 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 04:57:27" (1/2) ... [2024-06-04 16:57:27,338 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@644608c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:57:27, skipping insertion in model container [2024-06-04 16:57:27,339 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:57:27" (2/2) ... [2024-06-04 16:57:27,339 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a033bc3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:57:27, skipping insertion in model container [2024-06-04 16:57:27,340 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:57:27" (2/2) ... [2024-06-04 16:57:27,340 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-04 16:57:27,404 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-04 16:57:27,406 INFO L97 edCorrectnessWitness]: Location invariant before [L814-L814] (((((((((((((((! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__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_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_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_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_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((0 <= __unbuffered_cnt && 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_p1_EBX <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 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)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (0 <= __unbuffered_p1_EAX && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-04 16:57:27,406 INFO L97 edCorrectnessWitness]: Location invariant before [L813-L813] (((((((((((((((! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__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_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_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_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_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((0 <= __unbuffered_cnt && 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_p1_EBX <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 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)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (0 <= __unbuffered_p1_EAX && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-04 16:57:27,407 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-04 16:57:27,407 INFO L106 edCorrectnessWitness]: ghost_update [L811-L811] multithreaded = 1; [2024-06-04 16:57:27,445 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-04 16:57:27,762 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 16:57:27,773 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-04 16:57:28,011 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 16:57:28,052 INFO L206 MainTranslator]: Completed translation [2024-06-04 16:57:28,053 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:57:28 WrapperNode [2024-06-04 16:57:28,053 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-04 16:57:28,054 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-04 16:57:28,054 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-04 16:57:28,054 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-04 16:57:28,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:57:28" (1/1) ... [2024-06-04 16:57:28,088 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:57:28" (1/1) ... [2024-06-04 16:57:28,152 INFO L138 Inliner]: procedures = 174, calls = 36, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 113 [2024-06-04 16:57:28,152 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-04 16:57:28,154 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-04 16:57:28,154 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-04 16:57:28,154 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-04 16:57:28,162 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:57:28" (1/1) ... [2024-06-04 16:57:28,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:57:28" (1/1) ... [2024-06-04 16:57:28,182 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:57:28" (1/1) ... [2024-06-04 16:57:28,209 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-04 16:57:28,210 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:57:28" (1/1) ... [2024-06-04 16:57:28,210 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:57:28" (1/1) ... [2024-06-04 16:57:28,232 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:57:28" (1/1) ... [2024-06-04 16:57:28,234 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:57:28" (1/1) ... [2024-06-04 16:57:28,240 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:57:28" (1/1) ... [2024-06-04 16:57:28,243 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:57:28" (1/1) ... [2024-06-04 16:57:28,250 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-04 16:57:28,251 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-04 16:57:28,251 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-04 16:57:28,251 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-04 16:57:28,252 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:57:28" (1/1) ... [2024-06-04 16:57:28,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 16:57:28,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 16:57:28,273 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-04 16:57:28,284 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-04 16:57:28,302 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-04 16:57:28,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-04 16:57:28,303 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-04 16:57:28,303 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-04 16:57:28,304 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-04 16:57:28,304 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-04 16:57:28,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-04 16:57:28,304 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-04 16:57:28,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-04 16:57:28,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-04 16:57:28,305 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-04 16:57:28,436 INFO L244 CfgBuilder]: Building ICFG [2024-06-04 16:57:28,437 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-04 16:57:29,077 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-04 16:57:29,077 INFO L293 CfgBuilder]: Performing block encoding [2024-06-04 16:57:29,269 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-04 16:57:29,269 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-04 16:57:29,271 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 04:57:29 BoogieIcfgContainer [2024-06-04 16:57:29,271 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-04 16:57:29,273 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-04 16:57:29,273 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-04 16:57:29,275 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-04 16:57:29,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 04:57:27" (1/4) ... [2024-06-04 16:57:29,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f9da466 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 04:57:29, skipping insertion in model container [2024-06-04 16:57:29,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:57:27" (2/4) ... [2024-06-04 16:57:29,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f9da466 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 04:57:29, skipping insertion in model container [2024-06-04 16:57:29,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:57:28" (3/4) ... [2024-06-04 16:57:29,280 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f9da466 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 04:57:29, skipping insertion in model container [2024-06-04 16:57:29,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 04:57:29" (4/4) ... [2024-06-04 16:57:29,281 INFO L112 eAbstractionObserver]: Analyzing ICFG mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-04 16:57:29,294 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-04 16:57:29,294 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-04 16:57:29,294 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-04 16:57:29,367 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-04 16:57:29,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 31 transitions, 70 flow [2024-06-04 16:57:29,428 INFO L124 PetriNetUnfolderBase]: 0/29 cut-off events. [2024-06-04 16:57:29,440 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 16:57:29,441 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 40 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-04 16:57:29,441 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 31 transitions, 70 flow [2024-06-04 16:57:29,443 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 23 transitions, 52 flow [2024-06-04 16:57:29,483 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 16:57:29,489 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;@5df4ca21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 16:57:29,489 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-04 16:57:29,508 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 16:57:29,508 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-04 16:57:29,508 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 16:57:29,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:57:29,509 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-04 16:57:29,510 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-04 16:57:29,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:57:29,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1505849308, now seen corresponding path program 1 times [2024-06-04 16:57:29,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:57:29,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809624315] [2024-06-04 16:57:29,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:57:29,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:57:29,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:57:33,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:57:33,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:57:33,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809624315] [2024-06-04 16:57:33,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809624315] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:57:33,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:57:33,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-04 16:57:33,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097726510] [2024-06-04 16:57:33,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:57:33,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-04 16:57:33,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:57:33,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-04 16:57:33,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-04 16:57:33,135 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-04 16:57:33,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:57:33,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:57:33,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-04 16:57:33,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:57:33,318 INFO L124 PetriNetUnfolderBase]: 162/307 cut-off events. [2024-06-04 16:57:33,318 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-04 16:57:33,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 307 events. 162/307 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1113 event pairs, 97 based on Foata normal form. 1/301 useless extension candidates. Maximal degree in co-relation 606. Up to 288 conditions per place. [2024-06-04 16:57:33,335 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 23 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2024-06-04 16:57:33,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 119 flow [2024-06-04 16:57:33,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-04 16:57:33,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-04 16:57:33,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2024-06-04 16:57:33,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5591397849462365 [2024-06-04 16:57:33,345 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 52 flow. Second operand 3 states and 52 transitions. [2024-06-04 16:57:33,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 119 flow [2024-06-04 16:57:33,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-04 16:57:33,348 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 71 flow [2024-06-04 16:57:33,350 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-04 16:57:33,352 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2024-06-04 16:57:33,352 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 71 flow [2024-06-04 16:57:33,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:57:33,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:57:33,353 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:57:33,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-04 16:57:33,353 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-04 16:57:33,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:57:33,354 INFO L85 PathProgramCache]: Analyzing trace with hash -282759621, now seen corresponding path program 1 times [2024-06-04 16:57:33,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:57:33,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002209205] [2024-06-04 16:57:33,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:57:33,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:57:33,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:57:35,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:57:35,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:57:35,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002209205] [2024-06-04 16:57:35,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002209205] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:57:35,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:57:35,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 16:57:35,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349699527] [2024-06-04 16:57:35,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:57:35,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 16:57:35,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:57:35,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 16:57:35,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-04 16:57:35,936 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-04 16:57:35,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 71 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:57:35,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:57:35,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-04 16:57:35,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:57:36,127 INFO L124 PetriNetUnfolderBase]: 159/304 cut-off events. [2024-06-04 16:57:36,128 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-06-04 16:57:36,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 304 events. 159/304 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1089 event pairs, 79 based on Foata normal form. 2/306 useless extension candidates. Maximal degree in co-relation 679. Up to 274 conditions per place. [2024-06-04 16:57:36,133 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 27 selfloop transitions, 5 changer transitions 0/35 dead transitions. [2024-06-04 16:57:36,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 161 flow [2024-06-04 16:57:36,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 16:57:36,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 16:57:36,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2024-06-04 16:57:36,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.532258064516129 [2024-06-04 16:57:36,136 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 71 flow. Second operand 4 states and 66 transitions. [2024-06-04 16:57:36,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 161 flow [2024-06-04 16:57:36,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 35 transitions, 158 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-04 16:57:36,140 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 95 flow [2024-06-04 16:57:36,140 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-04 16:57:36,140 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 4 predicate places. [2024-06-04 16:57:36,140 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 95 flow [2024-06-04 16:57:36,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:57:36,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:57:36,141 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:57:36,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-04 16:57:36,141 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-04 16:57:36,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:57:36,141 INFO L85 PathProgramCache]: Analyzing trace with hash -175612531, now seen corresponding path program 1 times [2024-06-04 16:57:36,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:57:36,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976741827] [2024-06-04 16:57:36,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:57:36,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:57:36,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:57:38,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:57:38,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:57:38,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976741827] [2024-06-04 16:57:38,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976741827] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:57:38,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:57:38,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 16:57:38,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846069058] [2024-06-04 16:57:38,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:57:38,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:57:38,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:57:38,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:57:38,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:57:38,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:57:38,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 95 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:57:38,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:57:38,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:57:38,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:57:38,687 INFO L124 PetriNetUnfolderBase]: 187/339 cut-off events. [2024-06-04 16:57:38,687 INFO L125 PetriNetUnfolderBase]: For 197/197 co-relation queries the response was YES. [2024-06-04 16:57:38,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 869 conditions, 339 events. 187/339 cut-off events. For 197/197 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1188 event pairs, 67 based on Foata normal form. 3/342 useless extension candidates. Maximal degree in co-relation 852. Up to 293 conditions per place. [2024-06-04 16:57:38,689 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 36 selfloop transitions, 11 changer transitions 0/49 dead transitions. [2024-06-04 16:57:38,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 49 transitions, 255 flow [2024-06-04 16:57:38,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:57:38,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:57:38,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2024-06-04 16:57:38,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5290322580645161 [2024-06-04 16:57:38,691 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 95 flow. Second operand 5 states and 82 transitions. [2024-06-04 16:57:38,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 49 transitions, 255 flow [2024-06-04 16:57:38,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 49 transitions, 246 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-04 16:57:38,693 INFO L231 Difference]: Finished difference. Result has 39 places, 35 transitions, 162 flow [2024-06-04 16:57:38,694 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=5, PETRI_FLOW=162, PETRI_PLACES=39, PETRI_TRANSITIONS=35} [2024-06-04 16:57:38,694 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2024-06-04 16:57:38,694 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 35 transitions, 162 flow [2024-06-04 16:57:38,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:57:38,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:57:38,695 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:57:38,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-04 16:57:38,695 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-04 16:57:38,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:57:38,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1149020006, now seen corresponding path program 1 times [2024-06-04 16:57:38,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:57:38,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393308825] [2024-06-04 16:57:38,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:57:38,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:57:38,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:57:41,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-04 16:57:41,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:57:41,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393308825] [2024-06-04 16:57:41,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393308825] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:57:41,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:57:41,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 16:57:41,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181717668] [2024-06-04 16:57:41,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:57:41,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 16:57:41,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:57:41,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 16:57:41,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-04 16:57:41,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:57:41,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 35 transitions, 162 flow. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:57:41,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:57:41,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:57:41,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:57:41,930 INFO L124 PetriNetUnfolderBase]: 188/341 cut-off events. [2024-06-04 16:57:41,931 INFO L125 PetriNetUnfolderBase]: For 417/417 co-relation queries the response was YES. [2024-06-04 16:57:41,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1046 conditions, 341 events. 188/341 cut-off events. For 417/417 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1198 event pairs, 46 based on Foata normal form. 3/344 useless extension candidates. Maximal degree in co-relation 1026. Up to 282 conditions per place. [2024-06-04 16:57:41,933 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 40 selfloop transitions, 14 changer transitions 0/56 dead transitions. [2024-06-04 16:57:41,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 56 transitions, 340 flow [2024-06-04 16:57:41,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 16:57:41,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 16:57:41,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2024-06-04 16:57:41,935 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5161290322580645 [2024-06-04 16:57:41,935 INFO L175 Difference]: Start difference. First operand has 39 places, 35 transitions, 162 flow. Second operand 6 states and 96 transitions. [2024-06-04 16:57:41,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 56 transitions, 340 flow [2024-06-04 16:57:41,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 56 transitions, 336 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-06-04 16:57:41,937 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 214 flow [2024-06-04 16:57:41,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=214, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2024-06-04 16:57:41,938 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 15 predicate places. [2024-06-04 16:57:41,938 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 214 flow [2024-06-04 16:57:41,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:57:41,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:57:41,939 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:57:41,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-04 16:57:41,939 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:57:41,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:57:41,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1260475274, now seen corresponding path program 1 times [2024-06-04 16:57:41,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:57:41,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828797775] [2024-06-04 16:57:41,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:57:41,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:57:41,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:57:44,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:57:44,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:57:44,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828797775] [2024-06-04 16:57:44,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828797775] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:57:44,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:57:44,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 16:57:44,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408154221] [2024-06-04 16:57:44,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:57:44,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 16:57:44,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:57:44,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 16:57:44,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-04 16:57:45,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:57:45,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 214 flow. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:57:45,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:57:45,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:57:45,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:57:45,352 INFO L124 PetriNetUnfolderBase]: 189/344 cut-off events. [2024-06-04 16:57:45,352 INFO L125 PetriNetUnfolderBase]: For 640/640 co-relation queries the response was YES. [2024-06-04 16:57:45,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1179 conditions, 344 events. 189/344 cut-off events. For 640/640 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1218 event pairs, 24 based on Foata normal form. 6/350 useless extension candidates. Maximal degree in co-relation 1156. Up to 259 conditions per place. [2024-06-04 16:57:45,355 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 40 selfloop transitions, 16 changer transitions 0/58 dead transitions. [2024-06-04 16:57:45,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 58 transitions, 386 flow [2024-06-04 16:57:45,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:57:45,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:57:45,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2024-06-04 16:57:45,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4838709677419355 [2024-06-04 16:57:45,356 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 214 flow. Second operand 7 states and 105 transitions. [2024-06-04 16:57:45,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 58 transitions, 386 flow [2024-06-04 16:57:45,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 354 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-04 16:57:45,359 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 217 flow [2024-06-04 16:57:45,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=217, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2024-06-04 16:57:45,360 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 17 predicate places. [2024-06-04 16:57:45,360 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 217 flow [2024-06-04 16:57:45,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:57:45,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:57:45,360 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:57:45,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-04 16:57:45,361 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-04 16:57:45,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:57:45,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1934851801, now seen corresponding path program 1 times [2024-06-04 16:57:45,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:57:45,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133975228] [2024-06-04 16:57:45,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:57:45,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:57:45,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:57:50,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:57:50,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:57:50,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133975228] [2024-06-04 16:57:50,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133975228] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:57:50,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:57:50,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 16:57:50,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279938523] [2024-06-04 16:57:50,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:57:50,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 16:57:50,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:57:50,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 16:57:50,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-04 16:57:50,448 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 16:57:50,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 217 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-04 16:57:50,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:57:50,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 16:57:50,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:57:50,685 INFO L124 PetriNetUnfolderBase]: 187/341 cut-off events. [2024-06-04 16:57:50,686 INFO L125 PetriNetUnfolderBase]: For 747/747 co-relation queries the response was YES. [2024-06-04 16:57:50,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1226 conditions, 341 events. 187/341 cut-off events. For 747/747 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1194 event pairs, 47 based on Foata normal form. 1/342 useless extension candidates. Maximal degree in co-relation 1202. Up to 329 conditions per place. [2024-06-04 16:57:50,690 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 35 selfloop transitions, 6 changer transitions 0/43 dead transitions. [2024-06-04 16:57:50,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 43 transitions, 311 flow [2024-06-04 16:57:50,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:57:50,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:57:50,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2024-06-04 16:57:50,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-04 16:57:50,692 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 217 flow. Second operand 5 states and 60 transitions. [2024-06-04 16:57:50,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 43 transitions, 311 flow [2024-06-04 16:57:50,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 43 transitions, 270 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-04 16:57:50,695 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 193 flow [2024-06-04 16:57:50,695 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=193, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2024-06-04 16:57:50,695 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 17 predicate places. [2024-06-04 16:57:50,696 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 193 flow [2024-06-04 16:57:50,696 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-04 16:57:50,696 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:57:50,696 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:57:50,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-04 16:57:50,696 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-04 16:57:50,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:57:50,697 INFO L85 PathProgramCache]: Analyzing trace with hash 137115187, now seen corresponding path program 1 times [2024-06-04 16:57:50,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:57:50,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627112429] [2024-06-04 16:57:50,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:57:50,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:57:50,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:57:56,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:57:56,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:57:56,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627112429] [2024-06-04 16:57:56,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627112429] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:57:56,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:57:56,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 16:57:56,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546613443] [2024-06-04 16:57:56,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:57:56,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 16:57:56,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:57:56,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 16:57:56,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 16:57:56,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 16:57:56,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 193 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-04 16:57:56,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:57:56,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 16:57:56,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:57:56,888 INFO L124 PetriNetUnfolderBase]: 181/332 cut-off events. [2024-06-04 16:57:56,888 INFO L125 PetriNetUnfolderBase]: For 877/877 co-relation queries the response was YES. [2024-06-04 16:57:56,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1154 conditions, 332 events. 181/332 cut-off events. For 877/877 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1134 event pairs, 44 based on Foata normal form. 3/335 useless extension candidates. Maximal degree in co-relation 1128. Up to 311 conditions per place. [2024-06-04 16:57:56,890 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 38 selfloop transitions, 8 changer transitions 0/48 dead transitions. [2024-06-04 16:57:56,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 48 transitions, 311 flow [2024-06-04 16:57:56,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 16:57:56,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 16:57:56,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2024-06-04 16:57:56,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3817204301075269 [2024-06-04 16:57:56,892 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 193 flow. Second operand 6 states and 71 transitions. [2024-06-04 16:57:56,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 48 transitions, 311 flow [2024-06-04 16:57:56,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 48 transitions, 296 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-06-04 16:57:56,895 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 211 flow [2024-06-04 16:57:56,895 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=211, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2024-06-04 16:57:56,895 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 19 predicate places. [2024-06-04 16:57:56,896 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 211 flow [2024-06-04 16:57:56,896 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-04 16:57:56,896 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:57:56,896 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:57:56,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-04 16:57:56,896 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-04 16:57:56,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:57:56,897 INFO L85 PathProgramCache]: Analyzing trace with hash -514451052, now seen corresponding path program 1 times [2024-06-04 16:57:56,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:57:56,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325016665] [2024-06-04 16:57:56,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:57:56,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:57:56,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:58:01,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:58:01,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:58:01,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325016665] [2024-06-04 16:58:01,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325016665] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:58:01,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:58:01,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 16:58:01,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037506200] [2024-06-04 16:58:01,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:58:01,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 16:58:01,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:58:01,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 16:58:01,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 16:58:01,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 16:58:01,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 211 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-04 16:58:01,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:58:01,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 16:58:01,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:58:01,402 INFO L124 PetriNetUnfolderBase]: 182/334 cut-off events. [2024-06-04 16:58:01,403 INFO L125 PetriNetUnfolderBase]: For 1009/1009 co-relation queries the response was YES. [2024-06-04 16:58:01,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1226 conditions, 334 events. 182/334 cut-off events. For 1009/1009 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1158 event pairs, 43 based on Foata normal form. 2/336 useless extension candidates. Maximal degree in co-relation 1200. Up to 288 conditions per place. [2024-06-04 16:58:01,406 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 37 selfloop transitions, 13 changer transitions 0/52 dead transitions. [2024-06-04 16:58:01,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 52 transitions, 362 flow [2024-06-04 16:58:01,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 16:58:01,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 16:58:01,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2024-06-04 16:58:01,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41397849462365593 [2024-06-04 16:58:01,409 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 211 flow. Second operand 6 states and 77 transitions. [2024-06-04 16:58:01,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 52 transitions, 362 flow [2024-06-04 16:58:01,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 52 transitions, 345 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-04 16:58:01,413 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 242 flow [2024-06-04 16:58:01,418 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=242, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2024-06-04 16:58:01,419 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 21 predicate places. [2024-06-04 16:58:01,419 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 242 flow [2024-06-04 16:58:01,420 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-04 16:58:01,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:58:01,420 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:58:01,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-04 16:58:01,420 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-04 16:58:01,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:58:01,421 INFO L85 PathProgramCache]: Analyzing trace with hash 328483800, now seen corresponding path program 2 times [2024-06-04 16:58:01,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:58:01,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116555993] [2024-06-04 16:58:01,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:58:01,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:58:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:58:05,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:58:05,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:58:05,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116555993] [2024-06-04 16:58:05,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116555993] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:58:05,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:58:05,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 16:58:05,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581009125] [2024-06-04 16:58:05,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:58:05,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 16:58:05,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:58:05,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 16:58:05,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 16:58:05,516 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 16:58:05,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 242 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-04 16:58:05,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:58:05,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 16:58:05,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:58:05,751 INFO L124 PetriNetUnfolderBase]: 177/324 cut-off events. [2024-06-04 16:58:05,751 INFO L125 PetriNetUnfolderBase]: For 1164/1164 co-relation queries the response was YES. [2024-06-04 16:58:05,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1228 conditions, 324 events. 177/324 cut-off events. For 1164/1164 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1103 event pairs, 42 based on Foata normal form. 1/325 useless extension candidates. Maximal degree in co-relation 1201. Up to 309 conditions per place. [2024-06-04 16:58:05,753 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 38 selfloop transitions, 8 changer transitions 0/48 dead transitions. [2024-06-04 16:58:05,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 48 transitions, 348 flow [2024-06-04 16:58:05,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 16:58:05,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 16:58:05,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2024-06-04 16:58:05,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3709677419354839 [2024-06-04 16:58:05,755 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 242 flow. Second operand 6 states and 69 transitions. [2024-06-04 16:58:05,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 48 transitions, 348 flow [2024-06-04 16:58:05,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 48 transitions, 333 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-04 16:58:05,757 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 248 flow [2024-06-04 16:58:05,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=248, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2024-06-04 16:58:05,758 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 24 predicate places. [2024-06-04 16:58:05,758 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 248 flow [2024-06-04 16:58:05,758 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-04 16:58:05,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:58:05,758 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:58:05,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-04 16:58:05,759 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-04 16:58:05,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:58:05,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1553636556, now seen corresponding path program 1 times [2024-06-04 16:58:05,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:58:05,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725445858] [2024-06-04 16:58:05,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:58:05,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:58:05,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:58:10,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:58:10,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:58:10,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725445858] [2024-06-04 16:58:10,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725445858] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:58:10,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:58:10,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:58:10,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275351662] [2024-06-04 16:58:10,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:58:10,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:58:10,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:58:10,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:58:10,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:58:10,242 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 16:58:10,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 248 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-04 16:58:10,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:58:10,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 16:58:10,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:58:10,519 INFO L124 PetriNetUnfolderBase]: 215/386 cut-off events. [2024-06-04 16:58:10,519 INFO L125 PetriNetUnfolderBase]: For 1838/1838 co-relation queries the response was YES. [2024-06-04 16:58:10,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1463 conditions, 386 events. 215/386 cut-off events. For 1838/1838 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1383 event pairs, 49 based on Foata normal form. 6/392 useless extension candidates. Maximal degree in co-relation 1435. Up to 276 conditions per place. [2024-06-04 16:58:10,522 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 46 selfloop transitions, 18 changer transitions 0/66 dead transitions. [2024-06-04 16:58:10,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 66 transitions, 464 flow [2024-06-04 16:58:10,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:58:10,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:58:10,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2024-06-04 16:58:10,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40725806451612906 [2024-06-04 16:58:10,523 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 248 flow. Second operand 8 states and 101 transitions. [2024-06-04 16:58:10,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 66 transitions, 464 flow [2024-06-04 16:58:10,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 66 transitions, 430 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-04 16:58:10,527 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 297 flow [2024-06-04 16:58:10,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=297, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2024-06-04 16:58:10,527 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 27 predicate places. [2024-06-04 16:58:10,528 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 297 flow [2024-06-04 16:58:10,528 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-04 16:58:10,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:58:10,528 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:58:10,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-04 16:58:10,528 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-04 16:58:10,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:58:10,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1587045232, now seen corresponding path program 2 times [2024-06-04 16:58:10,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:58:10,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588630316] [2024-06-04 16:58:10,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:58:10,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:58:10,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:58:14,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:58:14,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:58:14,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588630316] [2024-06-04 16:58:14,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588630316] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:58:14,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:58:14,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:58:14,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834067546] [2024-06-04 16:58:14,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:58:14,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:58:14,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:58:14,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:58:14,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:58:14,747 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 16:58:14,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 297 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-04 16:58:14,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:58:14,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 16:58:14,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:58:15,012 INFO L124 PetriNetUnfolderBase]: 224/401 cut-off events. [2024-06-04 16:58:15,013 INFO L125 PetriNetUnfolderBase]: For 2166/2166 co-relation queries the response was YES. [2024-06-04 16:58:15,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1672 conditions, 401 events. 224/401 cut-off events. For 2166/2166 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1452 event pairs, 48 based on Foata normal form. 3/404 useless extension candidates. Maximal degree in co-relation 1642. Up to 377 conditions per place. [2024-06-04 16:58:15,015 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 48 selfloop transitions, 10 changer transitions 0/60 dead transitions. [2024-06-04 16:58:15,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 449 flow [2024-06-04 16:58:15,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:58:15,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:58:15,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2024-06-04 16:58:15,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3686635944700461 [2024-06-04 16:58:15,017 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 297 flow. Second operand 7 states and 80 transitions. [2024-06-04 16:58:15,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 449 flow [2024-06-04 16:58:15,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 60 transitions, 430 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-04 16:58:15,020 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 321 flow [2024-06-04 16:58:15,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=321, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2024-06-04 16:58:15,020 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 31 predicate places. [2024-06-04 16:58:15,021 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 321 flow [2024-06-04 16:58:15,021 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-04 16:58:15,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:58:15,021 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:58:15,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-04 16:58:15,021 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-04 16:58:15,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:58:15,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1376505036, now seen corresponding path program 3 times [2024-06-04 16:58:15,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:58:15,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606908053] [2024-06-04 16:58:15,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:58:15,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:58:15,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:58:19,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:58:19,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:58:19,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606908053] [2024-06-04 16:58:19,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606908053] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:58:19,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:58:19,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:58:19,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744454847] [2024-06-04 16:58:19,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:58:19,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:58:19,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:58:19,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:58:19,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:58:19,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 16:58:19,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 321 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-04 16:58:19,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:58:19,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 16:58:19,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:58:19,605 INFO L124 PetriNetUnfolderBase]: 218/392 cut-off events. [2024-06-04 16:58:19,605 INFO L125 PetriNetUnfolderBase]: For 2390/2390 co-relation queries the response was YES. [2024-06-04 16:58:19,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1673 conditions, 392 events. 218/392 cut-off events. For 2390/2390 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1411 event pairs, 46 based on Foata normal form. 3/395 useless extension candidates. Maximal degree in co-relation 1641. Up to 356 conditions per place. [2024-06-04 16:58:19,608 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 49 selfloop transitions, 14 changer transitions 0/65 dead transitions. [2024-06-04 16:58:19,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 65 transitions, 495 flow [2024-06-04 16:58:19,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:58:19,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:58:19,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2024-06-04 16:58:19,609 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3709677419354839 [2024-06-04 16:58:19,609 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 321 flow. Second operand 8 states and 92 transitions. [2024-06-04 16:58:19,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 65 transitions, 495 flow [2024-06-04 16:58:19,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 65 transitions, 470 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-04 16:58:19,612 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 351 flow [2024-06-04 16:58:19,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=351, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2024-06-04 16:58:19,613 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 34 predicate places. [2024-06-04 16:58:19,613 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 351 flow [2024-06-04 16:58:19,613 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-04 16:58:19,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:58:19,613 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:58:19,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-04 16:58:19,614 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-04 16:58:19,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:58:19,614 INFO L85 PathProgramCache]: Analyzing trace with hash -470005645, now seen corresponding path program 1 times [2024-06-04 16:58:19,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:58:19,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861226185] [2024-06-04 16:58:19,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:58:19,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:58:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:58:24,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:58:24,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:58:24,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861226185] [2024-06-04 16:58:24,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861226185] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:58:24,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:58:24,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:58:24,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018636375] [2024-06-04 16:58:24,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:58:24,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:58:24,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:58:24,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:58:24,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:58:24,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 16:58:24,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 351 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:58:24,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:58:24,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 16:58:24,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:58:25,083 INFO L124 PetriNetUnfolderBase]: 250/449 cut-off events. [2024-06-04 16:58:25,084 INFO L125 PetriNetUnfolderBase]: For 2812/2812 co-relation queries the response was YES. [2024-06-04 16:58:25,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1958 conditions, 449 events. 250/449 cut-off events. For 2812/2812 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1707 event pairs, 96 based on Foata normal form. 1/450 useless extension candidates. Maximal degree in co-relation 1925. Up to 395 conditions per place. [2024-06-04 16:58:25,087 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 58 selfloop transitions, 19 changer transitions 0/79 dead transitions. [2024-06-04 16:58:25,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 79 transitions, 663 flow [2024-06-04 16:58:25,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:58:25,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:58:25,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2024-06-04 16:58:25,089 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3709677419354839 [2024-06-04 16:58:25,089 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 351 flow. Second operand 8 states and 92 transitions. [2024-06-04 16:58:25,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 79 transitions, 663 flow [2024-06-04 16:58:25,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 79 transitions, 624 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-04 16:58:25,094 INFO L231 Difference]: Finished difference. Result has 69 places, 66 transitions, 472 flow [2024-06-04 16:58:25,094 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=472, PETRI_PLACES=69, PETRI_TRANSITIONS=66} [2024-06-04 16:58:25,095 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 39 predicate places. [2024-06-04 16:58:25,095 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 66 transitions, 472 flow [2024-06-04 16:58:25,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:58:25,095 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:58:25,095 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:58:25,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-04 16:58:25,096 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:58:25,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:58:25,096 INFO L85 PathProgramCache]: Analyzing trace with hash 15155261, now seen corresponding path program 2 times [2024-06-04 16:58:25,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:58:25,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661504670] [2024-06-04 16:58:25,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:58:25,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:58:25,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:58:30,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:58:30,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:58:30,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661504670] [2024-06-04 16:58:30,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661504670] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:58:30,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:58:30,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:58:30,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700747899] [2024-06-04 16:58:30,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:58:30,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:58:30,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:58:30,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:58:30,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:58:30,808 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 16:58:30,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 66 transitions, 472 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:58:30,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:58:30,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 16:58:30,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:58:31,127 INFO L124 PetriNetUnfolderBase]: 262/469 cut-off events. [2024-06-04 16:58:31,127 INFO L125 PetriNetUnfolderBase]: For 3392/3392 co-relation queries the response was YES. [2024-06-04 16:58:31,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2170 conditions, 469 events. 262/469 cut-off events. For 3392/3392 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1806 event pairs, 50 based on Foata normal form. 1/470 useless extension candidates. Maximal degree in co-relation 2133. Up to 391 conditions per place. [2024-06-04 16:58:31,131 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 64 selfloop transitions, 24 changer transitions 0/90 dead transitions. [2024-06-04 16:58:31,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 90 transitions, 797 flow [2024-06-04 16:58:31,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:58:31,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:58:31,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2024-06-04 16:58:31,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39919354838709675 [2024-06-04 16:58:31,133 INFO L175 Difference]: Start difference. First operand has 69 places, 66 transitions, 472 flow. Second operand 8 states and 99 transitions. [2024-06-04 16:58:31,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 90 transitions, 797 flow [2024-06-04 16:58:31,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 90 transitions, 785 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-06-04 16:58:31,139 INFO L231 Difference]: Finished difference. Result has 78 places, 74 transitions, 601 flow [2024-06-04 16:58:31,139 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=601, PETRI_PLACES=78, PETRI_TRANSITIONS=74} [2024-06-04 16:58:31,140 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 48 predicate places. [2024-06-04 16:58:31,140 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 74 transitions, 601 flow [2024-06-04 16:58:31,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:58:31,140 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:58:31,141 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:58:31,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-04 16:58:31,141 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-04 16:58:31,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:58:31,142 INFO L85 PathProgramCache]: Analyzing trace with hash 322704401, now seen corresponding path program 3 times [2024-06-04 16:58:31,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:58:31,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064670448] [2024-06-04 16:58:31,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:58:31,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:58:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:58:35,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-04 16:58:35,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:58:35,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064670448] [2024-06-04 16:58:35,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064670448] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:58:35,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:58:35,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:58:35,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718599632] [2024-06-04 16:58:35,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:58:35,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:58:35,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:58:35,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:58:35,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:58:35,933 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 16:58:35,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 74 transitions, 601 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:58:35,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:58:35,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 16:58:35,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:58:36,303 INFO L124 PetriNetUnfolderBase]: 260/466 cut-off events. [2024-06-04 16:58:36,303 INFO L125 PetriNetUnfolderBase]: For 4029/4029 co-relation queries the response was YES. [2024-06-04 16:58:36,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2302 conditions, 466 events. 260/466 cut-off events. For 4029/4029 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1783 event pairs, 48 based on Foata normal form. 1/467 useless extension candidates. Maximal degree in co-relation 2260. Up to 400 conditions per place. [2024-06-04 16:58:36,307 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 64 selfloop transitions, 22 changer transitions 0/88 dead transitions. [2024-06-04 16:58:36,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 88 transitions, 829 flow [2024-06-04 16:58:36,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:58:36,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:58:36,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2024-06-04 16:58:36,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3911290322580645 [2024-06-04 16:58:36,309 INFO L175 Difference]: Start difference. First operand has 78 places, 74 transitions, 601 flow. Second operand 8 states and 97 transitions. [2024-06-04 16:58:36,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 88 transitions, 829 flow [2024-06-04 16:58:36,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 88 transitions, 786 flow, removed 18 selfloop flow, removed 2 redundant places. [2024-06-04 16:58:36,315 INFO L231 Difference]: Finished difference. Result has 86 places, 77 transitions, 647 flow [2024-06-04 16:58:36,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=647, PETRI_PLACES=86, PETRI_TRANSITIONS=77} [2024-06-04 16:58:36,316 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 56 predicate places. [2024-06-04 16:58:36,317 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 77 transitions, 647 flow [2024-06-04 16:58:36,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:58:36,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:58:36,317 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:58:36,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-04 16:58:36,317 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-04 16:58:36,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:58:36,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1729931091, now seen corresponding path program 4 times [2024-06-04 16:58:36,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:58:36,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719480944] [2024-06-04 16:58:36,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:58:36,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:58:36,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:58:42,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:58:42,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:58:42,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719480944] [2024-06-04 16:58:42,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719480944] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:58:42,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:58:42,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 16:58:42,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851412603] [2024-06-04 16:58:42,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:58:42,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 16:58:42,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:58:42,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 16:58:42,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-04 16:58:42,426 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 16:58:42,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 77 transitions, 647 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:58:42,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:58:42,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 16:58:42,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:58:42,743 INFO L124 PetriNetUnfolderBase]: 258/463 cut-off events. [2024-06-04 16:58:42,743 INFO L125 PetriNetUnfolderBase]: For 4489/4489 co-relation queries the response was YES. [2024-06-04 16:58:42,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2345 conditions, 463 events. 258/463 cut-off events. For 4489/4489 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1768 event pairs, 50 based on Foata normal form. 1/464 useless extension candidates. Maximal degree in co-relation 2299. Up to 362 conditions per place. [2024-06-04 16:58:42,746 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 56 selfloop transitions, 34 changer transitions 0/92 dead transitions. [2024-06-04 16:58:42,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 92 transitions, 926 flow [2024-06-04 16:58:42,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:58:42,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:58:42,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2024-06-04 16:58:42,749 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.423963133640553 [2024-06-04 16:58:42,749 INFO L175 Difference]: Start difference. First operand has 86 places, 77 transitions, 647 flow. Second operand 7 states and 92 transitions. [2024-06-04 16:58:42,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 92 transitions, 926 flow [2024-06-04 16:58:42,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 92 transitions, 887 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-04 16:58:42,756 INFO L231 Difference]: Finished difference. Result has 89 places, 81 transitions, 747 flow [2024-06-04 16:58:42,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=747, PETRI_PLACES=89, PETRI_TRANSITIONS=81} [2024-06-04 16:58:42,756 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 59 predicate places. [2024-06-04 16:58:42,757 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 81 transitions, 747 flow [2024-06-04 16:58:42,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:58:42,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:58:42,757 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:58:42,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-04 16:58:42,758 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-04 16:58:42,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:58:42,759 INFO L85 PathProgramCache]: Analyzing trace with hash 803673648, now seen corresponding path program 1 times [2024-06-04 16:58:42,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:58:42,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316487854] [2024-06-04 16:58:42,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:58:42,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:58:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:58:48,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:58:48,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:58:48,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316487854] [2024-06-04 16:58:48,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316487854] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:58:48,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:58:48,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:58:48,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427691496] [2024-06-04 16:58:48,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:58:48,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:58:48,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:58:48,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:58:48,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:58:48,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 16:58:48,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 81 transitions, 747 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:58:48,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:58:48,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 16:58:48,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:58:49,298 INFO L124 PetriNetUnfolderBase]: 304/539 cut-off events. [2024-06-04 16:58:49,299 INFO L125 PetriNetUnfolderBase]: For 5878/5878 co-relation queries the response was YES. [2024-06-04 16:58:49,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2800 conditions, 539 events. 304/539 cut-off events. For 5878/5878 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2149 event pairs, 49 based on Foata normal form. 3/542 useless extension candidates. Maximal degree in co-relation 2752. Up to 427 conditions per place. [2024-06-04 16:58:49,303 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 81 selfloop transitions, 28 changer transitions 0/111 dead transitions. [2024-06-04 16:58:49,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 111 transitions, 1133 flow [2024-06-04 16:58:49,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:58:49,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:58:49,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-04 16:58:49,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-04 16:58:49,304 INFO L175 Difference]: Start difference. First operand has 89 places, 81 transitions, 747 flow. Second operand 10 states and 124 transitions. [2024-06-04 16:58:49,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 111 transitions, 1133 flow [2024-06-04 16:58:49,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 111 transitions, 1069 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-06-04 16:58:49,315 INFO L231 Difference]: Finished difference. Result has 97 places, 91 transitions, 860 flow [2024-06-04 16:58:49,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=860, PETRI_PLACES=97, PETRI_TRANSITIONS=91} [2024-06-04 16:58:49,316 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 67 predicate places. [2024-06-04 16:58:49,316 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 91 transitions, 860 flow [2024-06-04 16:58:49,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:58:49,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:58:49,316 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:58:49,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-04 16:58:49,317 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-04 16:58:49,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:58:49,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1391165080, now seen corresponding path program 2 times [2024-06-04 16:58:49,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:58:49,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116242080] [2024-06-04 16:58:49,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:58:49,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:58:49,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:58:55,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:58:55,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:58:55,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116242080] [2024-06-04 16:58:55,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116242080] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:58:55,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:58:55,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:58:55,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677259255] [2024-06-04 16:58:55,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:58:55,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:58:55,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:58:55,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:58:55,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:58:56,033 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 16:58:56,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 91 transitions, 860 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-04 16:58:56,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:58:56,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 16:58:56,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:58:56,488 INFO L124 PetriNetUnfolderBase]: 298/530 cut-off events. [2024-06-04 16:58:56,489 INFO L125 PetriNetUnfolderBase]: For 5185/5185 co-relation queries the response was YES. [2024-06-04 16:58:56,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2774 conditions, 530 events. 298/530 cut-off events. For 5185/5185 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2108 event pairs, 50 based on Foata normal form. 3/533 useless extension candidates. Maximal degree in co-relation 2724. Up to 423 conditions per place. [2024-06-04 16:58:56,498 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 78 selfloop transitions, 29 changer transitions 0/109 dead transitions. [2024-06-04 16:58:56,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 109 transitions, 1122 flow [2024-06-04 16:58:56,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:58:56,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:58:56,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-04 16:58:56,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3935483870967742 [2024-06-04 16:58:56,500 INFO L175 Difference]: Start difference. First operand has 97 places, 91 transitions, 860 flow. Second operand 10 states and 122 transitions. [2024-06-04 16:58:56,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 109 transitions, 1122 flow [2024-06-04 16:58:56,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 109 transitions, 1089 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-04 16:58:56,514 INFO L231 Difference]: Finished difference. Result has 104 places, 91 transitions, 890 flow [2024-06-04 16:58:56,514 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=890, PETRI_PLACES=104, PETRI_TRANSITIONS=91} [2024-06-04 16:58:56,514 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 74 predicate places. [2024-06-04 16:58:56,514 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 91 transitions, 890 flow [2024-06-04 16:58:56,515 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-04 16:58:56,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:58:56,515 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:58:56,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-04 16:58:56,515 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-04 16:58:56,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:58:56,518 INFO L85 PathProgramCache]: Analyzing trace with hash -469915435, now seen corresponding path program 5 times [2024-06-04 16:58:56,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:58:56,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519550781] [2024-06-04 16:58:56,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:58:56,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:58:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:59:00,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:59:00,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:59:00,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519550781] [2024-06-04 16:59:00,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519550781] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:59:00,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:59:00,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:59:00,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895058388] [2024-06-04 16:59:00,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:59:00,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:59:00,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:59:00,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:59:00,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:59:01,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 16:59:01,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 91 transitions, 890 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:59:01,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:59:01,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 16:59:01,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:59:01,403 INFO L124 PetriNetUnfolderBase]: 296/527 cut-off events. [2024-06-04 16:59:01,403 INFO L125 PetriNetUnfolderBase]: For 5454/5454 co-relation queries the response was YES. [2024-06-04 16:59:01,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2837 conditions, 527 events. 296/527 cut-off events. For 5454/5454 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2082 event pairs, 54 based on Foata normal form. 1/528 useless extension candidates. Maximal degree in co-relation 2785. Up to 454 conditions per place. [2024-06-04 16:59:01,407 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 69 selfloop transitions, 28 changer transitions 0/99 dead transitions. [2024-06-04 16:59:01,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 99 transitions, 1104 flow [2024-06-04 16:59:01,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:59:01,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:59:01,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 85 transitions. [2024-06-04 16:59:01,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.391705069124424 [2024-06-04 16:59:01,409 INFO L175 Difference]: Start difference. First operand has 104 places, 91 transitions, 890 flow. Second operand 7 states and 85 transitions. [2024-06-04 16:59:01,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 99 transitions, 1104 flow [2024-06-04 16:59:01,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 99 transitions, 1044 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-04 16:59:01,418 INFO L231 Difference]: Finished difference. Result has 102 places, 91 transitions, 894 flow [2024-06-04 16:59:01,418 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=894, PETRI_PLACES=102, PETRI_TRANSITIONS=91} [2024-06-04 16:59:01,419 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 72 predicate places. [2024-06-04 16:59:01,419 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 91 transitions, 894 flow [2024-06-04 16:59:01,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:59:01,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:59:01,419 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:59:01,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-04 16:59:01,420 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-04 16:59:01,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:59:01,420 INFO L85 PathProgramCache]: Analyzing trace with hash -918097762, now seen corresponding path program 3 times [2024-06-04 16:59:01,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:59:01,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119006821] [2024-06-04 16:59:01,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:59:01,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:59:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:59:05,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-04 16:59:05,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:59:05,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119006821] [2024-06-04 16:59:05,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119006821] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:59:05,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:59:05,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:59:05,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854616217] [2024-06-04 16:59:05,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:59:05,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:59:05,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:59:05,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:59:05,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:59:06,022 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 16:59:06,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 91 transitions, 894 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:59:06,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:59:06,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 16:59:06,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:59:06,319 INFO L124 PetriNetUnfolderBase]: 305/544 cut-off events. [2024-06-04 16:59:06,320 INFO L125 PetriNetUnfolderBase]: For 6196/6196 co-relation queries the response was YES. [2024-06-04 16:59:06,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2916 conditions, 544 events. 305/544 cut-off events. For 6196/6196 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2202 event pairs, 72 based on Foata normal form. 3/547 useless extension candidates. Maximal degree in co-relation 2863. Up to 357 conditions per place. [2024-06-04 16:59:06,324 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 68 selfloop transitions, 42 changer transitions 0/112 dead transitions. [2024-06-04 16:59:06,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 112 transitions, 1227 flow [2024-06-04 16:59:06,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:59:06,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:59:06,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 106 transitions. [2024-06-04 16:59:06,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4274193548387097 [2024-06-04 16:59:06,325 INFO L175 Difference]: Start difference. First operand has 102 places, 91 transitions, 894 flow. Second operand 8 states and 106 transitions. [2024-06-04 16:59:06,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 112 transitions, 1227 flow [2024-06-04 16:59:06,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 112 transitions, 1173 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-04 16:59:06,335 INFO L231 Difference]: Finished difference. Result has 105 places, 93 transitions, 952 flow [2024-06-04 16:59:06,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=952, PETRI_PLACES=105, PETRI_TRANSITIONS=93} [2024-06-04 16:59:06,336 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 75 predicate places. [2024-06-04 16:59:06,336 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 93 transitions, 952 flow [2024-06-04 16:59:06,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:59:06,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:59:06,336 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:59:06,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-04 16:59:06,336 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-04 16:59:06,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:59:06,337 INFO L85 PathProgramCache]: Analyzing trace with hash -918092182, now seen corresponding path program 4 times [2024-06-04 16:59:06,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:59:06,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943433000] [2024-06-04 16:59:06,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:59:06,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:59:06,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:59:10,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:59:10,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:59:10,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943433000] [2024-06-04 16:59:10,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943433000] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:59:10,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:59:10,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:59:10,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811110084] [2024-06-04 16:59:10,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:59:10,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:59:10,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:59:10,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:59:10,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:59:11,125 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 16:59:11,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 93 transitions, 952 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-04 16:59:11,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:59:11,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 16:59:11,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:59:11,489 INFO L124 PetriNetUnfolderBase]: 314/557 cut-off events. [2024-06-04 16:59:11,489 INFO L125 PetriNetUnfolderBase]: For 6934/6934 co-relation queries the response was YES. [2024-06-04 16:59:11,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3105 conditions, 557 events. 314/557 cut-off events. For 6934/6934 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2257 event pairs, 57 based on Foata normal form. 3/560 useless extension candidates. Maximal degree in co-relation 3051. Up to 365 conditions per place. [2024-06-04 16:59:11,493 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 69 selfloop transitions, 41 changer transitions 0/112 dead transitions. [2024-06-04 16:59:11,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 112 transitions, 1276 flow [2024-06-04 16:59:11,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:59:11,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:59:11,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2024-06-04 16:59:11,494 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4014336917562724 [2024-06-04 16:59:11,494 INFO L175 Difference]: Start difference. First operand has 105 places, 93 transitions, 952 flow. Second operand 9 states and 112 transitions. [2024-06-04 16:59:11,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 112 transitions, 1276 flow [2024-06-04 16:59:11,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 112 transitions, 1174 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-04 16:59:11,505 INFO L231 Difference]: Finished difference. Result has 107 places, 95 transitions, 966 flow [2024-06-04 16:59:11,505 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=856, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=966, PETRI_PLACES=107, PETRI_TRANSITIONS=95} [2024-06-04 16:59:11,505 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 77 predicate places. [2024-06-04 16:59:11,506 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 95 transitions, 966 flow [2024-06-04 16:59:11,506 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-04 16:59:11,506 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:59:11,506 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:59:11,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-04 16:59:11,506 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-04 16:59:11,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:59:11,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1953762734, now seen corresponding path program 5 times [2024-06-04 16:59:11,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:59:11,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967596952] [2024-06-04 16:59:11,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:59:11,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:59:11,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:59:15,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:59:15,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:59:15,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967596952] [2024-06-04 16:59:15,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967596952] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:59:15,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:59:15,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:59:15,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527215179] [2024-06-04 16:59:15,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:59:15,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:59:15,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:59:15,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:59:15,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:59:16,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 16:59:16,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 95 transitions, 966 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-04 16:59:16,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:59:16,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 16:59:16,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:59:16,397 INFO L124 PetriNetUnfolderBase]: 323/572 cut-off events. [2024-06-04 16:59:16,397 INFO L125 PetriNetUnfolderBase]: For 6906/6906 co-relation queries the response was YES. [2024-06-04 16:59:16,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3172 conditions, 572 events. 323/572 cut-off events. For 6906/6906 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2330 event pairs, 107 based on Foata normal form. 3/575 useless extension candidates. Maximal degree in co-relation 3118. Up to 532 conditions per place. [2024-06-04 16:59:16,402 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 93 selfloop transitions, 13 changer transitions 0/108 dead transitions. [2024-06-04 16:59:16,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 108 transitions, 1230 flow [2024-06-04 16:59:16,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:59:16,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:59:16,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions. [2024-06-04 16:59:16,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36693548387096775 [2024-06-04 16:59:16,405 INFO L175 Difference]: Start difference. First operand has 107 places, 95 transitions, 966 flow. Second operand 8 states and 91 transitions. [2024-06-04 16:59:16,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 108 transitions, 1230 flow [2024-06-04 16:59:16,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 108 transitions, 1162 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-04 16:59:16,416 INFO L231 Difference]: Finished difference. Result has 108 places, 97 transitions, 957 flow [2024-06-04 16:59:16,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=900, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=957, PETRI_PLACES=108, PETRI_TRANSITIONS=97} [2024-06-04 16:59:16,416 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 78 predicate places. [2024-06-04 16:59:16,416 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 97 transitions, 957 flow [2024-06-04 16:59:16,417 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-04 16:59:16,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:59:16,417 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:59:16,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-04 16:59:16,417 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-04 16:59:16,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:59:16,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1480278967, now seen corresponding path program 1 times [2024-06-04 16:59:16,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:59:16,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819862203] [2024-06-04 16:59:16,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:59:16,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:59:16,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:59:20,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:59:20,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:59:20,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819862203] [2024-06-04 16:59:20,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819862203] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:59:20,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:59:20,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:59:20,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441555048] [2024-06-04 16:59:20,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:59:20,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:59:20,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:59:20,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:59:20,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:59:20,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 16:59:20,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 97 transitions, 957 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-04 16:59:20,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:59:20,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 16:59:20,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:59:21,295 INFO L124 PetriNetUnfolderBase]: 319/566 cut-off events. [2024-06-04 16:59:21,295 INFO L125 PetriNetUnfolderBase]: For 6434/6434 co-relation queries the response was YES. [2024-06-04 16:59:21,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3026 conditions, 566 events. 319/566 cut-off events. For 6434/6434 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2311 event pairs, 103 based on Foata normal form. 2/568 useless extension candidates. Maximal degree in co-relation 2972. Up to 534 conditions per place. [2024-06-04 16:59:21,299 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 93 selfloop transitions, 13 changer transitions 0/108 dead transitions. [2024-06-04 16:59:21,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 108 transitions, 1207 flow [2024-06-04 16:59:21,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:59:21,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:59:21,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2024-06-04 16:59:21,309 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3588709677419355 [2024-06-04 16:59:21,309 INFO L175 Difference]: Start difference. First operand has 108 places, 97 transitions, 957 flow. Second operand 8 states and 89 transitions. [2024-06-04 16:59:21,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 108 transitions, 1207 flow [2024-06-04 16:59:21,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 108 transitions, 1172 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-04 16:59:21,319 INFO L231 Difference]: Finished difference. Result has 110 places, 99 transitions, 975 flow [2024-06-04 16:59:21,319 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=922, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=975, PETRI_PLACES=110, PETRI_TRANSITIONS=99} [2024-06-04 16:59:21,319 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 80 predicate places. [2024-06-04 16:59:21,319 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 99 transitions, 975 flow [2024-06-04 16:59:21,320 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-04 16:59:21,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:59:21,320 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:59:21,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-04 16:59:21,320 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-04 16:59:21,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:59:21,320 INFO L85 PathProgramCache]: Analyzing trace with hash 278017642, now seen corresponding path program 6 times [2024-06-04 16:59:21,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:59:21,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666909975] [2024-06-04 16:59:21,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:59:21,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:59:21,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:59:25,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:59:25,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:59:25,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666909975] [2024-06-04 16:59:25,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666909975] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:59:25,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:59:25,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:59:25,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761603651] [2024-06-04 16:59:25,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:59:25,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:59:25,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:59:25,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:59:25,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:59:25,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 16:59:25,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 99 transitions, 975 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-04 16:59:25,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:59:25,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 16:59:25,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:59:26,279 INFO L124 PetriNetUnfolderBase]: 313/557 cut-off events. [2024-06-04 16:59:26,279 INFO L125 PetriNetUnfolderBase]: For 6441/6441 co-relation queries the response was YES. [2024-06-04 16:59:26,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2967 conditions, 557 events. 313/557 cut-off events. For 6441/6441 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2273 event pairs, 98 based on Foata normal form. 3/560 useless extension candidates. Maximal degree in co-relation 2912. Up to 505 conditions per place. [2024-06-04 16:59:26,283 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 94 selfloop transitions, 17 changer transitions 0/113 dead transitions. [2024-06-04 16:59:26,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 113 transitions, 1233 flow [2024-06-04 16:59:26,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:59:26,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:59:26,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions. [2024-06-04 16:59:26,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36917562724014336 [2024-06-04 16:59:26,285 INFO L175 Difference]: Start difference. First operand has 110 places, 99 transitions, 975 flow. Second operand 9 states and 103 transitions. [2024-06-04 16:59:26,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 113 transitions, 1233 flow [2024-06-04 16:59:26,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 113 transitions, 1187 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-04 16:59:26,295 INFO L231 Difference]: Finished difference. Result has 113 places, 99 transitions, 968 flow [2024-06-04 16:59:26,295 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=929, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=968, PETRI_PLACES=113, PETRI_TRANSITIONS=99} [2024-06-04 16:59:26,296 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 83 predicate places. [2024-06-04 16:59:26,296 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 99 transitions, 968 flow [2024-06-04 16:59:26,296 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-04 16:59:26,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:59:26,296 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:59:26,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-04 16:59:26,297 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-04 16:59:26,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:59:26,297 INFO L85 PathProgramCache]: Analyzing trace with hash 285646339, now seen corresponding path program 1 times [2024-06-04 16:59:26,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:59:26,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51713061] [2024-06-04 16:59:26,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:59:26,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:59:26,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:59:32,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:59:32,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:59:32,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51713061] [2024-06-04 16:59:32,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51713061] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:59:32,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:59:32,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:59:32,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255794164] [2024-06-04 16:59:32,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:59:32,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:59:32,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:59:32,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:59:32,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:59:32,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 16:59:32,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 99 transitions, 968 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:59:32,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:59:32,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 16:59:32,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:59:32,725 INFO L124 PetriNetUnfolderBase]: 310/552 cut-off events. [2024-06-04 16:59:32,725 INFO L125 PetriNetUnfolderBase]: For 6554/6554 co-relation queries the response was YES. [2024-06-04 16:59:32,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2931 conditions, 552 events. 310/552 cut-off events. For 6554/6554 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2231 event pairs, 100 based on Foata normal form. 2/554 useless extension candidates. Maximal degree in co-relation 2875. Up to 522 conditions per place. [2024-06-04 16:59:32,729 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 94 selfloop transitions, 12 changer transitions 0/108 dead transitions. [2024-06-04 16:59:32,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 108 transitions, 1200 flow [2024-06-04 16:59:32,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:59:32,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:59:32,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2024-06-04 16:59:32,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35080645161290325 [2024-06-04 16:59:32,731 INFO L175 Difference]: Start difference. First operand has 113 places, 99 transitions, 968 flow. Second operand 8 states and 87 transitions. [2024-06-04 16:59:32,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 108 transitions, 1200 flow [2024-06-04 16:59:32,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 108 transitions, 1108 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-06-04 16:59:32,742 INFO L231 Difference]: Finished difference. Result has 112 places, 99 transitions, 904 flow [2024-06-04 16:59:32,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=876, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=904, PETRI_PLACES=112, PETRI_TRANSITIONS=99} [2024-06-04 16:59:32,743 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 82 predicate places. [2024-06-04 16:59:32,743 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 99 transitions, 904 flow [2024-06-04 16:59:32,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:59:32,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:59:32,743 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:59:32,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-04 16:59:32,744 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-04 16:59:32,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:59:32,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1315474289, now seen corresponding path program 1 times [2024-06-04 16:59:32,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:59:32,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300384400] [2024-06-04 16:59:32,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:59:32,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:59:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:59:39,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:59:39,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:59:39,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300384400] [2024-06-04 16:59:39,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300384400] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:59:39,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:59:39,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:59:39,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693509527] [2024-06-04 16:59:39,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:59:39,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:59:39,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:59:39,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:59:39,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:59:39,231 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 16:59:39,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 99 transitions, 904 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:59:39,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:59:39,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 16:59:39,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:59:39,498 INFO L124 PetriNetUnfolderBase]: 330/594 cut-off events. [2024-06-04 16:59:39,498 INFO L125 PetriNetUnfolderBase]: For 7329/7329 co-relation queries the response was YES. [2024-06-04 16:59:39,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3070 conditions, 594 events. 330/594 cut-off events. For 7329/7329 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2529 event pairs, 64 based on Foata normal form. 2/596 useless extension candidates. Maximal degree in co-relation 3013. Up to 473 conditions per place. [2024-06-04 16:59:39,502 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 89 selfloop transitions, 28 changer transitions 0/119 dead transitions. [2024-06-04 16:59:39,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 119 transitions, 1258 flow [2024-06-04 16:59:39,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:59:39,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:59:39,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2024-06-04 16:59:39,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3942652329749104 [2024-06-04 16:59:39,509 INFO L175 Difference]: Start difference. First operand has 112 places, 99 transitions, 904 flow. Second operand 9 states and 110 transitions. [2024-06-04 16:59:39,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 119 transitions, 1258 flow [2024-06-04 16:59:39,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 119 transitions, 1225 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-04 16:59:39,521 INFO L231 Difference]: Finished difference. Result has 115 places, 103 transitions, 979 flow [2024-06-04 16:59:39,521 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=871, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=979, PETRI_PLACES=115, PETRI_TRANSITIONS=103} [2024-06-04 16:59:39,522 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 85 predicate places. [2024-06-04 16:59:39,522 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 103 transitions, 979 flow [2024-06-04 16:59:39,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:59:39,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:59:39,522 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:59:39,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-04 16:59:39,522 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-04 16:59:39,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:59:39,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1038420779, now seen corresponding path program 2 times [2024-06-04 16:59:39,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:59:39,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303269303] [2024-06-04 16:59:39,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:59:39,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:59:39,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:59:45,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:59:45,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:59:45,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303269303] [2024-06-04 16:59:45,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303269303] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:59:45,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:59:45,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:59:45,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787766932] [2024-06-04 16:59:45,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:59:45,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:59:45,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:59:45,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:59:45,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:59:45,782 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 16:59:45,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 103 transitions, 979 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:59:45,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:59:45,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 16:59:45,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:59:46,078 INFO L124 PetriNetUnfolderBase]: 334/602 cut-off events. [2024-06-04 16:59:46,078 INFO L125 PetriNetUnfolderBase]: For 8078/8078 co-relation queries the response was YES. [2024-06-04 16:59:46,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3209 conditions, 602 events. 334/602 cut-off events. For 8078/8078 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2579 event pairs, 68 based on Foata normal form. 2/604 useless extension candidates. Maximal degree in co-relation 3151. Up to 510 conditions per place. [2024-06-04 16:59:46,082 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 89 selfloop transitions, 26 changer transitions 0/117 dead transitions. [2024-06-04 16:59:46,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 117 transitions, 1260 flow [2024-06-04 16:59:46,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:59:46,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:59:46,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-04 16:59:46,083 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835125448028674 [2024-06-04 16:59:46,083 INFO L175 Difference]: Start difference. First operand has 115 places, 103 transitions, 979 flow. Second operand 9 states and 107 transitions. [2024-06-04 16:59:46,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 117 transitions, 1260 flow [2024-06-04 16:59:46,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 117 transitions, 1204 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-04 16:59:46,097 INFO L231 Difference]: Finished difference. Result has 119 places, 104 transitions, 998 flow [2024-06-04 16:59:46,097 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=929, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=998, PETRI_PLACES=119, PETRI_TRANSITIONS=104} [2024-06-04 16:59:46,097 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 89 predicate places. [2024-06-04 16:59:46,097 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 104 transitions, 998 flow [2024-06-04 16:59:46,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:59:46,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:59:46,098 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:59:46,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-04 16:59:46,098 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-04 16:59:46,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:59:46,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1038420903, now seen corresponding path program 1 times [2024-06-04 16:59:46,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:59:46,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681668234] [2024-06-04 16:59:46,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:59:46,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:59:46,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:59:52,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:59:52,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:59:52,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681668234] [2024-06-04 16:59:52,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681668234] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:59:52,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:59:52,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:59:52,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207244196] [2024-06-04 16:59:52,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:59:52,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:59:52,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:59:52,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:59:52,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:59:52,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 16:59:52,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 104 transitions, 998 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:59:52,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:59:52,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 16:59:52,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:59:52,699 INFO L124 PetriNetUnfolderBase]: 342/615 cut-off events. [2024-06-04 16:59:52,699 INFO L125 PetriNetUnfolderBase]: For 8684/8684 co-relation queries the response was YES. [2024-06-04 16:59:52,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3312 conditions, 615 events. 342/615 cut-off events. For 8684/8684 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2649 event pairs, 64 based on Foata normal form. 1/616 useless extension candidates. Maximal degree in co-relation 3252. Up to 502 conditions per place. [2024-06-04 16:59:52,703 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 94 selfloop transitions, 31 changer transitions 0/127 dead transitions. [2024-06-04 16:59:52,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 127 transitions, 1393 flow [2024-06-04 16:59:52,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:59:52,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:59:52,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2024-06-04 16:59:52,704 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38387096774193546 [2024-06-04 16:59:52,704 INFO L175 Difference]: Start difference. First operand has 119 places, 104 transitions, 998 flow. Second operand 10 states and 119 transitions. [2024-06-04 16:59:52,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 127 transitions, 1393 flow [2024-06-04 16:59:52,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 127 transitions, 1337 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-04 16:59:52,718 INFO L231 Difference]: Finished difference. Result has 123 places, 112 transitions, 1079 flow [2024-06-04 16:59:52,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=942, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1079, PETRI_PLACES=123, PETRI_TRANSITIONS=112} [2024-06-04 16:59:52,718 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 93 predicate places. [2024-06-04 16:59:52,719 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 112 transitions, 1079 flow [2024-06-04 16:59:52,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:59:52,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:59:52,719 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:59:52,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-04 16:59:52,719 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-04 16:59:52,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:59:52,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1413907473, now seen corresponding path program 2 times [2024-06-04 16:59:52,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:59:52,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013180088] [2024-06-04 16:59:52,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:59:52,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:59:52,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:59:58,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-04 16:59:58,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:59:58,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013180088] [2024-06-04 16:59:58,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013180088] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:59:58,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:59:58,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:59:58,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838618622] [2024-06-04 16:59:58,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:59:58,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:59:58,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:59:58,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:59:58,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:59:59,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 16:59:59,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 112 transitions, 1079 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:59:59,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:59:59,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 16:59:59,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:59:59,409 INFO L124 PetriNetUnfolderBase]: 345/620 cut-off events. [2024-06-04 16:59:59,409 INFO L125 PetriNetUnfolderBase]: For 9323/9323 co-relation queries the response was YES. [2024-06-04 16:59:59,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3440 conditions, 620 events. 345/620 cut-off events. For 9323/9323 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2679 event pairs, 64 based on Foata normal form. 1/621 useless extension candidates. Maximal degree in co-relation 3378. Up to 536 conditions per place. [2024-06-04 16:59:59,412 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 96 selfloop transitions, 30 changer transitions 0/128 dead transitions. [2024-06-04 16:59:59,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 128 transitions, 1395 flow [2024-06-04 16:59:59,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:59:59,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:59:59,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2024-06-04 16:59:59,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3741935483870968 [2024-06-04 16:59:59,414 INFO L175 Difference]: Start difference. First operand has 123 places, 112 transitions, 1079 flow. Second operand 10 states and 116 transitions. [2024-06-04 16:59:59,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 128 transitions, 1395 flow [2024-06-04 16:59:59,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 128 transitions, 1347 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-06-04 16:59:59,430 INFO L231 Difference]: Finished difference. Result has 129 places, 116 transitions, 1140 flow [2024-06-04 16:59:59,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1037, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1140, PETRI_PLACES=129, PETRI_TRANSITIONS=116} [2024-06-04 16:59:59,431 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 99 predicate places. [2024-06-04 16:59:59,431 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 116 transitions, 1140 flow [2024-06-04 16:59:59,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:59:59,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:59:59,432 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:59:59,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-04 16:59:59,432 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-04 16:59:59,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:59:59,432 INFO L85 PathProgramCache]: Analyzing trace with hash 361154805, now seen corresponding path program 3 times [2024-06-04 16:59:59,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:59:59,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163156732] [2024-06-04 16:59:59,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:59:59,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:59:59,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:00:04,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:00:04,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:00:04,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163156732] [2024-06-04 17:00:04,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163156732] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:00:04,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:00:04,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:00:04,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292365624] [2024-06-04 17:00:04,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:00:04,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:00:04,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:00:04,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:00:04,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:00:05,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:00:05,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 116 transitions, 1140 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:00:05,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:00:05,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:00:05,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:00:05,503 INFO L124 PetriNetUnfolderBase]: 358/641 cut-off events. [2024-06-04 17:00:05,503 INFO L125 PetriNetUnfolderBase]: For 10724/10724 co-relation queries the response was YES. [2024-06-04 17:00:05,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3669 conditions, 641 events. 358/641 cut-off events. For 10724/10724 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2813 event pairs, 57 based on Foata normal form. 1/642 useless extension candidates. Maximal degree in co-relation 3604. Up to 485 conditions per place. [2024-06-04 17:00:05,507 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 99 selfloop transitions, 43 changer transitions 0/144 dead transitions. [2024-06-04 17:00:05,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 144 transitions, 1605 flow [2024-06-04 17:00:05,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:00:05,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:00:05,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-04 17:00:05,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4229390681003584 [2024-06-04 17:00:05,508 INFO L175 Difference]: Start difference. First operand has 129 places, 116 transitions, 1140 flow. Second operand 9 states and 118 transitions. [2024-06-04 17:00:05,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 144 transitions, 1605 flow [2024-06-04 17:00:05,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 144 transitions, 1544 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-04 17:00:05,526 INFO L231 Difference]: Finished difference. Result has 133 places, 126 transitions, 1288 flow [2024-06-04 17:00:05,526 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1079, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1288, PETRI_PLACES=133, PETRI_TRANSITIONS=126} [2024-06-04 17:00:05,526 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 103 predicate places. [2024-06-04 17:00:05,527 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 126 transitions, 1288 flow [2024-06-04 17:00:05,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:00:05,527 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:00:05,527 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:00:05,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-04 17:00:05,527 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-04 17:00:05,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:00:05,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1041217289, now seen corresponding path program 3 times [2024-06-04 17:00:05,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:00:05,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834119176] [2024-06-04 17:00:05,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:00:05,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:00:05,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:00:11,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:00:11,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:00:11,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834119176] [2024-06-04 17:00:11,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834119176] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:00:11,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:00:11,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:00:11,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789709702] [2024-06-04 17:00:11,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:00:11,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:00:11,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:00:11,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:00:11,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:00:11,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:00:11,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 126 transitions, 1288 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:00:11,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:00:11,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:00:11,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:00:12,330 INFO L124 PetriNetUnfolderBase]: 355/636 cut-off events. [2024-06-04 17:00:12,331 INFO L125 PetriNetUnfolderBase]: For 11410/11410 co-relation queries the response was YES. [2024-06-04 17:00:12,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3791 conditions, 636 events. 355/636 cut-off events. For 11410/11410 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2769 event pairs, 66 based on Foata normal form. 2/638 useless extension candidates. Maximal degree in co-relation 3723. Up to 558 conditions per place. [2024-06-04 17:00:12,335 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 111 selfloop transitions, 25 changer transitions 0/138 dead transitions. [2024-06-04 17:00:12,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 138 transitions, 1590 flow [2024-06-04 17:00:12,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:00:12,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:00:12,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-04 17:00:12,336 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37992831541218636 [2024-06-04 17:00:12,336 INFO L175 Difference]: Start difference. First operand has 133 places, 126 transitions, 1288 flow. Second operand 9 states and 106 transitions. [2024-06-04 17:00:12,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 138 transitions, 1590 flow [2024-06-04 17:00:12,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 138 transitions, 1510 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-04 17:00:12,359 INFO L231 Difference]: Finished difference. Result has 137 places, 126 transitions, 1262 flow [2024-06-04 17:00:12,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1208, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1262, PETRI_PLACES=137, PETRI_TRANSITIONS=126} [2024-06-04 17:00:12,359 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 107 predicate places. [2024-06-04 17:00:12,359 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 126 transitions, 1262 flow [2024-06-04 17:00:12,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:00:12,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:00:12,360 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:00:12,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-04 17:00:12,360 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-04 17:00:12,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:00:12,360 INFO L85 PathProgramCache]: Analyzing trace with hash 88020173, now seen corresponding path program 4 times [2024-06-04 17:00:12,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:00:12,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150533639] [2024-06-04 17:00:12,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:00:12,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:00:12,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:00:18,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:00:18,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:00:18,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150533639] [2024-06-04 17:00:18,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150533639] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:00:18,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:00:18,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:00:18,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553211071] [2024-06-04 17:00:18,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:00:18,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:00:18,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:00:18,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:00:18,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:00:18,386 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:00:18,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 126 transitions, 1262 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:00:18,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:00:18,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:00:18,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:00:18,731 INFO L124 PetriNetUnfolderBase]: 364/655 cut-off events. [2024-06-04 17:00:18,731 INFO L125 PetriNetUnfolderBase]: For 12208/12208 co-relation queries the response was YES. [2024-06-04 17:00:18,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3817 conditions, 655 events. 364/655 cut-off events. For 12208/12208 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2902 event pairs, 47 based on Foata normal form. 2/657 useless extension candidates. Maximal degree in co-relation 3748. Up to 451 conditions per place. [2024-06-04 17:00:18,736 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 101 selfloop transitions, 42 changer transitions 0/145 dead transitions. [2024-06-04 17:00:18,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 145 transitions, 1666 flow [2024-06-04 17:00:18,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:00:18,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:00:18,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-04 17:00:18,738 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835125448028674 [2024-06-04 17:00:18,738 INFO L175 Difference]: Start difference. First operand has 137 places, 126 transitions, 1262 flow. Second operand 9 states and 107 transitions. [2024-06-04 17:00:18,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 145 transitions, 1666 flow [2024-06-04 17:00:18,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 145 transitions, 1614 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-04 17:00:18,764 INFO L231 Difference]: Finished difference. Result has 140 places, 128 transitions, 1324 flow [2024-06-04 17:00:18,764 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1210, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1324, PETRI_PLACES=140, PETRI_TRANSITIONS=128} [2024-06-04 17:00:18,765 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 110 predicate places. [2024-06-04 17:00:18,765 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 128 transitions, 1324 flow [2024-06-04 17:00:18,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:00:18,765 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:00:18,765 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:00:18,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-04 17:00:18,765 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-04 17:00:18,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:00:18,766 INFO L85 PathProgramCache]: Analyzing trace with hash 2076174569, now seen corresponding path program 5 times [2024-06-04 17:00:18,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:00:18,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375851426] [2024-06-04 17:00:18,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:00:18,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:00:18,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:00:25,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:00:25,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:00:25,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375851426] [2024-06-04 17:00:25,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375851426] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:00:25,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:00:25,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:00:25,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465171850] [2024-06-04 17:00:25,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:00:25,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:00:25,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:00:25,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:00:25,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:00:25,270 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:00:25,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 128 transitions, 1324 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:00:25,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:00:25,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:00:25,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:00:25,556 INFO L124 PetriNetUnfolderBase]: 380/687 cut-off events. [2024-06-04 17:00:25,556 INFO L125 PetriNetUnfolderBase]: For 14123/14123 co-relation queries the response was YES. [2024-06-04 17:00:25,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4124 conditions, 687 events. 380/687 cut-off events. For 14123/14123 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3123 event pairs, 70 based on Foata normal form. 2/689 useless extension candidates. Maximal degree in co-relation 4053. Up to 551 conditions per place. [2024-06-04 17:00:25,560 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 109 selfloop transitions, 37 changer transitions 0/148 dead transitions. [2024-06-04 17:00:25,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 148 transitions, 1760 flow [2024-06-04 17:00:25,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:00:25,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:00:25,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-04 17:00:25,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3978494623655914 [2024-06-04 17:00:25,561 INFO L175 Difference]: Start difference. First operand has 140 places, 128 transitions, 1324 flow. Second operand 9 states and 111 transitions. [2024-06-04 17:00:25,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 148 transitions, 1760 flow [2024-06-04 17:00:25,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 148 transitions, 1658 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-04 17:00:25,588 INFO L231 Difference]: Finished difference. Result has 144 places, 131 transitions, 1352 flow [2024-06-04 17:00:25,589 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1236, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1352, PETRI_PLACES=144, PETRI_TRANSITIONS=131} [2024-06-04 17:00:25,589 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 114 predicate places. [2024-06-04 17:00:25,589 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 131 transitions, 1352 flow [2024-06-04 17:00:25,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:00:25,589 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:00:25,589 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:00:25,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-04 17:00:25,589 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-04 17:00:25,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:00:25,590 INFO L85 PathProgramCache]: Analyzing trace with hash 2088271203, now seen corresponding path program 4 times [2024-06-04 17:00:25,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:00:25,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755846158] [2024-06-04 17:00:25,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:00:25,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:00:25,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:00:32,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:00:32,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:00:32,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755846158] [2024-06-04 17:00:32,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755846158] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:00:32,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:00:32,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:00:32,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16218793] [2024-06-04 17:00:32,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:00:32,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:00:32,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:00:32,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:00:32,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:00:32,183 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:00:32,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 131 transitions, 1352 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:00:32,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:00:32,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:00:32,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:00:32,483 INFO L124 PetriNetUnfolderBase]: 383/692 cut-off events. [2024-06-04 17:00:32,483 INFO L125 PetriNetUnfolderBase]: For 14305/14305 co-relation queries the response was YES. [2024-06-04 17:00:32,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4106 conditions, 692 events. 383/692 cut-off events. For 14305/14305 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3151 event pairs, 75 based on Foata normal form. 1/693 useless extension candidates. Maximal degree in co-relation 4035. Up to 580 conditions per place. [2024-06-04 17:00:32,488 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 107 selfloop transitions, 37 changer transitions 0/146 dead transitions. [2024-06-04 17:00:32,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 146 transitions, 1696 flow [2024-06-04 17:00:32,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:00:32,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:00:32,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-04 17:00:32,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835125448028674 [2024-06-04 17:00:32,497 INFO L175 Difference]: Start difference. First operand has 144 places, 131 transitions, 1352 flow. Second operand 9 states and 107 transitions. [2024-06-04 17:00:32,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 146 transitions, 1696 flow [2024-06-04 17:00:32,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 146 transitions, 1608 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-04 17:00:32,526 INFO L231 Difference]: Finished difference. Result has 147 places, 133 transitions, 1369 flow [2024-06-04 17:00:32,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1264, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1369, PETRI_PLACES=147, PETRI_TRANSITIONS=133} [2024-06-04 17:00:32,527 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 117 predicate places. [2024-06-04 17:00:32,527 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 133 transitions, 1369 flow [2024-06-04 17:00:32,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:00:32,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:00:32,528 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:00:32,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-04 17:00:32,528 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-04 17:00:32,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:00:32,528 INFO L85 PathProgramCache]: Analyzing trace with hash 2088267359, now seen corresponding path program 6 times [2024-06-04 17:00:32,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:00:32,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126778969] [2024-06-04 17:00:32,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:00:32,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:00:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:00:38,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-04 17:00:38,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:00:38,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126778969] [2024-06-04 17:00:38,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126778969] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:00:38,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:00:38,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:00:38,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077793285] [2024-06-04 17:00:38,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:00:38,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:00:38,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:00:38,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:00:38,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:00:39,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:00:39,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 133 transitions, 1369 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:00:39,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:00:39,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:00:39,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:00:39,440 INFO L124 PetriNetUnfolderBase]: 380/687 cut-off events. [2024-06-04 17:00:39,440 INFO L125 PetriNetUnfolderBase]: For 14629/14629 co-relation queries the response was YES. [2024-06-04 17:00:39,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4043 conditions, 687 events. 380/687 cut-off events. For 14629/14629 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3135 event pairs, 73 based on Foata normal form. 2/689 useless extension candidates. Maximal degree in co-relation 3972. Up to 572 conditions per place. [2024-06-04 17:00:39,444 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 109 selfloop transitions, 36 changer transitions 0/147 dead transitions. [2024-06-04 17:00:39,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 147 transitions, 1695 flow [2024-06-04 17:00:39,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:00:39,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:00:39,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-04 17:00:39,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835125448028674 [2024-06-04 17:00:39,446 INFO L175 Difference]: Start difference. First operand has 147 places, 133 transitions, 1369 flow. Second operand 9 states and 107 transitions. [2024-06-04 17:00:39,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 147 transitions, 1695 flow [2024-06-04 17:00:39,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 147 transitions, 1575 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-04 17:00:39,474 INFO L231 Difference]: Finished difference. Result has 148 places, 133 transitions, 1325 flow [2024-06-04 17:00:39,475 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1249, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1325, PETRI_PLACES=148, PETRI_TRANSITIONS=133} [2024-06-04 17:00:39,475 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 118 predicate places. [2024-06-04 17:00:39,475 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 133 transitions, 1325 flow [2024-06-04 17:00:39,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:00:39,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:00:39,475 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:00:39,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-04 17:00:39,475 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-04 17:00:39,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:00:39,476 INFO L85 PathProgramCache]: Analyzing trace with hash -863968079, now seen corresponding path program 5 times [2024-06-04 17:00:39,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:00:39,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338277882] [2024-06-04 17:00:39,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:00:39,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:00:39,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:00:45,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:00:45,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:00:45,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338277882] [2024-06-04 17:00:45,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338277882] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:00:45,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:00:45,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:00:45,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283860530] [2024-06-04 17:00:45,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:00:45,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:00:45,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:00:45,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:00:45,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:00:46,135 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:00:46,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 133 transitions, 1325 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:00:46,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:00:46,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:00:46,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:00:46,495 INFO L124 PetriNetUnfolderBase]: 387/699 cut-off events. [2024-06-04 17:00:46,495 INFO L125 PetriNetUnfolderBase]: For 14717/14717 co-relation queries the response was YES. [2024-06-04 17:00:46,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4074 conditions, 699 events. 387/699 cut-off events. For 14717/14717 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3181 event pairs, 77 based on Foata normal form. 1/700 useless extension candidates. Maximal degree in co-relation 4003. Up to 601 conditions per place. [2024-06-04 17:00:46,500 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 117 selfloop transitions, 34 changer transitions 0/153 dead transitions. [2024-06-04 17:00:46,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 153 transitions, 1780 flow [2024-06-04 17:00:46,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:00:46,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:00:46,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2024-06-04 17:00:46,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3812316715542522 [2024-06-04 17:00:46,509 INFO L175 Difference]: Start difference. First operand has 148 places, 133 transitions, 1325 flow. Second operand 11 states and 130 transitions. [2024-06-04 17:00:46,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 153 transitions, 1780 flow [2024-06-04 17:00:46,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 153 transitions, 1706 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-04 17:00:46,540 INFO L231 Difference]: Finished difference. Result has 153 places, 137 transitions, 1385 flow [2024-06-04 17:00:46,540 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1253, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1385, PETRI_PLACES=153, PETRI_TRANSITIONS=137} [2024-06-04 17:00:46,541 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 123 predicate places. [2024-06-04 17:00:46,541 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 137 transitions, 1385 flow [2024-06-04 17:00:46,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:00:46,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:00:46,541 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:00:46,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-04 17:00:46,542 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-04 17:00:46,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:00:46,542 INFO L85 PathProgramCache]: Analyzing trace with hash -863790449, now seen corresponding path program 6 times [2024-06-04 17:00:46,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:00:46,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323453602] [2024-06-04 17:00:46,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:00:46,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:00:46,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:00:52,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:00:52,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:00:52,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323453602] [2024-06-04 17:00:52,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323453602] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:00:52,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:00:52,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:00:52,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23055336] [2024-06-04 17:00:52,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:00:52,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:00:52,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:00:52,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:00:52,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:00:53,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:00:53,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 137 transitions, 1385 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-04 17:00:53,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:00:53,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:00:53,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:00:53,497 INFO L124 PetriNetUnfolderBase]: 390/705 cut-off events. [2024-06-04 17:00:53,497 INFO L125 PetriNetUnfolderBase]: For 15657/15657 co-relation queries the response was YES. [2024-06-04 17:00:53,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4156 conditions, 705 events. 390/705 cut-off events. For 15657/15657 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3220 event pairs, 78 based on Foata normal form. 1/706 useless extension candidates. Maximal degree in co-relation 4083. Up to 620 conditions per place. [2024-06-04 17:00:53,502 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 120 selfloop transitions, 31 changer transitions 0/153 dead transitions. [2024-06-04 17:00:53,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 153 transitions, 1754 flow [2024-06-04 17:00:53,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:00:53,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:00:53,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 125 transitions. [2024-06-04 17:00:53,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36656891495601174 [2024-06-04 17:00:53,503 INFO L175 Difference]: Start difference. First operand has 153 places, 137 transitions, 1385 flow. Second operand 11 states and 125 transitions. [2024-06-04 17:00:53,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 153 transitions, 1754 flow [2024-06-04 17:00:53,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 153 transitions, 1658 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-04 17:00:53,536 INFO L231 Difference]: Finished difference. Result has 155 places, 140 transitions, 1395 flow [2024-06-04 17:00:53,537 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1295, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1395, PETRI_PLACES=155, PETRI_TRANSITIONS=140} [2024-06-04 17:00:53,537 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 125 predicate places. [2024-06-04 17:00:53,537 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 140 transitions, 1395 flow [2024-06-04 17:00:53,537 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-04 17:00:53,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:00:53,538 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:00:53,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-04 17:00:53,538 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-04 17:00:53,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:00:53,538 INFO L85 PathProgramCache]: Analyzing trace with hash 184315939, now seen corresponding path program 7 times [2024-06-04 17:00:53,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:00:53,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324217621] [2024-06-04 17:00:53,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:00:53,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:00:53,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:00:59,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:00:59,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:00:59,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324217621] [2024-06-04 17:00:59,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324217621] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:00:59,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:00:59,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:00:59,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746501509] [2024-06-04 17:00:59,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:00:59,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:00:59,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:00:59,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:00:59,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:00:59,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:00:59,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 140 transitions, 1395 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:00:59,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:00:59,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:00:59,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:01:00,115 INFO L124 PetriNetUnfolderBase]: 388/701 cut-off events. [2024-06-04 17:01:00,115 INFO L125 PetriNetUnfolderBase]: For 15934/15934 co-relation queries the response was YES. [2024-06-04 17:01:00,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4103 conditions, 701 events. 388/701 cut-off events. For 15934/15934 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3218 event pairs, 75 based on Foata normal form. 1/702 useless extension candidates. Maximal degree in co-relation 4029. Up to 617 conditions per place. [2024-06-04 17:01:00,120 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 122 selfloop transitions, 30 changer transitions 0/154 dead transitions. [2024-06-04 17:01:00,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 154 transitions, 1735 flow [2024-06-04 17:01:00,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:01:00,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:01:00,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 126 transitions. [2024-06-04 17:01:00,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36950146627565983 [2024-06-04 17:01:00,125 INFO L175 Difference]: Start difference. First operand has 155 places, 140 transitions, 1395 flow. Second operand 11 states and 126 transitions. [2024-06-04 17:01:00,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 154 transitions, 1735 flow [2024-06-04 17:01:00,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 154 transitions, 1652 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-04 17:01:00,161 INFO L231 Difference]: Finished difference. Result has 158 places, 140 transitions, 1377 flow [2024-06-04 17:01:00,162 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1312, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1377, PETRI_PLACES=158, PETRI_TRANSITIONS=140} [2024-06-04 17:01:00,162 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 128 predicate places. [2024-06-04 17:01:00,162 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 140 transitions, 1377 flow [2024-06-04 17:01:00,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:01:00,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:01:00,163 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:01:00,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-04 17:01:00,163 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-04 17:01:00,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:01:00,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1485588375, now seen corresponding path program 7 times [2024-06-04 17:01:00,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:01:00,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377231698] [2024-06-04 17:01:00,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:01:00,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:01:00,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:01:05,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:01:05,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:01:05,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377231698] [2024-06-04 17:01:05,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377231698] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:01:05,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:01:05,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:01:05,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715978663] [2024-06-04 17:01:05,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:01:05,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:01:05,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:01:05,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:01:05,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:01:05,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:01:05,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 140 transitions, 1377 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:01:05,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:01:05,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:01:05,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:01:06,251 INFO L124 PetriNetUnfolderBase]: 392/709 cut-off events. [2024-06-04 17:01:06,252 INFO L125 PetriNetUnfolderBase]: For 17406/17406 co-relation queries the response was YES. [2024-06-04 17:01:06,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4146 conditions, 709 events. 392/709 cut-off events. For 17406/17406 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3250 event pairs, 46 based on Foata normal form. 2/711 useless extension candidates. Maximal degree in co-relation 4071. Up to 475 conditions per place. [2024-06-04 17:01:06,258 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 105 selfloop transitions, 48 changer transitions 0/155 dead transitions. [2024-06-04 17:01:06,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 155 transitions, 1798 flow [2024-06-04 17:01:06,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:01:06,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:01:06,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2024-06-04 17:01:06,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3911290322580645 [2024-06-04 17:01:06,261 INFO L175 Difference]: Start difference. First operand has 158 places, 140 transitions, 1377 flow. Second operand 8 states and 97 transitions. [2024-06-04 17:01:06,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 155 transitions, 1798 flow [2024-06-04 17:01:06,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 155 transitions, 1716 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-04 17:01:06,297 INFO L231 Difference]: Finished difference. Result has 156 places, 141 transitions, 1414 flow [2024-06-04 17:01:06,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1295, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1414, PETRI_PLACES=156, PETRI_TRANSITIONS=141} [2024-06-04 17:01:06,298 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 126 predicate places. [2024-06-04 17:01:06,298 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 141 transitions, 1414 flow [2024-06-04 17:01:06,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:01:06,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:01:06,299 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:01:06,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-04 17:01:06,299 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-04 17:01:06,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:01:06,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1485648825, now seen corresponding path program 8 times [2024-06-04 17:01:06,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:01:06,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259374985] [2024-06-04 17:01:06,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:01:06,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:01:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:01:11,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:01:11,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:01:11,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259374985] [2024-06-04 17:01:11,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259374985] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:01:11,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:01:11,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:01:11,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786012238] [2024-06-04 17:01:11,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:01:11,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:01:11,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:01:11,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:01:11,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:01:11,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:01:11,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 141 transitions, 1414 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:01:11,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:01:11,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:01:11,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:01:12,231 INFO L124 PetriNetUnfolderBase]: 396/718 cut-off events. [2024-06-04 17:01:12,232 INFO L125 PetriNetUnfolderBase]: For 18623/18623 co-relation queries the response was YES. [2024-06-04 17:01:12,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4250 conditions, 718 events. 396/718 cut-off events. For 18623/18623 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3326 event pairs, 73 based on Foata normal form. 2/720 useless extension candidates. Maximal degree in co-relation 4175. Up to 586 conditions per place. [2024-06-04 17:01:12,237 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 111 selfloop transitions, 41 changer transitions 0/154 dead transitions. [2024-06-04 17:01:12,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 154 transitions, 1763 flow [2024-06-04 17:01:12,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:01:12,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:01:12,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2024-06-04 17:01:12,239 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3911290322580645 [2024-06-04 17:01:12,239 INFO L175 Difference]: Start difference. First operand has 156 places, 141 transitions, 1414 flow. Second operand 8 states and 97 transitions. [2024-06-04 17:01:12,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 154 transitions, 1763 flow [2024-06-04 17:01:12,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 154 transitions, 1676 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-04 17:01:12,279 INFO L231 Difference]: Finished difference. Result has 156 places, 142 transitions, 1434 flow [2024-06-04 17:01:12,279 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1328, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1434, PETRI_PLACES=156, PETRI_TRANSITIONS=142} [2024-06-04 17:01:12,279 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 126 predicate places. [2024-06-04 17:01:12,279 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 142 transitions, 1434 flow [2024-06-04 17:01:12,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:01:12,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:01:12,280 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:01:12,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-04 17:01:12,280 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-04 17:01:12,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:01:12,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1325262207, now seen corresponding path program 8 times [2024-06-04 17:01:12,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:01:12,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159223503] [2024-06-04 17:01:12,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:01:12,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:01:12,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:01:17,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-04 17:01:17,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:01:17,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159223503] [2024-06-04 17:01:17,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159223503] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:01:17,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:01:17,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:01:17,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220854305] [2024-06-04 17:01:17,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:01:17,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:01:17,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:01:17,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:01:17,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:01:17,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:01:17,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 142 transitions, 1434 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:01:17,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:01:17,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:01:17,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:01:18,035 INFO L124 PetriNetUnfolderBase]: 399/723 cut-off events. [2024-06-04 17:01:18,036 INFO L125 PetriNetUnfolderBase]: For 16351/16351 co-relation queries the response was YES. [2024-06-04 17:01:18,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4224 conditions, 723 events. 399/723 cut-off events. For 16351/16351 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3379 event pairs, 62 based on Foata normal form. 1/724 useless extension candidates. Maximal degree in co-relation 4151. Up to 530 conditions per place. [2024-06-04 17:01:18,041 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 99 selfloop transitions, 61 changer transitions 0/162 dead transitions. [2024-06-04 17:01:18,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 162 transitions, 1920 flow [2024-06-04 17:01:18,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:01:18,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:01:18,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-04 17:01:18,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3906810035842294 [2024-06-04 17:01:18,043 INFO L175 Difference]: Start difference. First operand has 156 places, 142 transitions, 1434 flow. Second operand 9 states and 109 transitions. [2024-06-04 17:01:18,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 162 transitions, 1920 flow [2024-06-04 17:01:18,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 162 transitions, 1826 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-04 17:01:18,079 INFO L231 Difference]: Finished difference. Result has 157 places, 146 transitions, 1529 flow [2024-06-04 17:01:18,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1344, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1529, PETRI_PLACES=157, PETRI_TRANSITIONS=146} [2024-06-04 17:01:18,079 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 127 predicate places. [2024-06-04 17:01:18,079 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 146 transitions, 1529 flow [2024-06-04 17:01:18,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:01:18,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:01:18,080 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:01:18,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-04 17:01:18,080 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-04 17:01:18,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:01:18,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1328063367, now seen corresponding path program 9 times [2024-06-04 17:01:18,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:01:18,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590963052] [2024-06-04 17:01:18,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:01:18,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:01:18,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:01:24,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:01:24,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:01:24,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590963052] [2024-06-04 17:01:24,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590963052] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:01:24,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:01:24,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:01:24,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997881109] [2024-06-04 17:01:24,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:01:24,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:01:24,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:01:24,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:01:24,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:01:24,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:01:24,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 146 transitions, 1529 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:01:24,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:01:24,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:01:24,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:01:24,464 INFO L124 PetriNetUnfolderBase]: 402/728 cut-off events. [2024-06-04 17:01:24,464 INFO L125 PetriNetUnfolderBase]: For 15606/15606 co-relation queries the response was YES. [2024-06-04 17:01:24,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4296 conditions, 728 events. 402/728 cut-off events. For 15606/15606 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3398 event pairs, 68 based on Foata normal form. 1/729 useless extension candidates. Maximal degree in co-relation 4224. Up to 613 conditions per place. [2024-06-04 17:01:24,470 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 118 selfloop transitions, 42 changer transitions 0/162 dead transitions. [2024-06-04 17:01:24,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 162 transitions, 1929 flow [2024-06-04 17:01:24,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:01:24,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:01:24,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2024-06-04 17:01:24,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3763440860215054 [2024-06-04 17:01:24,471 INFO L175 Difference]: Start difference. First operand has 157 places, 146 transitions, 1529 flow. Second operand 9 states and 105 transitions. [2024-06-04 17:01:24,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 162 transitions, 1929 flow [2024-06-04 17:01:24,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 162 transitions, 1854 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-04 17:01:24,507 INFO L231 Difference]: Finished difference. Result has 160 places, 150 transitions, 1604 flow [2024-06-04 17:01:24,507 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1459, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1604, PETRI_PLACES=160, PETRI_TRANSITIONS=150} [2024-06-04 17:01:24,507 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 130 predicate places. [2024-06-04 17:01:24,507 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 150 transitions, 1604 flow [2024-06-04 17:01:24,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:01:24,508 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:01:24,508 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:01:24,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-04 17:01:24,508 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-04 17:01:24,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:01:24,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1328058593, now seen corresponding path program 9 times [2024-06-04 17:01:24,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:01:24,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056752123] [2024-06-04 17:01:24,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:01:24,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:01:24,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:01:29,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:01:29,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:01:29,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056752123] [2024-06-04 17:01:29,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056752123] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:01:29,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:01:29,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:01:29,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393007170] [2024-06-04 17:01:29,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:01:29,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:01:29,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:01:29,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:01:29,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:01:30,100 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:01:30,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 150 transitions, 1604 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:01:30,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:01:30,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:01:30,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:01:30,359 INFO L124 PetriNetUnfolderBase]: 399/723 cut-off events. [2024-06-04 17:01:30,359 INFO L125 PetriNetUnfolderBase]: For 14973/14973 co-relation queries the response was YES. [2024-06-04 17:01:30,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4284 conditions, 723 events. 399/723 cut-off events. For 14973/14973 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3350 event pairs, 73 based on Foata normal form. 2/725 useless extension candidates. Maximal degree in co-relation 4211. Up to 635 conditions per place. [2024-06-04 17:01:30,365 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 128 selfloop transitions, 30 changer transitions 0/160 dead transitions. [2024-06-04 17:01:30,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 160 transitions, 1944 flow [2024-06-04 17:01:30,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:01:30,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:01:30,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2024-06-04 17:01:30,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3790322580645161 [2024-06-04 17:01:30,367 INFO L175 Difference]: Start difference. First operand has 160 places, 150 transitions, 1604 flow. Second operand 8 states and 94 transitions. [2024-06-04 17:01:30,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 160 transitions, 1944 flow [2024-06-04 17:01:30,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 160 transitions, 1881 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-04 17:01:30,401 INFO L231 Difference]: Finished difference. Result has 162 places, 150 transitions, 1607 flow [2024-06-04 17:01:30,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1541, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1607, PETRI_PLACES=162, PETRI_TRANSITIONS=150} [2024-06-04 17:01:30,402 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 132 predicate places. [2024-06-04 17:01:30,402 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 150 transitions, 1607 flow [2024-06-04 17:01:30,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:01:30,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:01:30,402 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:01:30,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-04 17:01:30,402 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-04 17:01:30,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:01:30,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1488445459, now seen corresponding path program 10 times [2024-06-04 17:01:30,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:01:30,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075333738] [2024-06-04 17:01:30,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:01:30,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:01:30,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:01:35,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:01:35,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:01:35,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075333738] [2024-06-04 17:01:35,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075333738] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:01:35,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:01:35,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:01:35,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773530543] [2024-06-04 17:01:35,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:01:35,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:01:35,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:01:35,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:01:35,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:01:35,851 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:01:35,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 150 transitions, 1607 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:01:35,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:01:35,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:01:35,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:01:36,149 INFO L124 PetriNetUnfolderBase]: 402/728 cut-off events. [2024-06-04 17:01:36,149 INFO L125 PetriNetUnfolderBase]: For 14624/14624 co-relation queries the response was YES. [2024-06-04 17:01:36,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4299 conditions, 728 events. 402/728 cut-off events. For 14624/14624 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3399 event pairs, 67 based on Foata normal form. 1/729 useless extension candidates. Maximal degree in co-relation 4226. Up to 601 conditions per place. [2024-06-04 17:01:36,154 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 114 selfloop transitions, 48 changer transitions 0/164 dead transitions. [2024-06-04 17:01:36,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 164 transitions, 1995 flow [2024-06-04 17:01:36,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:01:36,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:01:36,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-04 17:01:36,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37992831541218636 [2024-06-04 17:01:36,156 INFO L175 Difference]: Start difference. First operand has 162 places, 150 transitions, 1607 flow. Second operand 9 states and 106 transitions. [2024-06-04 17:01:36,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 164 transitions, 1995 flow [2024-06-04 17:01:36,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 164 transitions, 1908 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-04 17:01:36,192 INFO L231 Difference]: Finished difference. Result has 163 places, 152 transitions, 1656 flow [2024-06-04 17:01:36,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1520, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1656, PETRI_PLACES=163, PETRI_TRANSITIONS=152} [2024-06-04 17:01:36,192 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 133 predicate places. [2024-06-04 17:01:36,192 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 152 transitions, 1656 flow [2024-06-04 17:01:36,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:01:36,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:01:36,192 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:01:36,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-04 17:01:36,193 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-04 17:01:36,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:01:36,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1603736629, now seen corresponding path program 11 times [2024-06-04 17:01:36,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:01:36,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193771291] [2024-06-04 17:01:36,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:01:36,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:01:36,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:01:42,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:01:42,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:01:42,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193771291] [2024-06-04 17:01:42,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193771291] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:01:42,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:01:42,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:01:42,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963693167] [2024-06-04 17:01:42,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:01:42,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:01:42,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:01:42,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:01:42,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:01:42,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:01:42,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 152 transitions, 1656 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:01:42,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:01:42,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:01:42,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:01:42,742 INFO L124 PetriNetUnfolderBase]: 421/758 cut-off events. [2024-06-04 17:01:42,743 INFO L125 PetriNetUnfolderBase]: For 16651/16651 co-relation queries the response was YES. [2024-06-04 17:01:42,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4548 conditions, 758 events. 421/758 cut-off events. For 16651/16651 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3569 event pairs, 65 based on Foata normal form. 3/761 useless extension candidates. Maximal degree in co-relation 4475. Up to 478 conditions per place. [2024-06-04 17:01:42,748 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 99 selfloop transitions, 81 changer transitions 0/182 dead transitions. [2024-06-04 17:01:42,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 182 transitions, 2241 flow [2024-06-04 17:01:42,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:01:42,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:01:42,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-04 17:01:42,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4290322580645161 [2024-06-04 17:01:42,750 INFO L175 Difference]: Start difference. First operand has 163 places, 152 transitions, 1656 flow. Second operand 10 states and 133 transitions. [2024-06-04 17:01:42,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 182 transitions, 2241 flow [2024-06-04 17:01:42,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 182 transitions, 2124 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-04 17:01:42,786 INFO L231 Difference]: Finished difference. Result has 165 places, 158 transitions, 1807 flow [2024-06-04 17:01:42,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1545, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1807, PETRI_PLACES=165, PETRI_TRANSITIONS=158} [2024-06-04 17:01:42,786 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 135 predicate places. [2024-06-04 17:01:42,786 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 158 transitions, 1807 flow [2024-06-04 17:01:42,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:01:42,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:01:42,787 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:01:42,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-04 17:01:42,787 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-04 17:01:42,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:01:42,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1603914259, now seen corresponding path program 12 times [2024-06-04 17:01:42,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:01:42,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281374324] [2024-06-04 17:01:42,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:01:42,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:01:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:01:48,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:01:48,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:01:48,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281374324] [2024-06-04 17:01:48,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281374324] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:01:48,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:01:48,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:01:48,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722035809] [2024-06-04 17:01:48,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:01:48,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:01:48,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:01:48,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:01:48,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:01:48,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:01:48,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 158 transitions, 1807 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-04 17:01:48,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:01:48,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:01:48,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:01:48,736 INFO L124 PetriNetUnfolderBase]: 424/764 cut-off events. [2024-06-04 17:01:48,736 INFO L125 PetriNetUnfolderBase]: For 16143/16143 co-relation queries the response was YES. [2024-06-04 17:01:48,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4722 conditions, 764 events. 424/764 cut-off events. For 16143/16143 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3613 event pairs, 69 based on Foata normal form. 1/765 useless extension candidates. Maximal degree in co-relation 4649. Up to 649 conditions per place. [2024-06-04 17:01:48,742 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 129 selfloop transitions, 43 changer transitions 0/174 dead transitions. [2024-06-04 17:01:48,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 174 transitions, 2237 flow [2024-06-04 17:01:48,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:01:48,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:01:48,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2024-06-04 17:01:48,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36774193548387096 [2024-06-04 17:01:48,744 INFO L175 Difference]: Start difference. First operand has 165 places, 158 transitions, 1807 flow. Second operand 10 states and 114 transitions. [2024-06-04 17:01:48,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 174 transitions, 2237 flow [2024-06-04 17:01:48,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 174 transitions, 2099 flow, removed 25 selfloop flow, removed 8 redundant places. [2024-06-04 17:01:48,779 INFO L231 Difference]: Finished difference. Result has 167 places, 161 transitions, 1815 flow [2024-06-04 17:01:48,779 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1675, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1815, PETRI_PLACES=167, PETRI_TRANSITIONS=161} [2024-06-04 17:01:48,780 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 137 predicate places. [2024-06-04 17:01:48,780 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 161 transitions, 1815 flow [2024-06-04 17:01:48,780 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-04 17:01:48,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:01:48,780 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:01:48,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-04 17:01:48,780 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-04 17:01:48,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:01:48,781 INFO L85 PathProgramCache]: Analyzing trace with hash 437340775, now seen corresponding path program 1 times [2024-06-04 17:01:48,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:01:48,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609860211] [2024-06-04 17:01:48,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:01:48,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:01:48,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:01:53,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:01:53,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:01:53,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609860211] [2024-06-04 17:01:53,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609860211] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:01:53,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:01:53,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:01:53,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582987763] [2024-06-04 17:01:53,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:01:53,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:01:53,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:01:53,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:01:53,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:01:53,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:01:53,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 161 transitions, 1815 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-04 17:01:53,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:01:53,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:01:53,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:01:53,827 INFO L124 PetriNetUnfolderBase]: 420/758 cut-off events. [2024-06-04 17:01:53,828 INFO L125 PetriNetUnfolderBase]: For 14647/14647 co-relation queries the response was YES. [2024-06-04 17:01:53,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4608 conditions, 758 events. 420/758 cut-off events. For 14647/14647 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3545 event pairs, 135 based on Foata normal form. 2/760 useless extension candidates. Maximal degree in co-relation 4535. Up to 715 conditions per place. [2024-06-04 17:01:53,833 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 157 selfloop transitions, 15 changer transitions 0/174 dead transitions. [2024-06-04 17:01:53,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 174 transitions, 2199 flow [2024-06-04 17:01:53,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:01:53,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:01:53,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2024-06-04 17:01:53,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-04 17:01:53,834 INFO L175 Difference]: Start difference. First operand has 167 places, 161 transitions, 1815 flow. Second operand 9 states and 99 transitions. [2024-06-04 17:01:53,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 174 transitions, 2199 flow [2024-06-04 17:01:53,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 174 transitions, 2096 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-04 17:01:53,868 INFO L231 Difference]: Finished difference. Result has 168 places, 163 transitions, 1767 flow [2024-06-04 17:01:53,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1712, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1767, PETRI_PLACES=168, PETRI_TRANSITIONS=163} [2024-06-04 17:01:53,868 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 138 predicate places. [2024-06-04 17:01:53,869 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 163 transitions, 1767 flow [2024-06-04 17:01:53,869 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-04 17:01:53,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:01:53,869 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:01:53,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-04 17:01:53,869 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-04 17:01:53,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:01:53,869 INFO L85 PathProgramCache]: Analyzing trace with hash 28613139, now seen corresponding path program 13 times [2024-06-04 17:01:53,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:01:53,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138322820] [2024-06-04 17:01:53,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:01:53,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:01:53,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:01:59,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:01:59,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:01:59,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138322820] [2024-06-04 17:01:59,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138322820] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:01:59,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:01:59,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:01:59,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383196411] [2024-06-04 17:01:59,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:01:59,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:01:59,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:01:59,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:01:59,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:01:59,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:01:59,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 163 transitions, 1767 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-04 17:01:59,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:01:59,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:01:59,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:01:59,951 INFO L124 PetriNetUnfolderBase]: 423/763 cut-off events. [2024-06-04 17:01:59,951 INFO L125 PetriNetUnfolderBase]: For 13916/13916 co-relation queries the response was YES. [2024-06-04 17:01:59,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4582 conditions, 763 events. 423/763 cut-off events. For 13916/13916 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3589 event pairs, 135 based on Foata normal form. 1/764 useless extension candidates. Maximal degree in co-relation 4509. Up to 727 conditions per place. [2024-06-04 17:01:59,956 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 158 selfloop transitions, 19 changer transitions 0/179 dead transitions. [2024-06-04 17:01:59,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 179 transitions, 2215 flow [2024-06-04 17:01:59,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:01:59,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:01:59,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2024-06-04 17:01:59,958 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3419354838709677 [2024-06-04 17:01:59,958 INFO L175 Difference]: Start difference. First operand has 168 places, 163 transitions, 1767 flow. Second operand 10 states and 106 transitions. [2024-06-04 17:01:59,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 179 transitions, 2215 flow [2024-06-04 17:01:59,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 179 transitions, 2176 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-04 17:01:59,993 INFO L231 Difference]: Finished difference. Result has 173 places, 170 transitions, 1864 flow [2024-06-04 17:01:59,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1728, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1864, PETRI_PLACES=173, PETRI_TRANSITIONS=170} [2024-06-04 17:01:59,993 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 143 predicate places. [2024-06-04 17:01:59,993 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 170 transitions, 1864 flow [2024-06-04 17:01:59,994 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-04 17:01:59,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:01:59,994 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:01:59,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-04 17:01:59,994 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-04 17:01:59,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:01:59,995 INFO L85 PathProgramCache]: Analyzing trace with hash 256514289, now seen corresponding path program 14 times [2024-06-04 17:01:59,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:01:59,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277415636] [2024-06-04 17:01:59,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:01:59,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:02:00,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:02:05,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:02:05,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:02:05,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277415636] [2024-06-04 17:02:05,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277415636] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:02:05,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:02:05,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:02:05,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369350307] [2024-06-04 17:02:05,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:02:05,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:02:05,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:02:05,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:02:05,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:02:05,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:02:05,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 170 transitions, 1864 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-04 17:02:05,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:02:05,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:02:05,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:02:05,937 INFO L124 PetriNetUnfolderBase]: 421/760 cut-off events. [2024-06-04 17:02:05,937 INFO L125 PetriNetUnfolderBase]: For 14212/14212 co-relation queries the response was YES. [2024-06-04 17:02:05,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4577 conditions, 760 events. 421/760 cut-off events. For 14212/14212 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3587 event pairs, 131 based on Foata normal form. 1/761 useless extension candidates. Maximal degree in co-relation 4501. Up to 730 conditions per place. [2024-06-04 17:02:05,942 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 162 selfloop transitions, 15 changer transitions 0/179 dead transitions. [2024-06-04 17:02:05,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 179 transitions, 2246 flow [2024-06-04 17:02:05,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:02:05,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:02:05,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2024-06-04 17:02:05,943 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34408602150537637 [2024-06-04 17:02:05,943 INFO L175 Difference]: Start difference. First operand has 173 places, 170 transitions, 1864 flow. Second operand 9 states and 96 transitions. [2024-06-04 17:02:05,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 179 transitions, 2246 flow [2024-06-04 17:02:05,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 179 transitions, 2200 flow, removed 17 selfloop flow, removed 4 redundant places. [2024-06-04 17:02:05,980 INFO L231 Difference]: Finished difference. Result has 179 places, 171 transitions, 1868 flow [2024-06-04 17:02:05,980 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1818, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1868, PETRI_PLACES=179, PETRI_TRANSITIONS=171} [2024-06-04 17:02:05,980 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 149 predicate places. [2024-06-04 17:02:05,981 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 171 transitions, 1868 flow [2024-06-04 17:02:05,981 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-04 17:02:05,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:02:05,981 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:02:05,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-04 17:02:05,981 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-04 17:02:05,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:02:05,981 INFO L85 PathProgramCache]: Analyzing trace with hash 2123210819, now seen corresponding path program 1 times [2024-06-04 17:02:05,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:02:05,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860425833] [2024-06-04 17:02:05,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:02:05,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:02:06,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:02:13,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:02:13,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:02:13,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860425833] [2024-06-04 17:02:13,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860425833] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:02:13,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:02:13,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:02:13,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412456945] [2024-06-04 17:02:13,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:02:13,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:02:13,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:02:13,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:02:13,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:02:13,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:02:13,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 171 transitions, 1868 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:02:13,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:02:13,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:02:13,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:02:13,556 INFO L124 PetriNetUnfolderBase]: 432/781 cut-off events. [2024-06-04 17:02:13,557 INFO L125 PetriNetUnfolderBase]: For 16412/16412 co-relation queries the response was YES. [2024-06-04 17:02:13,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4749 conditions, 781 events. 432/781 cut-off events. For 16412/16412 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3733 event pairs, 72 based on Foata normal form. 2/783 useless extension candidates. Maximal degree in co-relation 4670. Up to 582 conditions per place. [2024-06-04 17:02:13,562 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 146 selfloop transitions, 44 changer transitions 0/192 dead transitions. [2024-06-04 17:02:13,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 192 transitions, 2382 flow [2024-06-04 17:02:13,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:02:13,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:02:13,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 120 transitions. [2024-06-04 17:02:13,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3519061583577713 [2024-06-04 17:02:13,563 INFO L175 Difference]: Start difference. First operand has 179 places, 171 transitions, 1868 flow. Second operand 11 states and 120 transitions. [2024-06-04 17:02:13,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 192 transitions, 2382 flow [2024-06-04 17:02:13,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 192 transitions, 2311 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-04 17:02:13,603 INFO L231 Difference]: Finished difference. Result has 183 places, 173 transitions, 1911 flow [2024-06-04 17:02:13,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1797, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1911, PETRI_PLACES=183, PETRI_TRANSITIONS=173} [2024-06-04 17:02:13,604 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 153 predicate places. [2024-06-04 17:02:13,604 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 173 transitions, 1911 flow [2024-06-04 17:02:13,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:02:13,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:02:13,604 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:02:13,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-04 17:02:13,604 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-04 17:02:13,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:02:13,605 INFO L85 PathProgramCache]: Analyzing trace with hash -56264605, now seen corresponding path program 2 times [2024-06-04 17:02:13,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:02:13,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464293300] [2024-06-04 17:02:13,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:02:13,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:02:13,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:02:20,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:02:20,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:02:20,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464293300] [2024-06-04 17:02:20,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464293300] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:02:20,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:02:20,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:02:20,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787504046] [2024-06-04 17:02:20,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:02:20,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:02:20,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:02:20,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:02:20,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:02:20,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:02:20,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 173 transitions, 1911 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-04 17:02:20,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:02:20,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:02:20,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:02:21,122 INFO L124 PetriNetUnfolderBase]: 443/802 cut-off events. [2024-06-04 17:02:21,122 INFO L125 PetriNetUnfolderBase]: For 18617/18617 co-relation queries the response was YES. [2024-06-04 17:02:21,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4971 conditions, 802 events. 443/802 cut-off events. For 18617/18617 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3886 event pairs, 77 based on Foata normal form. 2/804 useless extension candidates. Maximal degree in co-relation 4892. Up to 658 conditions per place. [2024-06-04 17:02:21,129 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 145 selfloop transitions, 45 changer transitions 0/192 dead transitions. [2024-06-04 17:02:21,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 192 transitions, 2425 flow [2024-06-04 17:02:21,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:02:21,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:02:21,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2024-06-04 17:02:21,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3812316715542522 [2024-06-04 17:02:21,131 INFO L175 Difference]: Start difference. First operand has 183 places, 173 transitions, 1911 flow. Second operand 11 states and 130 transitions. [2024-06-04 17:02:21,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 192 transitions, 2425 flow [2024-06-04 17:02:21,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 192 transitions, 2344 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-04 17:02:21,173 INFO L231 Difference]: Finished difference. Result has 187 places, 175 transitions, 1950 flow [2024-06-04 17:02:21,174 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1842, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1950, PETRI_PLACES=187, PETRI_TRANSITIONS=175} [2024-06-04 17:02:21,174 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 157 predicate places. [2024-06-04 17:02:21,174 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 175 transitions, 1950 flow [2024-06-04 17:02:21,175 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-04 17:02:21,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:02:21,175 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:02:21,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-04 17:02:21,175 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-04 17:02:21,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:02:21,175 INFO L85 PathProgramCache]: Analyzing trace with hash -56260885, now seen corresponding path program 3 times [2024-06-04 17:02:21,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:02:21,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093616007] [2024-06-04 17:02:21,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:02:21,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:02:21,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:02:27,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:02:27,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:02:27,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093616007] [2024-06-04 17:02:27,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093616007] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:02:27,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:02:27,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:02:27,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049342623] [2024-06-04 17:02:27,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:02:27,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:02:27,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:02:27,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:02:27,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:02:28,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:02:28,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 175 transitions, 1950 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-04 17:02:28,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:02:28,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:02:28,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:02:28,398 INFO L124 PetriNetUnfolderBase]: 440/797 cut-off events. [2024-06-04 17:02:28,398 INFO L125 PetriNetUnfolderBase]: For 18327/18327 co-relation queries the response was YES. [2024-06-04 17:02:28,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4936 conditions, 797 events. 440/797 cut-off events. For 18327/18327 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3852 event pairs, 78 based on Foata normal form. 2/799 useless extension candidates. Maximal degree in co-relation 4855. Up to 670 conditions per place. [2024-06-04 17:02:28,404 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 144 selfloop transitions, 44 changer transitions 0/190 dead transitions. [2024-06-04 17:02:28,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 190 transitions, 2364 flow [2024-06-04 17:02:28,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:02:28,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:02:28,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 127 transitions. [2024-06-04 17:02:28,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3724340175953079 [2024-06-04 17:02:28,406 INFO L175 Difference]: Start difference. First operand has 187 places, 175 transitions, 1950 flow. Second operand 11 states and 127 transitions. [2024-06-04 17:02:28,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 190 transitions, 2364 flow [2024-06-04 17:02:28,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 190 transitions, 2303 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-04 17:02:28,448 INFO L231 Difference]: Finished difference. Result has 191 places, 175 transitions, 1981 flow [2024-06-04 17:02:28,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1889, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1981, PETRI_PLACES=191, PETRI_TRANSITIONS=175} [2024-06-04 17:02:28,448 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 161 predicate places. [2024-06-04 17:02:28,448 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 175 transitions, 1981 flow [2024-06-04 17:02:28,448 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-04 17:02:28,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:02:28,449 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:02:28,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-04 17:02:28,449 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-04 17:02:28,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:02:28,449 INFO L85 PathProgramCache]: Analyzing trace with hash 2126277936, now seen corresponding path program 1 times [2024-06-04 17:02:28,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:02:28,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195834280] [2024-06-04 17:02:28,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:02:28,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:02:28,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:02:33,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:02:33,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:02:33,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195834280] [2024-06-04 17:02:33,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195834280] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:02:33,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:02:33,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:02:33,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069516425] [2024-06-04 17:02:33,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:02:33,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:02:33,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:02:33,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:02:33,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:02:33,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:02:33,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 175 transitions, 1981 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-04 17:02:33,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:02:33,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:02:33,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:02:34,255 INFO L124 PetriNetUnfolderBase]: 472/849 cut-off events. [2024-06-04 17:02:34,256 INFO L125 PetriNetUnfolderBase]: For 22126/22126 co-relation queries the response was YES. [2024-06-04 17:02:34,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5440 conditions, 849 events. 472/849 cut-off events. For 22126/22126 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4119 event pairs, 86 based on Foata normal form. 2/851 useless extension candidates. Maximal degree in co-relation 5357. Up to 560 conditions per place. [2024-06-04 17:02:34,262 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 135 selfloop transitions, 64 changer transitions 0/201 dead transitions. [2024-06-04 17:02:34,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 201 transitions, 2591 flow [2024-06-04 17:02:34,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:02:34,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:02:34,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2024-06-04 17:02:34,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4129032258064516 [2024-06-04 17:02:34,270 INFO L175 Difference]: Start difference. First operand has 191 places, 175 transitions, 1981 flow. Second operand 10 states and 128 transitions. [2024-06-04 17:02:34,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 201 transitions, 2591 flow [2024-06-04 17:02:34,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 201 transitions, 2501 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-04 17:02:34,325 INFO L231 Difference]: Finished difference. Result has 192 places, 183 transitions, 2159 flow [2024-06-04 17:02:34,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1891, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2159, PETRI_PLACES=192, PETRI_TRANSITIONS=183} [2024-06-04 17:02:34,326 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 162 predicate places. [2024-06-04 17:02:34,326 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 183 transitions, 2159 flow [2024-06-04 17:02:34,326 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-04 17:02:34,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:02:34,326 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:02:34,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-04 17:02:34,327 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-04 17:02:34,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:02:34,327 INFO L85 PathProgramCache]: Analyzing trace with hash 881465298, now seen corresponding path program 2 times [2024-06-04 17:02:34,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:02:34,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099912785] [2024-06-04 17:02:34,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:02:34,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:02:34,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:02:40,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:02:40,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:02:40,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099912785] [2024-06-04 17:02:40,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099912785] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:02:40,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:02:40,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:02:40,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260280865] [2024-06-04 17:02:40,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:02:40,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:02:40,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:02:40,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:02:40,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:02:40,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:02:40,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 183 transitions, 2159 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-04 17:02:40,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:02:40,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:02:40,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:02:41,164 INFO L124 PetriNetUnfolderBase]: 468/843 cut-off events. [2024-06-04 17:02:41,165 INFO L125 PetriNetUnfolderBase]: For 22413/22413 co-relation queries the response was YES. [2024-06-04 17:02:41,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5535 conditions, 843 events. 468/843 cut-off events. For 22413/22413 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4104 event pairs, 77 based on Foata normal form. 2/845 useless extension candidates. Maximal degree in co-relation 5450. Up to 638 conditions per place. [2024-06-04 17:02:41,171 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 147 selfloop transitions, 50 changer transitions 0/199 dead transitions. [2024-06-04 17:02:41,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 199 transitions, 2591 flow [2024-06-04 17:02:41,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:02:41,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:02:41,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-04 17:02:41,174 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4064516129032258 [2024-06-04 17:02:41,174 INFO L175 Difference]: Start difference. First operand has 192 places, 183 transitions, 2159 flow. Second operand 10 states and 126 transitions. [2024-06-04 17:02:41,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 199 transitions, 2591 flow [2024-06-04 17:02:41,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 199 transitions, 2529 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-04 17:02:41,231 INFO L231 Difference]: Finished difference. Result has 197 places, 183 transitions, 2202 flow [2024-06-04 17:02:41,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2097, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2202, PETRI_PLACES=197, PETRI_TRANSITIONS=183} [2024-06-04 17:02:41,232 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 167 predicate places. [2024-06-04 17:02:41,232 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 183 transitions, 2202 flow [2024-06-04 17:02:41,232 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-04 17:02:41,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:02:41,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-04 17:02:41,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-04 17:02:41,232 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-04 17:02:41,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:02:41,232 INFO L85 PathProgramCache]: Analyzing trace with hash 493580898, now seen corresponding path program 3 times [2024-06-04 17:02:41,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:02:41,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219502729] [2024-06-04 17:02:41,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:02:41,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:02:41,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:02:46,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-04 17:02:46,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:02:46,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219502729] [2024-06-04 17:02:46,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219502729] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:02:46,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:02:46,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:02:46,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951582120] [2024-06-04 17:02:46,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:02:46,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:02:46,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:02:46,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:02:46,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:02:46,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:02:46,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 183 transitions, 2202 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-04 17:02:46,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:02:46,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:02:46,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:02:47,483 INFO L124 PetriNetUnfolderBase]: 474/853 cut-off events. [2024-06-04 17:02:47,483 INFO L125 PetriNetUnfolderBase]: For 23713/23713 co-relation queries the response was YES. [2024-06-04 17:02:47,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5712 conditions, 853 events. 474/853 cut-off events. For 23713/23713 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4140 event pairs, 73 based on Foata normal form. 2/855 useless extension candidates. Maximal degree in co-relation 5625. Up to 617 conditions per place. [2024-06-04 17:02:47,489 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 144 selfloop transitions, 57 changer transitions 0/203 dead transitions. [2024-06-04 17:02:47,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 203 transitions, 2680 flow [2024-06-04 17:02:47,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:02:47,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:02:47,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2024-06-04 17:02:47,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2024-06-04 17:02:47,490 INFO L175 Difference]: Start difference. First operand has 197 places, 183 transitions, 2202 flow. Second operand 10 states and 130 transitions. [2024-06-04 17:02:47,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 203 transitions, 2680 flow [2024-06-04 17:02:47,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 203 transitions, 2560 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-04 17:02:47,541 INFO L231 Difference]: Finished difference. Result has 197 places, 185 transitions, 2239 flow [2024-06-04 17:02:47,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2082, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2239, PETRI_PLACES=197, PETRI_TRANSITIONS=185} [2024-06-04 17:02:47,541 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 167 predicate places. [2024-06-04 17:02:47,541 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 185 transitions, 2239 flow [2024-06-04 17:02:47,542 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-04 17:02:47,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:02:47,542 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:02:47,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-04 17:02:47,542 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-04 17:02:47,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:02:47,542 INFO L85 PathProgramCache]: Analyzing trace with hash -2081853555, now seen corresponding path program 4 times [2024-06-04 17:02:47,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:02:47,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536927213] [2024-06-04 17:02:47,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:02:47,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:02:47,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:02:54,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:02:54,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:02:54,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536927213] [2024-06-04 17:02:54,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536927213] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:02:54,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:02:54,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:02:54,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755527173] [2024-06-04 17:02:54,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:02:54,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:02:54,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:02:54,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:02:54,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:02:54,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:02:54,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 185 transitions, 2239 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-04 17:02:54,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:02:54,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:02:54,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:02:55,246 INFO L124 PetriNetUnfolderBase]: 494/897 cut-off events. [2024-06-04 17:02:55,246 INFO L125 PetriNetUnfolderBase]: For 32528/32528 co-relation queries the response was YES. [2024-06-04 17:02:55,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5903 conditions, 897 events. 494/897 cut-off events. For 32528/32528 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4436 event pairs, 80 based on Foata normal form. 12/909 useless extension candidates. Maximal degree in co-relation 5816. Up to 728 conditions per place. [2024-06-04 17:02:55,253 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 162 selfloop transitions, 35 changer transitions 8/207 dead transitions. [2024-06-04 17:02:55,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 207 transitions, 2735 flow [2024-06-04 17:02:55,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:02:55,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:02:55,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2024-06-04 17:02:55,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39589442815249265 [2024-06-04 17:02:55,254 INFO L175 Difference]: Start difference. First operand has 197 places, 185 transitions, 2239 flow. Second operand 11 states and 135 transitions. [2024-06-04 17:02:55,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 207 transitions, 2735 flow [2024-06-04 17:02:55,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 207 transitions, 2584 flow, removed 20 selfloop flow, removed 8 redundant places. [2024-06-04 17:02:55,313 INFO L231 Difference]: Finished difference. Result has 200 places, 183 transitions, 2144 flow [2024-06-04 17:02:55,313 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2090, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2144, PETRI_PLACES=200, PETRI_TRANSITIONS=183} [2024-06-04 17:02:55,313 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 170 predicate places. [2024-06-04 17:02:55,314 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 183 transitions, 2144 flow [2024-06-04 17:02:55,314 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-04 17:02:55,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:02:55,314 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:02:55,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-04 17:02:55,314 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-04 17:02:55,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:02:55,314 INFO L85 PathProgramCache]: Analyzing trace with hash -2082001425, now seen corresponding path program 5 times [2024-06-04 17:02:55,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:02:55,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990939721] [2024-06-04 17:02:55,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:02:55,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:02:55,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:03:01,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:03:01,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:03:01,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990939721] [2024-06-04 17:03:01,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990939721] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:03:01,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:03:01,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:03:01,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600863065] [2024-06-04 17:03:01,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:03:01,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:03:01,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:03:01,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:03:01,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:03:01,862 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:03:01,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 183 transitions, 2144 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-04 17:03:01,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:03:01,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:03:01,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:03:02,243 INFO L124 PetriNetUnfolderBase]: 479/868 cut-off events. [2024-06-04 17:03:02,244 INFO L125 PetriNetUnfolderBase]: For 26966/26966 co-relation queries the response was YES. [2024-06-04 17:03:02,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5748 conditions, 868 events. 479/868 cut-off events. For 26966/26966 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4306 event pairs, 84 based on Foata normal form. 2/870 useless extension candidates. Maximal degree in co-relation 5660. Up to 721 conditions per place. [2024-06-04 17:03:02,250 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 152 selfloop transitions, 46 changer transitions 0/200 dead transitions. [2024-06-04 17:03:02,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 200 transitions, 2676 flow [2024-06-04 17:03:02,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:03:02,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:03:02,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-04 17:03:02,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3935483870967742 [2024-06-04 17:03:02,251 INFO L175 Difference]: Start difference. First operand has 200 places, 183 transitions, 2144 flow. Second operand 10 states and 122 transitions. [2024-06-04 17:03:02,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 200 transitions, 2676 flow [2024-06-04 17:03:02,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 200 transitions, 2600 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-04 17:03:02,312 INFO L231 Difference]: Finished difference. Result has 199 places, 185 transitions, 2188 flow [2024-06-04 17:03:02,313 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2070, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2188, PETRI_PLACES=199, PETRI_TRANSITIONS=185} [2024-06-04 17:03:02,313 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 169 predicate places. [2024-06-04 17:03:02,313 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 185 transitions, 2188 flow [2024-06-04 17:03:02,313 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-04 17:03:02,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:03:02,313 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:03:02,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-04 17:03:02,313 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-04 17:03:02,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:03:02,314 INFO L85 PathProgramCache]: Analyzing trace with hash 493436593, now seen corresponding path program 6 times [2024-06-04 17:03:02,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:03:02,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101879444] [2024-06-04 17:03:02,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:03:02,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:03:02,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:03:07,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:03:07,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:03:07,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101879444] [2024-06-04 17:03:07,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101879444] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:03:07,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:03:07,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:03:07,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264730690] [2024-06-04 17:03:07,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:03:07,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:03:07,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:03:07,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:03:07,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:03:07,987 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:03:07,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 185 transitions, 2188 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-04 17:03:07,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:03:07,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:03:07,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:03:08,357 INFO L124 PetriNetUnfolderBase]: 476/863 cut-off events. [2024-06-04 17:03:08,357 INFO L125 PetriNetUnfolderBase]: For 25418/25418 co-relation queries the response was YES. [2024-06-04 17:03:08,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5674 conditions, 863 events. 476/863 cut-off events. For 25418/25418 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4248 event pairs, 87 based on Foata normal form. 2/865 useless extension candidates. Maximal degree in co-relation 5586. Up to 739 conditions per place. [2024-06-04 17:03:08,364 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 152 selfloop transitions, 44 changer transitions 0/198 dead transitions. [2024-06-04 17:03:08,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 198 transitions, 2612 flow [2024-06-04 17:03:08,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:03:08,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:03:08,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-04 17:03:08,365 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-04 17:03:08,365 INFO L175 Difference]: Start difference. First operand has 199 places, 185 transitions, 2188 flow. Second operand 10 states and 120 transitions. [2024-06-04 17:03:08,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 198 transitions, 2612 flow [2024-06-04 17:03:08,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 198 transitions, 2547 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-04 17:03:08,424 INFO L231 Difference]: Finished difference. Result has 203 places, 185 transitions, 2215 flow [2024-06-04 17:03:08,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2123, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2215, PETRI_PLACES=203, PETRI_TRANSITIONS=185} [2024-06-04 17:03:08,425 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 173 predicate places. [2024-06-04 17:03:08,425 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 185 transitions, 2215 flow [2024-06-04 17:03:08,425 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-04 17:03:08,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:03:08,425 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:03:08,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-04 17:03:08,426 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-04 17:03:08,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:03:08,426 INFO L85 PathProgramCache]: Analyzing trace with hash -2081997550, now seen corresponding path program 4 times [2024-06-04 17:03:08,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:03:08,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968465361] [2024-06-04 17:03:08,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:03:08,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:03:08,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:03:14,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:03:14,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:03:14,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968465361] [2024-06-04 17:03:14,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968465361] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:03:14,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:03:14,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:03:14,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523969088] [2024-06-04 17:03:14,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:03:14,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:03:14,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:03:14,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:03:14,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:03:14,352 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:03:14,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 185 transitions, 2215 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-04 17:03:14,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:03:14,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:03:14,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:03:14,813 INFO L124 PetriNetUnfolderBase]: 482/873 cut-off events. [2024-06-04 17:03:14,813 INFO L125 PetriNetUnfolderBase]: For 26864/26864 co-relation queries the response was YES. [2024-06-04 17:03:14,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5831 conditions, 873 events. 482/873 cut-off events. For 26864/26864 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4341 event pairs, 79 based on Foata normal form. 2/875 useless extension candidates. Maximal degree in co-relation 5741. Up to 655 conditions per place. [2024-06-04 17:03:14,821 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 148 selfloop transitions, 54 changer transitions 0/204 dead transitions. [2024-06-04 17:03:14,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 204 transitions, 2695 flow [2024-06-04 17:03:14,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:03:14,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:03:14,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-04 17:03:14,822 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4161290322580645 [2024-06-04 17:03:14,822 INFO L175 Difference]: Start difference. First operand has 203 places, 185 transitions, 2215 flow. Second operand 10 states and 129 transitions. [2024-06-04 17:03:14,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 204 transitions, 2695 flow [2024-06-04 17:03:14,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 204 transitions, 2601 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-04 17:03:14,884 INFO L231 Difference]: Finished difference. Result has 204 places, 187 transitions, 2274 flow [2024-06-04 17:03:14,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2121, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2274, PETRI_PLACES=204, PETRI_TRANSITIONS=187} [2024-06-04 17:03:14,885 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 174 predicate places. [2024-06-04 17:03:14,885 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 187 transitions, 2274 flow [2024-06-04 17:03:14,885 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-04 17:03:14,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:03:14,885 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:03:14,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-04 17:03:14,885 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-04 17:03:14,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:03:14,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1566340949, now seen corresponding path program 7 times [2024-06-04 17:03:14,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:03:14,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274034855] [2024-06-04 17:03:14,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:03:14,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:03:14,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:03:22,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:03:22,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:03:22,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274034855] [2024-06-04 17:03:22,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274034855] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:03:22,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:03:22,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:03:22,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866656769] [2024-06-04 17:03:22,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:03:22,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:03:22,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:03:22,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:03:22,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:03:22,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:03:22,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 187 transitions, 2274 flow. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:03:22,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:03:22,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:03:22,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:03:22,871 INFO L124 PetriNetUnfolderBase]: 486/881 cut-off events. [2024-06-04 17:03:22,872 INFO L125 PetriNetUnfolderBase]: For 28131/28131 co-relation queries the response was YES. [2024-06-04 17:03:22,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5935 conditions, 881 events. 486/881 cut-off events. For 28131/28131 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4353 event pairs, 73 based on Foata normal form. 2/883 useless extension candidates. Maximal degree in co-relation 5844. Up to 448 conditions per place. [2024-06-04 17:03:22,879 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 135 selfloop transitions, 67 changer transitions 0/204 dead transitions. [2024-06-04 17:03:22,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 204 transitions, 2810 flow [2024-06-04 17:03:22,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:03:22,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:03:22,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-04 17:03:22,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37992831541218636 [2024-06-04 17:03:22,881 INFO L175 Difference]: Start difference. First operand has 204 places, 187 transitions, 2274 flow. Second operand 9 states and 106 transitions. [2024-06-04 17:03:22,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 204 transitions, 2810 flow [2024-06-04 17:03:22,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 204 transitions, 2679 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-04 17:03:22,950 INFO L231 Difference]: Finished difference. Result has 205 places, 188 transitions, 2291 flow [2024-06-04 17:03:22,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2143, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2291, PETRI_PLACES=205, PETRI_TRANSITIONS=188} [2024-06-04 17:03:22,950 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 175 predicate places. [2024-06-04 17:03:22,950 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 188 transitions, 2291 flow [2024-06-04 17:03:22,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:03:22,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:03:22,951 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:03:22,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-04 17:03:22,951 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-04 17:03:22,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:03:22,951 INFO L85 PathProgramCache]: Analyzing trace with hash -63096817, now seen corresponding path program 8 times [2024-06-04 17:03:22,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:03:22,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830345592] [2024-06-04 17:03:22,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:03:22,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:03:22,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:03:30,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:03:30,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:03:30,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830345592] [2024-06-04 17:03:30,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830345592] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:03:30,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:03:30,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:03:30,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533240849] [2024-06-04 17:03:30,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:03:30,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:03:30,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:03:30,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:03:30,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:03:30,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:03:30,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 188 transitions, 2291 flow. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:03:30,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:03:30,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:03:30,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:03:31,007 INFO L124 PetriNetUnfolderBase]: 497/902 cut-off events. [2024-06-04 17:03:31,007 INFO L125 PetriNetUnfolderBase]: For 31010/31010 co-relation queries the response was YES. [2024-06-04 17:03:31,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6139 conditions, 902 events. 497/902 cut-off events. For 31010/31010 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4503 event pairs, 79 based on Foata normal form. 2/904 useless extension candidates. Maximal degree in co-relation 6047. Up to 612 conditions per place. [2024-06-04 17:03:31,015 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 145 selfloop transitions, 60 changer transitions 0/207 dead transitions. [2024-06-04 17:03:31,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 207 transitions, 2853 flow [2024-06-04 17:03:31,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:03:31,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:03:31,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-04 17:03:31,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3935483870967742 [2024-06-04 17:03:31,017 INFO L175 Difference]: Start difference. First operand has 205 places, 188 transitions, 2291 flow. Second operand 10 states and 122 transitions. [2024-06-04 17:03:31,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 207 transitions, 2853 flow [2024-06-04 17:03:31,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 207 transitions, 2732 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-04 17:03:31,092 INFO L231 Difference]: Finished difference. Result has 209 places, 190 transitions, 2322 flow [2024-06-04 17:03:31,092 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2180, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2322, PETRI_PLACES=209, PETRI_TRANSITIONS=190} [2024-06-04 17:03:31,092 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 179 predicate places. [2024-06-04 17:03:31,092 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 190 transitions, 2322 flow [2024-06-04 17:03:31,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:03:31,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:03:31,093 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:03:31,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-04 17:03:31,093 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-04 17:03:31,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:03:31,093 INFO L85 PathProgramCache]: Analyzing trace with hash 311462543, now seen corresponding path program 9 times [2024-06-04 17:03:31,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:03:31,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962361239] [2024-06-04 17:03:31,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:03:31,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:03:31,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:03:38,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:03:38,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:03:38,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962361239] [2024-06-04 17:03:38,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962361239] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:03:38,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:03:38,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:03:38,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206662148] [2024-06-04 17:03:38,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:03:38,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:03:38,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:03:38,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:03:38,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:03:38,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:03:38,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 190 transitions, 2322 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-04 17:03:38,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:03:38,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:03:38,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:03:38,944 INFO L124 PetriNetUnfolderBase]: 501/910 cut-off events. [2024-06-04 17:03:38,944 INFO L125 PetriNetUnfolderBase]: For 32031/32031 co-relation queries the response was YES. [2024-06-04 17:03:38,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6203 conditions, 910 events. 501/910 cut-off events. For 32031/32031 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4577 event pairs, 85 based on Foata normal form. 2/912 useless extension candidates. Maximal degree in co-relation 6110. Up to 770 conditions per place. [2024-06-04 17:03:38,950 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 166 selfloop transitions, 41 changer transitions 0/209 dead transitions. [2024-06-04 17:03:38,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 209 transitions, 2877 flow [2024-06-04 17:03:38,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:03:38,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:03:38,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 127 transitions. [2024-06-04 17:03:38,952 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3724340175953079 [2024-06-04 17:03:38,952 INFO L175 Difference]: Start difference. First operand has 209 places, 190 transitions, 2322 flow. Second operand 11 states and 127 transitions. [2024-06-04 17:03:38,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 209 transitions, 2877 flow [2024-06-04 17:03:39,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 209 transitions, 2804 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-04 17:03:39,028 INFO L231 Difference]: Finished difference. Result has 213 places, 191 transitions, 2346 flow [2024-06-04 17:03:39,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2251, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2346, PETRI_PLACES=213, PETRI_TRANSITIONS=191} [2024-06-04 17:03:39,029 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 183 predicate places. [2024-06-04 17:03:39,029 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 191 transitions, 2346 flow [2024-06-04 17:03:39,029 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-04 17:03:39,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:03:39,029 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:03:39,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-04 17:03:39,029 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-04 17:03:39,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:03:39,032 INFO L85 PathProgramCache]: Analyzing trace with hash 311913748, now seen corresponding path program 5 times [2024-06-04 17:03:39,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:03:39,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261751884] [2024-06-04 17:03:39,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:03:39,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:03:39,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:03:44,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:03:44,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:03:44,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261751884] [2024-06-04 17:03:44,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261751884] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:03:44,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:03:44,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:03:44,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905126507] [2024-06-04 17:03:44,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:03:44,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:03:44,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:03:44,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:03:44,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:03:44,643 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:03:44,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 191 transitions, 2346 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-04 17:03:44,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:03:44,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:03:44,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:03:45,082 INFO L124 PetriNetUnfolderBase]: 507/920 cut-off events. [2024-06-04 17:03:45,082 INFO L125 PetriNetUnfolderBase]: For 32247/32247 co-relation queries the response was YES. [2024-06-04 17:03:45,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6329 conditions, 920 events. 507/920 cut-off events. For 32247/32247 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4650 event pairs, 84 based on Foata normal form. 2/922 useless extension candidates. Maximal degree in co-relation 6235. Up to 717 conditions per place. [2024-06-04 17:03:45,089 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 132 selfloop transitions, 74 changer transitions 0/208 dead transitions. [2024-06-04 17:03:45,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 208 transitions, 2828 flow [2024-06-04 17:03:45,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:03:45,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:03:45,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-04 17:03:45,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-04 17:03:45,092 INFO L175 Difference]: Start difference. First operand has 213 places, 191 transitions, 2346 flow. Second operand 10 states and 120 transitions. [2024-06-04 17:03:45,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 208 transitions, 2828 flow [2024-06-04 17:03:45,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 208 transitions, 2723 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-04 17:03:45,177 INFO L231 Difference]: Finished difference. Result has 214 places, 193 transitions, 2430 flow [2024-06-04 17:03:45,177 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2241, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2430, PETRI_PLACES=214, PETRI_TRANSITIONS=193} [2024-06-04 17:03:45,177 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 184 predicate places. [2024-06-04 17:03:45,177 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 193 transitions, 2430 flow [2024-06-04 17:03:45,177 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-04 17:03:45,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:03:45,178 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:03:45,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-04 17:03:45,178 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-04 17:03:45,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:03:45,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1883584623, now seen corresponding path program 10 times [2024-06-04 17:03:45,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:03:45,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354883685] [2024-06-04 17:03:45,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:03:45,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:03:45,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:03:52,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-04 17:03:52,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:03:52,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354883685] [2024-06-04 17:03:52,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354883685] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:03:52,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:03:52,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:03:52,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305826030] [2024-06-04 17:03:52,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:03:52,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:03:52,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:03:52,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:03:52,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:03:52,258 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:03:52,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 193 transitions, 2430 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-04 17:03:52,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:03:52,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:03:52,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:03:52,735 INFO L124 PetriNetUnfolderBase]: 504/915 cut-off events. [2024-06-04 17:03:52,735 INFO L125 PetriNetUnfolderBase]: For 31632/31632 co-relation queries the response was YES. [2024-06-04 17:03:52,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6304 conditions, 915 events. 504/915 cut-off events. For 31632/31632 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4628 event pairs, 85 based on Foata normal form. 2/917 useless extension candidates. Maximal degree in co-relation 6209. Up to 792 conditions per place. [2024-06-04 17:03:52,742 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 167 selfloop transitions, 39 changer transitions 0/208 dead transitions. [2024-06-04 17:03:52,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 208 transitions, 2880 flow [2024-06-04 17:03:52,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:03:52,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:03:52,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2024-06-04 17:03:52,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3741935483870968 [2024-06-04 17:03:52,745 INFO L175 Difference]: Start difference. First operand has 214 places, 193 transitions, 2430 flow. Second operand 10 states and 116 transitions. [2024-06-04 17:03:52,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 208 transitions, 2880 flow [2024-06-04 17:03:52,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 208 transitions, 2750 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-04 17:03:52,822 INFO L231 Difference]: Finished difference. Result has 217 places, 193 transitions, 2382 flow [2024-06-04 17:03:52,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2300, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2382, PETRI_PLACES=217, PETRI_TRANSITIONS=193} [2024-06-04 17:03:52,822 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 187 predicate places. [2024-06-04 17:03:52,823 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 193 transitions, 2382 flow [2024-06-04 17:03:52,823 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-04 17:03:52,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:03:52,823 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:03:52,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-04 17:03:52,823 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-04 17:03:52,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:03:52,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1013209533, now seen corresponding path program 11 times [2024-06-04 17:03:52,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:03:52,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199551972] [2024-06-04 17:03:52,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:03:52,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:03:52,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:03:59,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:03:59,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:03:59,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199551972] [2024-06-04 17:03:59,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199551972] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:03:59,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:03:59,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:03:59,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719344255] [2024-06-04 17:03:59,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:03:59,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:03:59,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:03:59,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:03:59,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:04:00,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:04:00,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 193 transitions, 2382 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-04 17:04:00,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:04:00,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:04:00,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:04:00,509 INFO L124 PetriNetUnfolderBase]: 513/933 cut-off events. [2024-06-04 17:04:00,510 INFO L125 PetriNetUnfolderBase]: For 32745/32745 co-relation queries the response was YES. [2024-06-04 17:04:00,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6333 conditions, 933 events. 513/933 cut-off events. For 32745/32745 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4752 event pairs, 91 based on Foata normal form. 2/935 useless extension candidates. Maximal degree in co-relation 6237. Up to 798 conditions per place. [2024-06-04 17:04:00,517 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 173 selfloop transitions, 40 changer transitions 0/215 dead transitions. [2024-06-04 17:04:00,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 215 transitions, 2976 flow [2024-06-04 17:04:00,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:04:00,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:04:00,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 142 transitions. [2024-06-04 17:04:00,519 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3817204301075269 [2024-06-04 17:04:00,519 INFO L175 Difference]: Start difference. First operand has 217 places, 193 transitions, 2382 flow. Second operand 12 states and 142 transitions. [2024-06-04 17:04:00,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 215 transitions, 2976 flow [2024-06-04 17:04:00,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 215 transitions, 2896 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-04 17:04:00,606 INFO L231 Difference]: Finished difference. Result has 221 places, 195 transitions, 2419 flow [2024-06-04 17:04:00,606 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2302, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2419, PETRI_PLACES=221, PETRI_TRANSITIONS=195} [2024-06-04 17:04:00,606 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 191 predicate places. [2024-06-04 17:04:00,606 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 195 transitions, 2419 flow [2024-06-04 17:04:00,607 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-04 17:04:00,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:04:00,607 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:04:00,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-04 17:04:00,607 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-04 17:04:00,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:04:00,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1169332853, now seen corresponding path program 12 times [2024-06-04 17:04:00,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:04:00,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082736167] [2024-06-04 17:04:00,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:04:00,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:04:00,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:04:07,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-04 17:04:07,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:04:07,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082736167] [2024-06-04 17:04:07,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082736167] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:04:07,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:04:07,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:04:07,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396220764] [2024-06-04 17:04:07,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:04:07,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:04:07,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:04:07,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:04:07,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:04:07,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:04:07,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 195 transitions, 2419 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-04 17:04:07,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:04:07,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:04:07,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:04:08,464 INFO L124 PetriNetUnfolderBase]: 517/941 cut-off events. [2024-06-04 17:04:08,464 INFO L125 PetriNetUnfolderBase]: For 34166/34166 co-relation queries the response was YES. [2024-06-04 17:04:08,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6438 conditions, 941 events. 517/941 cut-off events. For 34166/34166 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4798 event pairs, 88 based on Foata normal form. 2/943 useless extension candidates. Maximal degree in co-relation 6340. Up to 790 conditions per place. [2024-06-04 17:04:08,470 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 170 selfloop transitions, 45 changer transitions 0/217 dead transitions. [2024-06-04 17:04:08,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 217 transitions, 3012 flow [2024-06-04 17:04:08,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:04:08,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:04:08,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 145 transitions. [2024-06-04 17:04:08,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3897849462365591 [2024-06-04 17:04:08,472 INFO L175 Difference]: Start difference. First operand has 221 places, 195 transitions, 2419 flow. Second operand 12 states and 145 transitions. [2024-06-04 17:04:08,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 217 transitions, 3012 flow [2024-06-04 17:04:08,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 217 transitions, 2848 flow, removed 8 selfloop flow, removed 12 redundant places. [2024-06-04 17:04:08,557 INFO L231 Difference]: Finished difference. Result has 221 places, 196 transitions, 2368 flow [2024-06-04 17:04:08,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2261, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2368, PETRI_PLACES=221, PETRI_TRANSITIONS=196} [2024-06-04 17:04:08,557 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 191 predicate places. [2024-06-04 17:04:08,557 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 196 transitions, 2368 flow [2024-06-04 17:04:08,557 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-04 17:04:08,557 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:04:08,558 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:04:08,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-04 17:04:08,558 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-04 17:04:08,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:04:08,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1169333008, now seen corresponding path program 6 times [2024-06-04 17:04:08,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:04:08,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672502588] [2024-06-04 17:04:08,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:04:08,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:04:08,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:04:13,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:04:13,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:04:13,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672502588] [2024-06-04 17:04:13,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672502588] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:04:13,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:04:13,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:04:13,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474017256] [2024-06-04 17:04:13,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:04:13,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:04:13,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:04:13,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:04:13,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:04:14,102 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:04:14,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 196 transitions, 2368 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-04 17:04:14,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:04:14,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:04:14,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:04:14,600 INFO L124 PetriNetUnfolderBase]: 523/951 cut-off events. [2024-06-04 17:04:14,600 INFO L125 PetriNetUnfolderBase]: For 35658/35658 co-relation queries the response was YES. [2024-06-04 17:04:14,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6377 conditions, 951 events. 523/951 cut-off events. For 35658/35658 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 4874 event pairs, 91 based on Foata normal form. 2/953 useless extension candidates. Maximal degree in co-relation 6280. Up to 702 conditions per place. [2024-06-04 17:04:14,609 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 157 selfloop transitions, 59 changer transitions 0/218 dead transitions. [2024-06-04 17:04:14,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 218 transitions, 2986 flow [2024-06-04 17:04:14,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:04:14,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:04:14,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-04 17:04:14,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4290322580645161 [2024-06-04 17:04:14,611 INFO L175 Difference]: Start difference. First operand has 221 places, 196 transitions, 2368 flow. Second operand 10 states and 133 transitions. [2024-06-04 17:04:14,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 218 transitions, 2986 flow [2024-06-04 17:04:14,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 218 transitions, 2910 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-04 17:04:14,693 INFO L231 Difference]: Finished difference. Result has 222 places, 198 transitions, 2455 flow [2024-06-04 17:04:14,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2292, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2455, PETRI_PLACES=222, PETRI_TRANSITIONS=198} [2024-06-04 17:04:14,694 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 192 predicate places. [2024-06-04 17:04:14,694 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 198 transitions, 2455 flow [2024-06-04 17:04:14,694 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-04 17:04:14,694 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:04:14,694 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:04:14,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-04 17:04:14,694 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-04 17:04:14,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:04:14,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1169477003, now seen corresponding path program 13 times [2024-06-04 17:04:14,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:04:14,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935094781] [2024-06-04 17:04:14,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:04:14,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:04:14,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:04:22,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:04:22,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:04:22,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935094781] [2024-06-04 17:04:22,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935094781] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:04:22,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:04:22,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:04:22,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117037545] [2024-06-04 17:04:22,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:04:22,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:04:22,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:04:22,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:04:22,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:04:22,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:04:22,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 198 transitions, 2455 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-04 17:04:22,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:04:22,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:04:22,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:04:22,814 INFO L124 PetriNetUnfolderBase]: 527/959 cut-off events. [2024-06-04 17:04:22,815 INFO L125 PetriNetUnfolderBase]: For 37197/37197 co-relation queries the response was YES. [2024-06-04 17:04:22,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6502 conditions, 959 events. 527/959 cut-off events. For 37197/37197 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 4915 event pairs, 93 based on Foata normal form. 2/961 useless extension candidates. Maximal degree in co-relation 6404. Up to 869 conditions per place. [2024-06-04 17:04:22,823 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 182 selfloop transitions, 31 changer transitions 0/215 dead transitions. [2024-06-04 17:04:22,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 215 transitions, 2934 flow [2024-06-04 17:04:22,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:04:22,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:04:22,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 135 transitions. [2024-06-04 17:04:22,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3629032258064516 [2024-06-04 17:04:22,825 INFO L175 Difference]: Start difference. First operand has 222 places, 198 transitions, 2455 flow. Second operand 12 states and 135 transitions. [2024-06-04 17:04:22,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 215 transitions, 2934 flow [2024-06-04 17:04:22,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 215 transitions, 2771 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-04 17:04:22,916 INFO L231 Difference]: Finished difference. Result has 226 places, 199 transitions, 2373 flow [2024-06-04 17:04:22,916 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2292, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2373, PETRI_PLACES=226, PETRI_TRANSITIONS=199} [2024-06-04 17:04:22,916 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 196 predicate places. [2024-06-04 17:04:22,916 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 199 transitions, 2373 flow [2024-06-04 17:04:22,916 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-04 17:04:22,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:04:22,916 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:04:22,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-04 17:04:22,917 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-04 17:04:22,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:04:22,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1007483802, now seen corresponding path program 1 times [2024-06-04 17:04:22,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:04:22,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984355447] [2024-06-04 17:04:22,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:04:22,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:04:22,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:04:29,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:04:29,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:04:29,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984355447] [2024-06-04 17:04:29,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984355447] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:04:29,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:04:29,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:04:29,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765030444] [2024-06-04 17:04:29,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:04:29,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:04:29,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:04:29,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:04:29,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:04:29,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:04:29,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 199 transitions, 2373 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-04 17:04:29,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:04:29,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:04:29,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:04:29,998 INFO L124 PetriNetUnfolderBase]: 535/975 cut-off events. [2024-06-04 17:04:29,998 INFO L125 PetriNetUnfolderBase]: For 40881/40881 co-relation queries the response was YES. [2024-06-04 17:04:30,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6458 conditions, 975 events. 535/975 cut-off events. For 40881/40881 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 5027 event pairs, 93 based on Foata normal form. 4/979 useless extension candidates. Maximal degree in co-relation 6359. Up to 767 conditions per place. [2024-06-04 17:04:30,008 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 166 selfloop transitions, 49 changer transitions 0/217 dead transitions. [2024-06-04 17:04:30,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 217 transitions, 2861 flow [2024-06-04 17:04:30,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:04:30,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:04:30,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-04 17:04:30,009 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4032258064516129 [2024-06-04 17:04:30,009 INFO L175 Difference]: Start difference. First operand has 226 places, 199 transitions, 2373 flow. Second operand 10 states and 125 transitions. [2024-06-04 17:04:30,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 217 transitions, 2861 flow [2024-06-04 17:04:30,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 217 transitions, 2795 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-04 17:04:30,103 INFO L231 Difference]: Finished difference. Result has 226 places, 201 transitions, 2434 flow [2024-06-04 17:04:30,103 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2307, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2434, PETRI_PLACES=226, PETRI_TRANSITIONS=201} [2024-06-04 17:04:30,103 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 196 predicate places. [2024-06-04 17:04:30,103 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 201 transitions, 2434 flow [2024-06-04 17:04:30,103 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-04 17:04:30,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:04:30,103 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:04:30,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-04 17:04:30,104 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-04 17:04:30,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:04:30,104 INFO L85 PathProgramCache]: Analyzing trace with hash -577348138, now seen corresponding path program 7 times [2024-06-04 17:04:30,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:04:30,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445124795] [2024-06-04 17:04:30,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:04:30,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:04:30,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:04:35,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:04:35,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:04:35,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445124795] [2024-06-04 17:04:35,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445124795] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:04:35,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:04:35,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:04:35,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783113821] [2024-06-04 17:04:35,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:04:35,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:04:35,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:04:35,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:04:35,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:04:35,845 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:04:35,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 201 transitions, 2434 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-04 17:04:35,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:04:35,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:04:35,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:04:36,471 INFO L124 PetriNetUnfolderBase]: 547/996 cut-off events. [2024-06-04 17:04:36,471 INFO L125 PetriNetUnfolderBase]: For 40034/40034 co-relation queries the response was YES. [2024-06-04 17:04:36,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6673 conditions, 996 events. 547/996 cut-off events. For 40034/40034 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5161 event pairs, 90 based on Foata normal form. 2/998 useless extension candidates. Maximal degree in co-relation 6573. Up to 787 conditions per place. [2024-06-04 17:04:36,480 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 172 selfloop transitions, 52 changer transitions 0/226 dead transitions. [2024-06-04 17:04:36,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 226 transitions, 2984 flow [2024-06-04 17:04:36,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-04 17:04:36,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-04 17:04:36,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 154 transitions. [2024-06-04 17:04:36,488 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38213399503722084 [2024-06-04 17:04:36,488 INFO L175 Difference]: Start difference. First operand has 226 places, 201 transitions, 2434 flow. Second operand 13 states and 154 transitions. [2024-06-04 17:04:36,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 226 transitions, 2984 flow [2024-06-04 17:04:36,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 226 transitions, 2869 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-04 17:04:36,584 INFO L231 Difference]: Finished difference. Result has 231 places, 205 transitions, 2486 flow [2024-06-04 17:04:36,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2323, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2486, PETRI_PLACES=231, PETRI_TRANSITIONS=205} [2024-06-04 17:04:36,584 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 201 predicate places. [2024-06-04 17:04:36,584 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 205 transitions, 2486 flow [2024-06-04 17:04:36,584 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-04 17:04:36,585 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:04:36,585 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:04:36,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-04 17:04:36,585 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-04 17:04:36,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:04:36,585 INFO L85 PathProgramCache]: Analyzing trace with hash -763710838, now seen corresponding path program 8 times [2024-06-04 17:04:36,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:04:36,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115665160] [2024-06-04 17:04:36,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:04:36,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:04:36,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:04:42,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:04:42,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:04:42,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115665160] [2024-06-04 17:04:42,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115665160] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:04:42,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:04:42,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:04:42,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961762380] [2024-06-04 17:04:42,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:04:42,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:04:42,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:04:42,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:04:42,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:04:42,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:04:42,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 205 transitions, 2486 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-04 17:04:42,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:04:42,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:04:42,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:04:43,246 INFO L124 PetriNetUnfolderBase]: 553/1005 cut-off events. [2024-06-04 17:04:43,246 INFO L125 PetriNetUnfolderBase]: For 41595/41595 co-relation queries the response was YES. [2024-06-04 17:04:43,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6758 conditions, 1005 events. 553/1005 cut-off events. For 41595/41595 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 5225 event pairs, 92 based on Foata normal form. 2/1007 useless extension candidates. Maximal degree in co-relation 6657. Up to 788 conditions per place. [2024-06-04 17:04:43,255 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 171 selfloop transitions, 53 changer transitions 0/226 dead transitions. [2024-06-04 17:04:43,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 226 transitions, 3016 flow [2024-06-04 17:04:43,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:04:43,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:04:43,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 131 transitions. [2024-06-04 17:04:43,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42258064516129035 [2024-06-04 17:04:43,256 INFO L175 Difference]: Start difference. First operand has 231 places, 205 transitions, 2486 flow. Second operand 10 states and 131 transitions. [2024-06-04 17:04:43,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 226 transitions, 3016 flow [2024-06-04 17:04:43,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 226 transitions, 2898 flow, removed 8 selfloop flow, removed 10 redundant places. [2024-06-04 17:04:43,362 INFO L231 Difference]: Finished difference. Result has 231 places, 207 transitions, 2519 flow [2024-06-04 17:04:43,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2368, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2519, PETRI_PLACES=231, PETRI_TRANSITIONS=207} [2024-06-04 17:04:43,362 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 201 predicate places. [2024-06-04 17:04:43,362 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 207 transitions, 2519 flow [2024-06-04 17:04:43,363 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-04 17:04:43,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:04:43,363 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:04:43,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-04 17:04:43,363 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-04 17:04:43,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:04:43,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1174845118, now seen corresponding path program 9 times [2024-06-04 17:04:43,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:04:43,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409152436] [2024-06-04 17:04:43,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:04:43,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:04:43,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:04:48,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:04:48,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:04:48,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409152436] [2024-06-04 17:04:48,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409152436] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:04:48,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:04:48,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:04:48,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453985693] [2024-06-04 17:04:48,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:04:48,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:04:48,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:04:48,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:04:48,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:04:49,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:04:49,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 207 transitions, 2519 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-04 17:04:49,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:04:49,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:04:49,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:04:49,632 INFO L124 PetriNetUnfolderBase]: 549/1000 cut-off events. [2024-06-04 17:04:49,632 INFO L125 PetriNetUnfolderBase]: For 40201/40201 co-relation queries the response was YES. [2024-06-04 17:04:49,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6638 conditions, 1000 events. 549/1000 cut-off events. For 40201/40201 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 5197 event pairs, 89 based on Foata normal form. 2/1002 useless extension candidates. Maximal degree in co-relation 6536. Up to 791 conditions per place. [2024-06-04 17:04:49,641 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 173 selfloop transitions, 51 changer transitions 0/226 dead transitions. [2024-06-04 17:04:49,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 226 transitions, 3011 flow [2024-06-04 17:04:49,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:04:49,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:04:49,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2024-06-04 17:04:49,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4046920821114369 [2024-06-04 17:04:49,642 INFO L175 Difference]: Start difference. First operand has 231 places, 207 transitions, 2519 flow. Second operand 11 states and 138 transitions. [2024-06-04 17:04:49,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 226 transitions, 3011 flow [2024-06-04 17:04:49,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 226 transitions, 2880 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-04 17:04:49,740 INFO L231 Difference]: Finished difference. Result has 235 places, 207 transitions, 2495 flow [2024-06-04 17:04:49,740 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2388, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2495, PETRI_PLACES=235, PETRI_TRANSITIONS=207} [2024-06-04 17:04:49,741 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 205 predicate places. [2024-06-04 17:04:49,741 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 207 transitions, 2495 flow [2024-06-04 17:04:49,741 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-04 17:04:49,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:04:49,741 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:04:49,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-04 17:04:49,741 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-04 17:04:49,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:04:49,742 INFO L85 PathProgramCache]: Analyzing trace with hash -493553904, now seen corresponding path program 10 times [2024-06-04 17:04:49,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:04:49,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104070045] [2024-06-04 17:04:49,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:04:49,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:04:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:04:55,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:04:55,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:04:55,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104070045] [2024-06-04 17:04:55,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104070045] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:04:55,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:04:55,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:04:55,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945728569] [2024-06-04 17:04:55,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:04:55,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:04:55,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:04:55,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:04:55,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:04:55,399 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:04:55,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 207 transitions, 2495 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-04 17:04:55,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:04:55,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:04:55,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:04:56,017 INFO L124 PetriNetUnfolderBase]: 545/994 cut-off events. [2024-06-04 17:04:56,017 INFO L125 PetriNetUnfolderBase]: For 38473/38473 co-relation queries the response was YES. [2024-06-04 17:04:56,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6471 conditions, 994 events. 545/994 cut-off events. For 38473/38473 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 5179 event pairs, 88 based on Foata normal form. 2/996 useless extension candidates. Maximal degree in co-relation 6368. Up to 768 conditions per place. [2024-06-04 17:04:56,026 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 168 selfloop transitions, 56 changer transitions 0/226 dead transitions. [2024-06-04 17:04:56,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 226 transitions, 2987 flow [2024-06-04 17:04:56,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:04:56,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:04:56,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 139 transitions. [2024-06-04 17:04:56,027 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40762463343108507 [2024-06-04 17:04:56,027 INFO L175 Difference]: Start difference. First operand has 235 places, 207 transitions, 2495 flow. Second operand 11 states and 139 transitions. [2024-06-04 17:04:56,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 226 transitions, 2987 flow [2024-06-04 17:04:56,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 226 transitions, 2843 flow, removed 13 selfloop flow, removed 10 redundant places. [2024-06-04 17:04:56,120 INFO L231 Difference]: Finished difference. Result has 236 places, 207 transitions, 2468 flow [2024-06-04 17:04:56,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2351, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2468, PETRI_PLACES=236, PETRI_TRANSITIONS=207} [2024-06-04 17:04:56,120 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 206 predicate places. [2024-06-04 17:04:56,120 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 207 transitions, 2468 flow [2024-06-04 17:04:56,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-04 17:04:56,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:04:56,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-04 17:04:56,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-04 17:04:56,121 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-04 17:04:56,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:04:56,121 INFO L85 PathProgramCache]: Analyzing trace with hash -493554059, now seen corresponding path program 14 times [2024-06-04 17:04:56,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:04:56,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949841110] [2024-06-04 17:04:56,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:04:56,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:04:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:05:03,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:05:03,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:05:03,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949841110] [2024-06-04 17:05:03,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949841110] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:05:03,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:05:03,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:05:03,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300962700] [2024-06-04 17:05:03,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:05:03,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:05:03,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:05:03,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:05:03,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:05:03,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:05:03,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 207 transitions, 2468 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-04 17:05:03,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:05:03,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:05:03,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:05:03,928 INFO L124 PetriNetUnfolderBase]: 542/989 cut-off events. [2024-06-04 17:05:03,928 INFO L125 PetriNetUnfolderBase]: For 36474/36474 co-relation queries the response was YES. [2024-06-04 17:05:03,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6323 conditions, 989 events. 542/989 cut-off events. For 36474/36474 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 5147 event pairs, 95 based on Foata normal form. 2/991 useless extension candidates. Maximal degree in co-relation 6219. Up to 898 conditions per place. [2024-06-04 17:05:03,936 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 188 selfloop transitions, 32 changer transitions 0/222 dead transitions. [2024-06-04 17:05:03,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 222 transitions, 2944 flow [2024-06-04 17:05:03,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:05:03,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:05:03,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 134 transitions. [2024-06-04 17:05:03,937 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3602150537634409 [2024-06-04 17:05:03,937 INFO L175 Difference]: Start difference. First operand has 236 places, 207 transitions, 2468 flow. Second operand 12 states and 134 transitions. [2024-06-04 17:05:03,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 222 transitions, 2944 flow [2024-06-04 17:05:04,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 222 transitions, 2798 flow, removed 8 selfloop flow, removed 10 redundant places. [2024-06-04 17:05:04,031 INFO L231 Difference]: Finished difference. Result has 238 places, 207 transitions, 2390 flow [2024-06-04 17:05:04,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2322, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2390, PETRI_PLACES=238, PETRI_TRANSITIONS=207} [2024-06-04 17:05:04,032 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 208 predicate places. [2024-06-04 17:05:04,032 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 207 transitions, 2390 flow [2024-06-04 17:05:04,032 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-04 17:05:04,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:05:04,032 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:05:04,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-04 17:05:04,032 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-04 17:05:04,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:05:04,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1868421353, now seen corresponding path program 15 times [2024-06-04 17:05:04,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:05:04,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587818447] [2024-06-04 17:05:04,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:05:04,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:05:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:05:09,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:05:09,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:05:09,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587818447] [2024-06-04 17:05:09,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587818447] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:05:09,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:05:09,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:05:09,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392910710] [2024-06-04 17:05:09,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:05:09,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:05:09,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:05:09,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:05:09,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:05:10,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:05:10,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 207 transitions, 2390 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-04 17:05:10,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:05:10,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:05:10,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:05:10,456 INFO L124 PetriNetUnfolderBase]: 546/997 cut-off events. [2024-06-04 17:05:10,456 INFO L125 PetriNetUnfolderBase]: For 37413/37413 co-relation queries the response was YES. [2024-06-04 17:05:10,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6255 conditions, 997 events. 546/997 cut-off events. For 37413/37413 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 5214 event pairs, 53 based on Foata normal form. 2/999 useless extension candidates. Maximal degree in co-relation 6150. Up to 528 conditions per place. [2024-06-04 17:05:10,465 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 128 selfloop transitions, 95 changer transitions 0/225 dead transitions. [2024-06-04 17:05:10,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 225 transitions, 2995 flow [2024-06-04 17:05:10,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:05:10,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:05:10,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2024-06-04 17:05:10,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3774193548387097 [2024-06-04 17:05:10,466 INFO L175 Difference]: Start difference. First operand has 238 places, 207 transitions, 2390 flow. Second operand 10 states and 117 transitions. [2024-06-04 17:05:10,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 225 transitions, 2995 flow [2024-06-04 17:05:10,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 225 transitions, 2929 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-04 17:05:10,569 INFO L231 Difference]: Finished difference. Result has 238 places, 208 transitions, 2531 flow [2024-06-04 17:05:10,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2324, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2531, PETRI_PLACES=238, PETRI_TRANSITIONS=208} [2024-06-04 17:05:10,569 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 208 predicate places. [2024-06-04 17:05:10,569 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 208 transitions, 2531 flow [2024-06-04 17:05:10,570 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-04 17:05:10,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:05:10,570 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:05:10,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-04 17:05:10,570 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-04 17:05:10,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:05:10,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1866543528, now seen corresponding path program 11 times [2024-06-04 17:05:10,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:05:10,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611071858] [2024-06-04 17:05:10,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:05:10,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:05:10,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:05:16,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:05:16,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:05:16,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611071858] [2024-06-04 17:05:16,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611071858] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:05:16,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:05:16,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:05:16,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986017964] [2024-06-04 17:05:16,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:05:16,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:05:16,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:05:16,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:05:16,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:05:16,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:05:16,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 208 transitions, 2531 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-04 17:05:16,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:05:16,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:05:16,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:05:16,659 INFO L124 PetriNetUnfolderBase]: 562/1023 cut-off events. [2024-06-04 17:05:16,660 INFO L125 PetriNetUnfolderBase]: For 42329/42329 co-relation queries the response was YES. [2024-06-04 17:05:16,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6754 conditions, 1023 events. 562/1023 cut-off events. For 42329/42329 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 5322 event pairs, 85 based on Foata normal form. 2/1025 useless extension candidates. Maximal degree in co-relation 6648. Up to 612 conditions per place. [2024-06-04 17:05:16,668 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 124 selfloop transitions, 102 changer transitions 0/228 dead transitions. [2024-06-04 17:05:16,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 228 transitions, 3207 flow [2024-06-04 17:05:16,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:05:16,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:05:16,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions. [2024-06-04 17:05:16,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121863799283154 [2024-06-04 17:05:16,669 INFO L175 Difference]: Start difference. First operand has 238 places, 208 transitions, 2531 flow. Second operand 9 states and 115 transitions. [2024-06-04 17:05:16,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 228 transitions, 3207 flow [2024-06-04 17:05:16,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 228 transitions, 3050 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-06-04 17:05:16,765 INFO L231 Difference]: Finished difference. Result has 238 places, 212 transitions, 2669 flow [2024-06-04 17:05:16,766 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2378, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2669, PETRI_PLACES=238, PETRI_TRANSITIONS=212} [2024-06-04 17:05:16,766 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 208 predicate places. [2024-06-04 17:05:16,766 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 212 transitions, 2669 flow [2024-06-04 17:05:16,766 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-04 17:05:16,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:05:16,766 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:05:16,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-04 17:05:16,766 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-04 17:05:16,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:05:16,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1866543683, now seen corresponding path program 16 times [2024-06-04 17:05:16,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:05:16,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035234405] [2024-06-04 17:05:16,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:05:16,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:05:16,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:05:22,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:05:22,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:05:22,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035234405] [2024-06-04 17:05:22,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035234405] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:05:22,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:05:22,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:05:22,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174454565] [2024-06-04 17:05:22,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:05:22,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:05:22,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:05:22,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:05:22,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:05:22,517 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:05:22,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 212 transitions, 2669 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-04 17:05:22,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:05:22,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:05:22,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:05:22,919 INFO L124 PetriNetUnfolderBase]: 566/1031 cut-off events. [2024-06-04 17:05:22,920 INFO L125 PetriNetUnfolderBase]: For 41296/41296 co-relation queries the response was YES. [2024-06-04 17:05:22,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6862 conditions, 1031 events. 566/1031 cut-off events. For 41296/41296 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5409 event pairs, 90 based on Foata normal form. 2/1033 useless extension candidates. Maximal degree in co-relation 6757. Up to 816 conditions per place. [2024-06-04 17:05:22,929 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 145 selfloop transitions, 80 changer transitions 0/227 dead transitions. [2024-06-04 17:05:22,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 227 transitions, 3161 flow [2024-06-04 17:05:22,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:05:22,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:05:22,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2024-06-04 17:05:22,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3774193548387097 [2024-06-04 17:05:22,930 INFO L175 Difference]: Start difference. First operand has 238 places, 212 transitions, 2669 flow. Second operand 10 states and 117 transitions. [2024-06-04 17:05:22,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 227 transitions, 3161 flow [2024-06-04 17:05:23,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 227 transitions, 3052 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-06-04 17:05:23,030 INFO L231 Difference]: Finished difference. Result has 242 places, 213 transitions, 2738 flow [2024-06-04 17:05:23,030 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2560, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2738, PETRI_PLACES=242, PETRI_TRANSITIONS=213} [2024-06-04 17:05:23,030 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 212 predicate places. [2024-06-04 17:05:23,030 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 213 transitions, 2738 flow [2024-06-04 17:05:23,031 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-04 17:05:23,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:05:23,031 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:05:23,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-04 17:05:23,031 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-04 17:05:23,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:05:23,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1866547403, now seen corresponding path program 17 times [2024-06-04 17:05:23,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:05:23,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631283216] [2024-06-04 17:05:23,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:05:23,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:05:23,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:05:28,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:05:28,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:05:28,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631283216] [2024-06-04 17:05:28,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631283216] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:05:28,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:05:28,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:05:28,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231312388] [2024-06-04 17:05:28,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:05:28,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:05:28,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:05:28,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:05:28,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:05:28,864 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:05:28,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 213 transitions, 2738 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-04 17:05:28,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:05:28,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:05:28,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:05:29,264 INFO L124 PetriNetUnfolderBase]: 570/1039 cut-off events. [2024-06-04 17:05:29,264 INFO L125 PetriNetUnfolderBase]: For 40783/40783 co-relation queries the response was YES. [2024-06-04 17:05:29,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6948 conditions, 1039 events. 570/1039 cut-off events. For 40783/40783 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 5457 event pairs, 84 based on Foata normal form. 2/1041 useless extension candidates. Maximal degree in co-relation 6842. Up to 782 conditions per place. [2024-06-04 17:05:29,273 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 144 selfloop transitions, 83 changer transitions 0/229 dead transitions. [2024-06-04 17:05:29,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 229 transitions, 3238 flow [2024-06-04 17:05:29,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:05:29,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:05:29,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2024-06-04 17:05:29,274 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38387096774193546 [2024-06-04 17:05:29,274 INFO L175 Difference]: Start difference. First operand has 242 places, 213 transitions, 2738 flow. Second operand 10 states and 119 transitions. [2024-06-04 17:05:29,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 229 transitions, 3238 flow [2024-06-04 17:05:29,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 229 transitions, 3074 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-04 17:05:29,378 INFO L231 Difference]: Finished difference. Result has 242 places, 214 transitions, 2760 flow [2024-06-04 17:05:29,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2574, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2760, PETRI_PLACES=242, PETRI_TRANSITIONS=214} [2024-06-04 17:05:29,378 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 212 predicate places. [2024-06-04 17:05:29,378 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 214 transitions, 2760 flow [2024-06-04 17:05:29,378 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-04 17:05:29,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:05:29,379 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:05:29,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-04 17:05:29,379 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-04 17:05:29,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:05:29,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1102680282, now seen corresponding path program 12 times [2024-06-04 17:05:29,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:05:29,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102934864] [2024-06-04 17:05:29,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:05:29,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:05:29,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:05:34,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:05:34,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:05:34,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102934864] [2024-06-04 17:05:34,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102934864] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:05:34,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:05:34,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:05:34,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450690823] [2024-06-04 17:05:34,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:05:34,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:05:34,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:05:34,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:05:34,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:05:34,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:05:34,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 214 transitions, 2760 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-04 17:05:34,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:05:34,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:05:34,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:05:35,349 INFO L124 PetriNetUnfolderBase]: 576/1049 cut-off events. [2024-06-04 17:05:35,349 INFO L125 PetriNetUnfolderBase]: For 40108/40108 co-relation queries the response was YES. [2024-06-04 17:05:35,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7027 conditions, 1049 events. 576/1049 cut-off events. For 40108/40108 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 5541 event pairs, 95 based on Foata normal form. 2/1051 useless extension candidates. Maximal degree in co-relation 6922. Up to 840 conditions per place. [2024-06-04 17:05:35,359 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 170 selfloop transitions, 57 changer transitions 0/229 dead transitions. [2024-06-04 17:05:35,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 229 transitions, 3282 flow [2024-06-04 17:05:35,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:05:35,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:05:35,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-04 17:05:35,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3978494623655914 [2024-06-04 17:05:35,359 INFO L175 Difference]: Start difference. First operand has 242 places, 214 transitions, 2760 flow. Second operand 9 states and 111 transitions. [2024-06-04 17:05:35,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 229 transitions, 3282 flow [2024-06-04 17:05:35,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 229 transitions, 3110 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-04 17:05:35,471 INFO L231 Difference]: Finished difference. Result has 241 places, 216 transitions, 2749 flow [2024-06-04 17:05:35,471 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2588, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2749, PETRI_PLACES=241, PETRI_TRANSITIONS=216} [2024-06-04 17:05:35,471 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 211 predicate places. [2024-06-04 17:05:35,471 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 216 transitions, 2749 flow [2024-06-04 17:05:35,472 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-04 17:05:35,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:05:35,472 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:05:35,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-04 17:05:35,472 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-04 17:05:35,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:05:35,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1779707568, now seen corresponding path program 13 times [2024-06-04 17:05:35,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:05:35,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972978242] [2024-06-04 17:05:35,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:05:35,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:05:35,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:05:40,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:05:40,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:05:40,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972978242] [2024-06-04 17:05:40,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972978242] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:05:40,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:05:40,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:05:40,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822418826] [2024-06-04 17:05:40,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:05:40,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:05:40,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:05:40,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:05:40,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:05:40,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:05:40,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 216 transitions, 2749 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-04 17:05:40,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:05:40,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:05:40,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:05:41,228 INFO L124 PetriNetUnfolderBase]: 582/1059 cut-off events. [2024-06-04 17:05:41,228 INFO L125 PetriNetUnfolderBase]: For 38886/38886 co-relation queries the response was YES. [2024-06-04 17:05:41,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7045 conditions, 1059 events. 582/1059 cut-off events. For 38886/38886 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 5568 event pairs, 91 based on Foata normal form. 2/1061 useless extension candidates. Maximal degree in co-relation 6941. Up to 810 conditions per place. [2024-06-04 17:05:41,238 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 164 selfloop transitions, 67 changer transitions 0/233 dead transitions. [2024-06-04 17:05:41,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 233 transitions, 3287 flow [2024-06-04 17:05:41,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:05:41,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:05:41,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions. [2024-06-04 17:05:41,240 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121863799283154 [2024-06-04 17:05:41,240 INFO L175 Difference]: Start difference. First operand has 241 places, 216 transitions, 2749 flow. Second operand 9 states and 115 transitions. [2024-06-04 17:05:41,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 233 transitions, 3287 flow [2024-06-04 17:05:41,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 233 transitions, 3130 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-04 17:05:41,352 INFO L231 Difference]: Finished difference. Result has 242 places, 218 transitions, 2780 flow [2024-06-04 17:05:41,352 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2592, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2780, PETRI_PLACES=242, PETRI_TRANSITIONS=218} [2024-06-04 17:05:41,352 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 212 predicate places. [2024-06-04 17:05:41,352 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 218 transitions, 2780 flow [2024-06-04 17:05:41,352 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-04 17:05:41,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:05:41,352 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:05:41,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-04 17:05:41,353 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-04 17:05:41,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:05:41,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1779707723, now seen corresponding path program 18 times [2024-06-04 17:05:41,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:05:41,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183952364] [2024-06-04 17:05:41,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:05:41,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:05:41,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:05:47,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:05:47,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:05:47,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183952364] [2024-06-04 17:05:47,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183952364] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:05:47,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:05:47,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:05:47,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201567017] [2024-06-04 17:05:47,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:05:47,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:05:47,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:05:47,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:05:47,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:05:47,357 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:05:47,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 218 transitions, 2780 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-04 17:05:47,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:05:47,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:05:47,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:05:47,751 INFO L124 PetriNetUnfolderBase]: 586/1067 cut-off events. [2024-06-04 17:05:47,752 INFO L125 PetriNetUnfolderBase]: For 40242/40242 co-relation queries the response was YES. [2024-06-04 17:05:47,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7078 conditions, 1067 events. 586/1067 cut-off events. For 40242/40242 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 5642 event pairs, 104 based on Foata normal form. 2/1069 useless extension candidates. Maximal degree in co-relation 6974. Up to 940 conditions per place. [2024-06-04 17:05:47,761 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 180 selfloop transitions, 49 changer transitions 0/231 dead transitions. [2024-06-04 17:05:47,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 231 transitions, 3278 flow [2024-06-04 17:05:47,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:05:47,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:05:47,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2024-06-04 17:05:47,762 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36774193548387096 [2024-06-04 17:05:47,762 INFO L175 Difference]: Start difference. First operand has 242 places, 218 transitions, 2780 flow. Second operand 10 states and 114 transitions. [2024-06-04 17:05:47,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 231 transitions, 3278 flow [2024-06-04 17:05:47,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 231 transitions, 3115 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-06-04 17:05:47,868 INFO L231 Difference]: Finished difference. Result has 244 places, 219 transitions, 2735 flow [2024-06-04 17:05:47,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2617, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2735, PETRI_PLACES=244, PETRI_TRANSITIONS=219} [2024-06-04 17:05:47,868 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 214 predicate places. [2024-06-04 17:05:47,868 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 219 transitions, 2735 flow [2024-06-04 17:05:47,868 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-04 17:05:47,868 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:05:47,868 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:05:47,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-04 17:05:47,869 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-04 17:05:47,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:05:47,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1779851718, now seen corresponding path program 14 times [2024-06-04 17:05:47,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:05:47,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185781162] [2024-06-04 17:05:47,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:05:47,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:05:47,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:05:53,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-04 17:05:53,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:05:53,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185781162] [2024-06-04 17:05:53,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185781162] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:05:53,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:05:53,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:05:53,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078450947] [2024-06-04 17:05:53,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:05:53,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:05:53,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:05:53,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:05:53,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:05:53,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:05:53,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 219 transitions, 2735 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-04 17:05:53,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:05:53,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:05:53,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:05:54,043 INFO L124 PetriNetUnfolderBase]: 592/1077 cut-off events. [2024-06-04 17:05:54,044 INFO L125 PetriNetUnfolderBase]: For 40126/40126 co-relation queries the response was YES. [2024-06-04 17:05:54,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7066 conditions, 1077 events. 592/1077 cut-off events. For 40126/40126 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 5699 event pairs, 89 based on Foata normal form. 2/1079 useless extension candidates. Maximal degree in co-relation 6962. Up to 804 conditions per place. [2024-06-04 17:05:54,053 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 159 selfloop transitions, 75 changer transitions 0/236 dead transitions. [2024-06-04 17:05:54,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 236 transitions, 3283 flow [2024-06-04 17:05:54,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:05:54,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:05:54,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-04 17:05:54,055 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4157706093189964 [2024-06-04 17:05:54,055 INFO L175 Difference]: Start difference. First operand has 244 places, 219 transitions, 2735 flow. Second operand 9 states and 116 transitions. [2024-06-04 17:05:54,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 236 transitions, 3283 flow [2024-06-04 17:05:54,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 236 transitions, 3179 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-04 17:05:54,166 INFO L231 Difference]: Finished difference. Result has 244 places, 221 transitions, 2839 flow [2024-06-04 17:05:54,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2631, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2839, PETRI_PLACES=244, PETRI_TRANSITIONS=221} [2024-06-04 17:05:54,166 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 214 predicate places. [2024-06-04 17:05:54,166 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 221 transitions, 2839 flow [2024-06-04 17:05:54,166 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-04 17:05:54,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:05:54,166 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:05:54,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-04 17:05:54,166 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-04 17:05:54,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:05:54,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1779851873, now seen corresponding path program 19 times [2024-06-04 17:05:54,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:05:54,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598640329] [2024-06-04 17:05:54,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:05:54,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:05:54,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:05:59,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:05:59,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:05:59,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598640329] [2024-06-04 17:05:59,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598640329] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:05:59,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:05:59,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:05:59,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412541001] [2024-06-04 17:05:59,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:05:59,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:05:59,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:05:59,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:05:59,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:06:00,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:06:00,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 221 transitions, 2839 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-04 17:06:00,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:06:00,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:06:00,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:06:00,417 INFO L124 PetriNetUnfolderBase]: 596/1085 cut-off events. [2024-06-04 17:06:00,417 INFO L125 PetriNetUnfolderBase]: For 40475/40475 co-relation queries the response was YES. [2024-06-04 17:06:00,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7189 conditions, 1085 events. 596/1085 cut-off events. For 40475/40475 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 5748 event pairs, 106 based on Foata normal form. 2/1087 useless extension candidates. Maximal degree in co-relation 7085. Up to 946 conditions per place. [2024-06-04 17:06:00,428 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 177 selfloop transitions, 55 changer transitions 0/234 dead transitions. [2024-06-04 17:06:00,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 234 transitions, 3345 flow [2024-06-04 17:06:00,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:06:00,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:06:00,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-04 17:06:00,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3709677419354839 [2024-06-04 17:06:00,429 INFO L175 Difference]: Start difference. First operand has 244 places, 221 transitions, 2839 flow. Second operand 10 states and 115 transitions. [2024-06-04 17:06:00,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 234 transitions, 3345 flow [2024-06-04 17:06:00,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 234 transitions, 3162 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-06-04 17:06:00,543 INFO L231 Difference]: Finished difference. Result has 246 places, 222 transitions, 2788 flow [2024-06-04 17:06:00,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2656, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2788, PETRI_PLACES=246, PETRI_TRANSITIONS=222} [2024-06-04 17:06:00,544 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 216 predicate places. [2024-06-04 17:06:00,544 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 222 transitions, 2788 flow [2024-06-04 17:06:00,544 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-04 17:06:00,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:06:00,544 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:06:00,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-04 17:06:00,544 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-04 17:06:00,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:06:00,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1779855593, now seen corresponding path program 20 times [2024-06-04 17:06:00,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:06:00,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561560533] [2024-06-04 17:06:00,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:06:00,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:06:00,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:06:06,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:06:06,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:06:06,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561560533] [2024-06-04 17:06:06,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561560533] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:06:06,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:06:06,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:06:06,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462448196] [2024-06-04 17:06:06,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:06:06,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:06:06,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:06:06,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:06:06,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:06:06,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:06:06,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 222 transitions, 2788 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-04 17:06:06,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:06:06,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:06:06,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:06:06,807 INFO L124 PetriNetUnfolderBase]: 600/1093 cut-off events. [2024-06-04 17:06:06,807 INFO L125 PetriNetUnfolderBase]: For 40023/40023 co-relation queries the response was YES. [2024-06-04 17:06:06,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7119 conditions, 1093 events. 600/1093 cut-off events. For 40023/40023 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 5826 event pairs, 104 based on Foata normal form. 2/1095 useless extension candidates. Maximal degree in co-relation 7015. Up to 914 conditions per place. [2024-06-04 17:06:06,816 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 175 selfloop transitions, 59 changer transitions 0/236 dead transitions. [2024-06-04 17:06:06,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 236 transitions, 3302 flow [2024-06-04 17:06:06,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:06:06,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:06:06,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2024-06-04 17:06:06,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3741935483870968 [2024-06-04 17:06:06,817 INFO L175 Difference]: Start difference. First operand has 246 places, 222 transitions, 2788 flow. Second operand 10 states and 116 transitions. [2024-06-04 17:06:06,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 236 transitions, 3302 flow [2024-06-04 17:06:06,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 236 transitions, 3184 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-06-04 17:06:06,926 INFO L231 Difference]: Finished difference. Result has 247 places, 223 transitions, 2812 flow [2024-06-04 17:06:06,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2670, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2812, PETRI_PLACES=247, PETRI_TRANSITIONS=223} [2024-06-04 17:06:06,927 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 217 predicate places. [2024-06-04 17:06:06,927 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 223 transitions, 2812 flow [2024-06-04 17:06:06,927 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-04 17:06:06,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:06:06,927 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:06:06,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-04 17:06:06,927 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-04 17:06:06,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:06:06,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1794170677, now seen corresponding path program 21 times [2024-06-04 17:06:06,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:06:06,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236644009] [2024-06-04 17:06:06,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:06:06,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:06:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:06:12,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:06:12,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:06:12,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236644009] [2024-06-04 17:06:12,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236644009] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:06:12,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:06:12,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:06:12,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646713638] [2024-06-04 17:06:12,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:06:12,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:06:12,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:06:12,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:06:12,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:06:12,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:06:12,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 223 transitions, 2812 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-04 17:06:12,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:06:12,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:06:12,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:06:13,224 INFO L124 PetriNetUnfolderBase]: 604/1100 cut-off events. [2024-06-04 17:06:13,224 INFO L125 PetriNetUnfolderBase]: For 40079/40079 co-relation queries the response was YES. [2024-06-04 17:06:13,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7180 conditions, 1100 events. 604/1100 cut-off events. For 40079/40079 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 5883 event pairs, 62 based on Foata normal form. 2/1102 useless extension candidates. Maximal degree in co-relation 7076. Up to 826 conditions per place. [2024-06-04 17:06:13,235 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 161 selfloop transitions, 80 changer transitions 0/243 dead transitions. [2024-06-04 17:06:13,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 243 transitions, 3478 flow [2024-06-04 17:06:13,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:06:13,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:06:13,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-04 17:06:13,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-04 17:06:13,237 INFO L175 Difference]: Start difference. First operand has 247 places, 223 transitions, 2812 flow. Second operand 10 states and 124 transitions. [2024-06-04 17:06:13,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 243 transitions, 3478 flow [2024-06-04 17:06:13,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 243 transitions, 3348 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-04 17:06:13,348 INFO L231 Difference]: Finished difference. Result has 248 places, 224 transitions, 2868 flow [2024-06-04 17:06:13,348 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2684, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2868, PETRI_PLACES=248, PETRI_TRANSITIONS=224} [2024-06-04 17:06:13,348 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 218 predicate places. [2024-06-04 17:06:13,348 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 224 transitions, 2868 flow [2024-06-04 17:06:13,349 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-04 17:06:13,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:06:13,349 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:06:13,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-04 17:06:13,349 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-04 17:06:13,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:06:13,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1794174552, now seen corresponding path program 15 times [2024-06-04 17:06:13,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:06:13,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598163172] [2024-06-04 17:06:13,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:06:13,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:06:13,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:06:18,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:06:18,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:06:18,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598163172] [2024-06-04 17:06:18,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598163172] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:06:18,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:06:18,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:06:18,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586539691] [2024-06-04 17:06:18,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:06:18,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:06:18,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:06:18,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:06:18,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:06:18,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:06:18,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 224 transitions, 2868 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-04 17:06:18,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:06:18,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:06:18,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:06:19,393 INFO L124 PetriNetUnfolderBase]: 613/1115 cut-off events. [2024-06-04 17:06:19,393 INFO L125 PetriNetUnfolderBase]: For 40477/40477 co-relation queries the response was YES. [2024-06-04 17:06:19,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7364 conditions, 1115 events. 613/1115 cut-off events. For 40477/40477 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 5947 event pairs, 79 based on Foata normal form. 2/1117 useless extension candidates. Maximal degree in co-relation 7260. Up to 741 conditions per place. [2024-06-04 17:06:19,403 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 145 selfloop transitions, 104 changer transitions 0/251 dead transitions. [2024-06-04 17:06:19,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 251 transitions, 3640 flow [2024-06-04 17:06:19,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:06:19,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:06:19,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 124 transitions. [2024-06-04 17:06:19,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-04 17:06:19,404 INFO L175 Difference]: Start difference. First operand has 248 places, 224 transitions, 2868 flow. Second operand 9 states and 124 transitions. [2024-06-04 17:06:19,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 251 transitions, 3640 flow [2024-06-04 17:06:19,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 251 transitions, 3452 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-04 17:06:19,520 INFO L231 Difference]: Finished difference. Result has 251 places, 230 transitions, 3067 flow [2024-06-04 17:06:19,520 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2686, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3067, PETRI_PLACES=251, PETRI_TRANSITIONS=230} [2024-06-04 17:06:19,520 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 221 predicate places. [2024-06-04 17:06:19,520 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 230 transitions, 3067 flow [2024-06-04 17:06:19,521 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-04 17:06:19,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:06:19,521 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:06:19,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-04 17:06:19,521 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-04 17:06:19,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:06:19,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1823771193, now seen corresponding path program 22 times [2024-06-04 17:06:19,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:06:19,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053790093] [2024-06-04 17:06:19,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:06:19,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:06:19,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:06:25,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:06:25,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:06:25,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053790093] [2024-06-04 17:06:25,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053790093] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:06:25,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:06:25,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:06:25,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761162835] [2024-06-04 17:06:25,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:06:25,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:06:25,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:06:25,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:06:25,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:06:25,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:06:25,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 230 transitions, 3067 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-04 17:06:25,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:06:25,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:06:25,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:06:26,081 INFO L124 PetriNetUnfolderBase]: 617/1123 cut-off events. [2024-06-04 17:06:26,081 INFO L125 PetriNetUnfolderBase]: For 40974/40974 co-relation queries the response was YES. [2024-06-04 17:06:26,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7596 conditions, 1123 events. 617/1123 cut-off events. For 40974/40974 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 6028 event pairs, 98 based on Foata normal form. 2/1125 useless extension candidates. Maximal degree in co-relation 7490. Up to 952 conditions per place. [2024-06-04 17:06:26,092 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 173 selfloop transitions, 73 changer transitions 0/248 dead transitions. [2024-06-04 17:06:26,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 248 transitions, 3629 flow [2024-06-04 17:06:26,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:06:26,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:06:26,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-04 17:06:26,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3935483870967742 [2024-06-04 17:06:26,093 INFO L175 Difference]: Start difference. First operand has 251 places, 230 transitions, 3067 flow. Second operand 10 states and 122 transitions. [2024-06-04 17:06:26,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 248 transitions, 3629 flow [2024-06-04 17:06:26,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 248 transitions, 3437 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-06-04 17:06:26,212 INFO L231 Difference]: Finished difference. Result has 255 places, 231 transitions, 3047 flow [2024-06-04 17:06:26,213 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2875, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3047, PETRI_PLACES=255, PETRI_TRANSITIONS=231} [2024-06-04 17:06:26,213 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 225 predicate places. [2024-06-04 17:06:26,213 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 231 transitions, 3047 flow [2024-06-04 17:06:26,213 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-04 17:06:26,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:06:26,213 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:06:26,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-04 17:06:26,213 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-04 17:06:26,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:06:26,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1823626888, now seen corresponding path program 16 times [2024-06-04 17:06:26,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:06:26,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173466998] [2024-06-04 17:06:26,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:06:26,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:06:26,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:06:31,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:06:31,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:06:31,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173466998] [2024-06-04 17:06:31,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173466998] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:06:31,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:06:31,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:06:31,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050909796] [2024-06-04 17:06:31,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:06:31,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:06:31,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:06:31,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:06:31,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:06:31,689 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:06:31,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 231 transitions, 3047 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-04 17:06:31,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:06:31,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:06:31,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:06:32,161 INFO L124 PetriNetUnfolderBase]: 623/1135 cut-off events. [2024-06-04 17:06:32,161 INFO L125 PetriNetUnfolderBase]: For 40840/40840 co-relation queries the response was YES. [2024-06-04 17:06:32,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7574 conditions, 1135 events. 623/1135 cut-off events. For 40840/40840 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 6109 event pairs, 99 based on Foata normal form. 2/1137 useless extension candidates. Maximal degree in co-relation 7468. Up to 877 conditions per place. [2024-06-04 17:06:32,169 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 175 selfloop transitions, 75 changer transitions 0/252 dead transitions. [2024-06-04 17:06:32,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 252 transitions, 3651 flow [2024-06-04 17:06:32,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:06:32,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:06:32,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2024-06-04 17:06:32,170 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43010752688172044 [2024-06-04 17:06:32,170 INFO L175 Difference]: Start difference. First operand has 255 places, 231 transitions, 3047 flow. Second operand 9 states and 120 transitions. [2024-06-04 17:06:32,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 252 transitions, 3651 flow [2024-06-04 17:06:32,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 252 transitions, 3475 flow, removed 9 selfloop flow, removed 11 redundant places. [2024-06-04 17:06:32,286 INFO L231 Difference]: Finished difference. Result has 253 places, 233 transitions, 3083 flow [2024-06-04 17:06:32,286 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2871, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3083, PETRI_PLACES=253, PETRI_TRANSITIONS=233} [2024-06-04 17:06:32,286 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 223 predicate places. [2024-06-04 17:06:32,286 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 233 transitions, 3083 flow [2024-06-04 17:06:32,287 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-04 17:06:32,287 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:06:32,287 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:06:32,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-04 17:06:32,287 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-04 17:06:32,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:06:32,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1823627043, now seen corresponding path program 23 times [2024-06-04 17:06:32,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:06:32,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46064908] [2024-06-04 17:06:32,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:06:32,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:06:32,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:06:38,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:06:38,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:06:38,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46064908] [2024-06-04 17:06:38,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46064908] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:06:38,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:06:38,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:06:38,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745273835] [2024-06-04 17:06:38,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:06:38,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:06:38,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:06:38,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:06:38,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:06:38,394 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:06:38,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 233 transitions, 3083 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-04 17:06:38,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:06:38,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:06:38,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:06:38,804 INFO L124 PetriNetUnfolderBase]: 627/1143 cut-off events. [2024-06-04 17:06:38,804 INFO L125 PetriNetUnfolderBase]: For 41099/41099 co-relation queries the response was YES. [2024-06-04 17:06:38,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7627 conditions, 1143 events. 627/1143 cut-off events. For 41099/41099 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 6160 event pairs, 116 based on Foata normal form. 2/1145 useless extension candidates. Maximal degree in co-relation 7523. Up to 1015 conditions per place. [2024-06-04 17:06:38,814 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 195 selfloop transitions, 52 changer transitions 0/249 dead transitions. [2024-06-04 17:06:38,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 249 transitions, 3643 flow [2024-06-04 17:06:38,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:06:38,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:06:38,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2024-06-04 17:06:38,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3774193548387097 [2024-06-04 17:06:38,815 INFO L175 Difference]: Start difference. First operand has 253 places, 233 transitions, 3083 flow. Second operand 10 states and 117 transitions. [2024-06-04 17:06:38,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 249 transitions, 3643 flow [2024-06-04 17:06:38,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 249 transitions, 3454 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-06-04 17:06:38,921 INFO L231 Difference]: Finished difference. Result has 255 places, 234 transitions, 3026 flow [2024-06-04 17:06:38,921 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2894, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3026, PETRI_PLACES=255, PETRI_TRANSITIONS=234} [2024-06-04 17:06:38,921 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 225 predicate places. [2024-06-04 17:06:38,921 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 234 transitions, 3026 flow [2024-06-04 17:06:38,921 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-04 17:06:38,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:06:38,921 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:06:38,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-04 17:06:38,922 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-04 17:06:38,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:06:38,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1799896408, now seen corresponding path program 2 times [2024-06-04 17:06:38,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:06:38,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139325097] [2024-06-04 17:06:38,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:06:38,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:06:38,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:06:44,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:06:44,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:06:44,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139325097] [2024-06-04 17:06:44,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139325097] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:06:44,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:06:44,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:06:44,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480067666] [2024-06-04 17:06:44,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:06:44,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:06:44,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:06:44,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:06:44,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:06:44,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:06:44,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 234 transitions, 3026 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-04 17:06:44,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:06:44,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:06:44,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:06:45,128 INFO L124 PetriNetUnfolderBase]: 635/1158 cut-off events. [2024-06-04 17:06:45,128 INFO L125 PetriNetUnfolderBase]: For 44299/44299 co-relation queries the response was YES. [2024-06-04 17:06:45,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7574 conditions, 1158 events. 635/1158 cut-off events. For 44299/44299 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 6287 event pairs, 101 based on Foata normal form. 4/1162 useless extension candidates. Maximal degree in co-relation 7470. Up to 933 conditions per place. [2024-06-04 17:06:45,138 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 188 selfloop transitions, 59 changer transitions 0/249 dead transitions. [2024-06-04 17:06:45,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 249 transitions, 3574 flow [2024-06-04 17:06:45,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:06:45,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:06:45,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-04 17:06:45,140 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3978494623655914 [2024-06-04 17:06:45,140 INFO L175 Difference]: Start difference. First operand has 255 places, 234 transitions, 3026 flow. Second operand 9 states and 111 transitions. [2024-06-04 17:06:45,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 249 transitions, 3574 flow [2024-06-04 17:06:45,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 249 transitions, 3364 flow, removed 10 selfloop flow, removed 12 redundant places. [2024-06-04 17:06:45,255 INFO L231 Difference]: Finished difference. Result has 252 places, 236 transitions, 2970 flow [2024-06-04 17:06:45,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2816, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2970, PETRI_PLACES=252, PETRI_TRANSITIONS=236} [2024-06-04 17:06:45,256 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 222 predicate places. [2024-06-04 17:06:45,256 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 236 transitions, 2970 flow [2024-06-04 17:06:45,256 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-04 17:06:45,256 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:06:45,256 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:06:45,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-04 17:06:45,256 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-04 17:06:45,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:06:45,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1818258928, now seen corresponding path program 17 times [2024-06-04 17:06:45,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:06:45,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009259131] [2024-06-04 17:06:45,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:06:45,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:06:45,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:06:51,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:06:51,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:06:51,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009259131] [2024-06-04 17:06:51,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009259131] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:06:51,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:06:51,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:06:51,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505918806] [2024-06-04 17:06:51,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:06:51,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:06:51,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:06:51,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:06:51,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:06:51,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:06:51,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 236 transitions, 2970 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-04 17:06:51,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:06:51,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:06:51,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:06:51,878 INFO L124 PetriNetUnfolderBase]: 647/1178 cut-off events. [2024-06-04 17:06:51,879 INFO L125 PetriNetUnfolderBase]: For 40951/40951 co-relation queries the response was YES. [2024-06-04 17:06:51,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7665 conditions, 1178 events. 647/1178 cut-off events. For 40951/40951 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 6397 event pairs, 96 based on Foata normal form. 2/1180 useless extension candidates. Maximal degree in co-relation 7563. Up to 957 conditions per place. [2024-06-04 17:06:51,887 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 193 selfloop transitions, 61 changer transitions 0/256 dead transitions. [2024-06-04 17:06:51,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 256 transitions, 3576 flow [2024-06-04 17:06:51,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:06:51,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:06:51,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-04 17:06:51,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3967741935483871 [2024-06-04 17:06:51,888 INFO L175 Difference]: Start difference. First operand has 252 places, 236 transitions, 2970 flow. Second operand 10 states and 123 transitions. [2024-06-04 17:06:51,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 256 transitions, 3576 flow [2024-06-04 17:06:51,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 256 transitions, 3438 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-04 17:06:51,992 INFO L231 Difference]: Finished difference. Result has 255 places, 240 transitions, 3028 flow [2024-06-04 17:06:51,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2836, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3028, PETRI_PLACES=255, PETRI_TRANSITIONS=240} [2024-06-04 17:06:51,993 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 225 predicate places. [2024-06-04 17:06:51,993 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 240 transitions, 3028 flow [2024-06-04 17:06:51,993 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-04 17:06:51,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:06:51,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:06:51,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-04 17:06:51,994 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-04 17:06:51,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:06:51,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1818057118, now seen corresponding path program 18 times [2024-06-04 17:06:51,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:06:51,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392143127] [2024-06-04 17:06:51,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:06:51,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:06:52,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:06:57,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-04 17:06:57,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:06:57,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392143127] [2024-06-04 17:06:57,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392143127] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:06:57,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:06:57,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:06:57,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041996913] [2024-06-04 17:06:57,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:06:57,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:06:57,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:06:57,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:06:57,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:06:57,916 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:06:57,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 240 transitions, 3028 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-04 17:06:57,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:06:57,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:06:57,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:06:58,492 INFO L124 PetriNetUnfolderBase]: 653/1188 cut-off events. [2024-06-04 17:06:58,492 INFO L125 PetriNetUnfolderBase]: For 41085/41085 co-relation queries the response was YES. [2024-06-04 17:06:58,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7713 conditions, 1188 events. 653/1188 cut-off events. For 41085/41085 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 6478 event pairs, 96 based on Foata normal form. 2/1190 useless extension candidates. Maximal degree in co-relation 7610. Up to 967 conditions per place. [2024-06-04 17:06:58,502 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 195 selfloop transitions, 63 changer transitions 0/260 dead transitions. [2024-06-04 17:06:58,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 260 transitions, 3620 flow [2024-06-04 17:06:58,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:06:58,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:06:58,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 140 transitions. [2024-06-04 17:06:58,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3763440860215054 [2024-06-04 17:06:58,503 INFO L175 Difference]: Start difference. First operand has 255 places, 240 transitions, 3028 flow. Second operand 12 states and 140 transitions. [2024-06-04 17:06:58,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 260 transitions, 3620 flow [2024-06-04 17:06:58,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 260 transitions, 3489 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-04 17:06:58,606 INFO L231 Difference]: Finished difference. Result has 259 places, 242 transitions, 3071 flow [2024-06-04 17:06:58,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2897, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3071, PETRI_PLACES=259, PETRI_TRANSITIONS=242} [2024-06-04 17:06:58,607 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 229 predicate places. [2024-06-04 17:06:58,607 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 242 transitions, 3071 flow [2024-06-04 17:06:58,607 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-04 17:06:58,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:06:58,607 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:06:58,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-04 17:06:58,607 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-04 17:06:58,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:06:58,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1818264508, now seen corresponding path program 19 times [2024-06-04 17:06:58,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:06:58,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200848888] [2024-06-04 17:06:58,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:06:58,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:06:58,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:07:03,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:07:03,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:07:03,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200848888] [2024-06-04 17:07:03,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200848888] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:07:03,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:07:03,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:07:03,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931147570] [2024-06-04 17:07:03,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:07:03,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:07:03,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:07:03,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:07:03,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:07:04,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:07:04,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 242 transitions, 3071 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-04 17:07:04,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:07:04,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:07:04,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:07:04,467 INFO L124 PetriNetUnfolderBase]: 659/1198 cut-off events. [2024-06-04 17:07:04,467 INFO L125 PetriNetUnfolderBase]: For 41125/41125 co-relation queries the response was YES. [2024-06-04 17:07:04,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7820 conditions, 1198 events. 659/1198 cut-off events. For 41125/41125 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 6507 event pairs, 90 based on Foata normal form. 2/1200 useless extension candidates. Maximal degree in co-relation 7717. Up to 921 conditions per place. [2024-06-04 17:07:04,477 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 184 selfloop transitions, 75 changer transitions 0/261 dead transitions. [2024-06-04 17:07:04,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 261 transitions, 3681 flow [2024-06-04 17:07:04,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:07:04,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:07:04,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-04 17:07:04,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4064516129032258 [2024-06-04 17:07:04,478 INFO L175 Difference]: Start difference. First operand has 259 places, 242 transitions, 3071 flow. Second operand 10 states and 126 transitions. [2024-06-04 17:07:04,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 261 transitions, 3681 flow [2024-06-04 17:07:04,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 261 transitions, 3532 flow, removed 10 selfloop flow, removed 11 redundant places. [2024-06-04 17:07:04,584 INFO L231 Difference]: Finished difference. Result has 258 places, 244 transitions, 3138 flow [2024-06-04 17:07:04,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2922, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3138, PETRI_PLACES=258, PETRI_TRANSITIONS=244} [2024-06-04 17:07:04,584 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 228 predicate places. [2024-06-04 17:07:04,584 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 244 transitions, 3138 flow [2024-06-04 17:07:04,585 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-04 17:07:04,585 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:07:04,585 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:07:04,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-04 17:07:04,585 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-04 17:07:04,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:07:04,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1818264663, now seen corresponding path program 24 times [2024-06-04 17:07:04,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:07:04,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62057820] [2024-06-04 17:07:04,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:07:04,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:07:04,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:07:10,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-04 17:07:10,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:07:10,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62057820] [2024-06-04 17:07:10,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62057820] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:07:10,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:07:10,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:07:10,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067179621] [2024-06-04 17:07:10,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:07:10,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:07:10,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:07:10,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:07:10,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:07:10,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:07:10,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 244 transitions, 3138 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-04 17:07:10,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:07:10,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:07:10,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:07:11,071 INFO L124 PetriNetUnfolderBase]: 663/1206 cut-off events. [2024-06-04 17:07:11,071 INFO L125 PetriNetUnfolderBase]: For 41447/41447 co-relation queries the response was YES. [2024-06-04 17:07:11,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7893 conditions, 1206 events. 663/1206 cut-off events. For 41447/41447 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 6568 event pairs, 113 based on Foata normal form. 2/1208 useless extension candidates. Maximal degree in co-relation 7790. Up to 1079 conditions per place. [2024-06-04 17:07:11,082 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 207 selfloop transitions, 49 changer transitions 0/258 dead transitions. [2024-06-04 17:07:11,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 258 transitions, 3702 flow [2024-06-04 17:07:11,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:07:11,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:07:11,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 123 transitions. [2024-06-04 17:07:11,083 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36070381231671556 [2024-06-04 17:07:11,083 INFO L175 Difference]: Start difference. First operand has 258 places, 244 transitions, 3138 flow. Second operand 11 states and 123 transitions. [2024-06-04 17:07:11,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 258 transitions, 3702 flow [2024-06-04 17:07:11,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 258 transitions, 3515 flow, removed 20 selfloop flow, removed 9 redundant places. [2024-06-04 17:07:11,179 INFO L231 Difference]: Finished difference. Result has 260 places, 245 transitions, 3079 flow [2024-06-04 17:07:11,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2951, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3079, PETRI_PLACES=260, PETRI_TRANSITIONS=245} [2024-06-04 17:07:11,179 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 230 predicate places. [2024-06-04 17:07:11,179 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 245 transitions, 3079 flow [2024-06-04 17:07:11,179 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-04 17:07:11,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:07:11,180 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:07:11,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-04 17:07:11,180 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-04 17:07:11,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:07:11,180 INFO L85 PathProgramCache]: Analyzing trace with hash -412268010, now seen corresponding path program 3 times [2024-06-04 17:07:11,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:07:11,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152617920] [2024-06-04 17:07:11,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:07:11,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:07:11,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:07:17,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:07:17,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:07:17,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152617920] [2024-06-04 17:07:17,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152617920] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:07:17,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:07:17,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:07:17,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247686384] [2024-06-04 17:07:17,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:07:17,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:07:17,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:07:17,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:07:17,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:07:17,298 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:07:17,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 245 transitions, 3079 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-04 17:07:17,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:07:17,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:07:17,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:07:17,689 INFO L124 PetriNetUnfolderBase]: 667/1214 cut-off events. [2024-06-04 17:07:17,689 INFO L125 PetriNetUnfolderBase]: For 41155/41155 co-relation queries the response was YES. [2024-06-04 17:07:17,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7805 conditions, 1214 events. 667/1214 cut-off events. For 41155/41155 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 6631 event pairs, 208 based on Foata normal form. 2/1216 useless extension candidates. Maximal degree in co-relation 7702. Up to 1166 conditions per place. [2024-06-04 17:07:17,700 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 237 selfloop transitions, 18 changer transitions 0/257 dead transitions. [2024-06-04 17:07:17,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 257 transitions, 3629 flow [2024-06-04 17:07:17,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:07:17,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:07:17,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2024-06-04 17:07:17,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36200716845878134 [2024-06-04 17:07:17,701 INFO L175 Difference]: Start difference. First operand has 260 places, 245 transitions, 3079 flow. Second operand 9 states and 101 transitions. [2024-06-04 17:07:17,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 257 transitions, 3629 flow [2024-06-04 17:07:17,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 257 transitions, 3515 flow, removed 9 selfloop flow, removed 10 redundant places. [2024-06-04 17:07:17,806 INFO L231 Difference]: Finished difference. Result has 259 places, 246 transitions, 3023 flow [2024-06-04 17:07:17,806 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2965, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3023, PETRI_PLACES=259, PETRI_TRANSITIONS=246} [2024-06-04 17:07:17,806 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 229 predicate places. [2024-06-04 17:07:17,807 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 246 transitions, 3023 flow [2024-06-04 17:07:17,807 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-04 17:07:17,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:07:17,807 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:07:17,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-04 17:07:17,807 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-04 17:07:17,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:07:17,808 INFO L85 PathProgramCache]: Analyzing trace with hash 887013904, now seen corresponding path program 20 times [2024-06-04 17:07:17,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:07:17,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112177321] [2024-06-04 17:07:17,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:07:17,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:07:17,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:07:23,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:07:23,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:07:23,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112177321] [2024-06-04 17:07:23,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112177321] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:07:23,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:07:23,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:07:23,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161267669] [2024-06-04 17:07:23,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:07:23,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:07:23,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:07:23,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:07:23,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:07:23,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:07:23,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 246 transitions, 3023 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-04 17:07:23,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:07:23,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:07:23,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:07:24,536 INFO L124 PetriNetUnfolderBase]: 679/1234 cut-off events. [2024-06-04 17:07:24,537 INFO L125 PetriNetUnfolderBase]: For 41021/41021 co-relation queries the response was YES. [2024-06-04 17:07:24,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7842 conditions, 1234 events. 679/1234 cut-off events. For 41021/41021 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 6774 event pairs, 206 based on Foata normal form. 2/1236 useless extension candidates. Maximal degree in co-relation 7739. Up to 1167 conditions per place. [2024-06-04 17:07:24,548 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 238 selfloop transitions, 24 changer transitions 0/264 dead transitions. [2024-06-04 17:07:24,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 264 transitions, 3639 flow [2024-06-04 17:07:24,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:07:24,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:07:24,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-04 17:07:24,550 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3709677419354839 [2024-06-04 17:07:24,550 INFO L175 Difference]: Start difference. First operand has 259 places, 246 transitions, 3023 flow. Second operand 10 states and 115 transitions. [2024-06-04 17:07:24,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 264 transitions, 3639 flow [2024-06-04 17:07:24,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 264 transitions, 3585 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-04 17:07:24,661 INFO L231 Difference]: Finished difference. Result has 261 places, 250 transitions, 3088 flow [2024-06-04 17:07:24,661 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2969, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3088, PETRI_PLACES=261, PETRI_TRANSITIONS=250} [2024-06-04 17:07:24,662 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 231 predicate places. [2024-06-04 17:07:24,662 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 250 transitions, 3088 flow [2024-06-04 17:07:24,662 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-04 17:07:24,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:07:24,662 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:07:24,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-04 17:07:24,663 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-04 17:07:24,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:07:24,663 INFO L85 PathProgramCache]: Analyzing trace with hash 354611688, now seen corresponding path program 21 times [2024-06-04 17:07:24,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:07:24,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757262323] [2024-06-04 17:07:24,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:07:24,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:07:24,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:07:30,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-04 17:07:30,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:07:30,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757262323] [2024-06-04 17:07:30,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757262323] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:07:30,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:07:30,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:07:30,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629777747] [2024-06-04 17:07:30,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:07:30,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:07:30,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:07:30,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:07:30,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:07:30,245 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:07:30,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 250 transitions, 3088 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-04 17:07:30,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:07:30,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:07:30,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:07:30,852 INFO L124 PetriNetUnfolderBase]: 685/1244 cut-off events. [2024-06-04 17:07:30,852 INFO L125 PetriNetUnfolderBase]: For 42425/42425 co-relation queries the response was YES. [2024-06-04 17:07:30,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7943 conditions, 1244 events. 685/1244 cut-off events. For 42425/42425 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 6849 event pairs, 208 based on Foata normal form. 2/1246 useless extension candidates. Maximal degree in co-relation 7840. Up to 1177 conditions per place. [2024-06-04 17:07:30,863 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 241 selfloop transitions, 25 changer transitions 0/268 dead transitions. [2024-06-04 17:07:30,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 268 transitions, 3698 flow [2024-06-04 17:07:30,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:07:30,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:07:30,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 131 transitions. [2024-06-04 17:07:30,872 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3521505376344086 [2024-06-04 17:07:30,872 INFO L175 Difference]: Start difference. First operand has 261 places, 250 transitions, 3088 flow. Second operand 12 states and 131 transitions. [2024-06-04 17:07:30,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 268 transitions, 3698 flow [2024-06-04 17:07:30,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 268 transitions, 3629 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-04 17:07:30,997 INFO L231 Difference]: Finished difference. Result has 266 places, 252 transitions, 3122 flow [2024-06-04 17:07:30,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3019, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3122, PETRI_PLACES=266, PETRI_TRANSITIONS=252} [2024-06-04 17:07:30,997 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 236 predicate places. [2024-06-04 17:07:30,997 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 252 transitions, 3122 flow [2024-06-04 17:07:30,997 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-04 17:07:30,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:07:30,997 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:07:30,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-04 17:07:30,998 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-04 17:07:30,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:07:30,998 INFO L85 PathProgramCache]: Analyzing trace with hash 887008324, now seen corresponding path program 22 times [2024-06-04 17:07:30,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:07:30,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501754136] [2024-06-04 17:07:30,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:07:30,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:07:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:07:36,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:07:36,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:07:36,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501754136] [2024-06-04 17:07:36,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501754136] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:07:36,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:07:36,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:07:36,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263591970] [2024-06-04 17:07:36,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:07:36,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:07:36,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:07:36,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:07:36,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:07:36,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:07:36,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 252 transitions, 3122 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-04 17:07:36,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:07:36,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:07:36,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:07:36,866 INFO L124 PetriNetUnfolderBase]: 691/1254 cut-off events. [2024-06-04 17:07:36,867 INFO L125 PetriNetUnfolderBase]: For 44133/44133 co-relation queries the response was YES. [2024-06-04 17:07:36,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8049 conditions, 1254 events. 691/1254 cut-off events. For 44133/44133 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 6898 event pairs, 201 based on Foata normal form. 2/1256 useless extension candidates. Maximal degree in co-relation 7945. Up to 1156 conditions per place. [2024-06-04 17:07:36,877 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 235 selfloop transitions, 32 changer transitions 0/269 dead transitions. [2024-06-04 17:07:36,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 269 transitions, 3746 flow [2024-06-04 17:07:36,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:07:36,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:07:36,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-04 17:07:36,878 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38064516129032255 [2024-06-04 17:07:36,879 INFO L175 Difference]: Start difference. First operand has 266 places, 252 transitions, 3122 flow. Second operand 10 states and 118 transitions. [2024-06-04 17:07:36,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 269 transitions, 3746 flow [2024-06-04 17:07:36,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 269 transitions, 3666 flow, removed 15 selfloop flow, removed 10 redundant places. [2024-06-04 17:07:36,992 INFO L231 Difference]: Finished difference. Result has 266 places, 254 transitions, 3173 flow [2024-06-04 17:07:36,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3042, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3173, PETRI_PLACES=266, PETRI_TRANSITIONS=254} [2024-06-04 17:07:36,992 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 236 predicate places. [2024-06-04 17:07:36,993 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 254 transitions, 3173 flow [2024-06-04 17:07:36,993 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-04 17:07:36,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:07:36,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:07:36,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-04 17:07:36,993 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-04 17:07:36,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:07:36,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1170387254, now seen corresponding path program 23 times [2024-06-04 17:07:36,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:07:36,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203896682] [2024-06-04 17:07:36,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:07:36,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:07:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:07:43,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:07:43,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:07:43,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203896682] [2024-06-04 17:07:43,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203896682] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:07:43,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:07:43,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:07:43,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679636409] [2024-06-04 17:07:43,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:07:43,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:07:43,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:07:43,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:07:43,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:07:43,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:07:43,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 254 transitions, 3173 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-04 17:07:43,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:07:43,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:07:43,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:07:43,966 INFO L124 PetriNetUnfolderBase]: 703/1274 cut-off events. [2024-06-04 17:07:43,967 INFO L125 PetriNetUnfolderBase]: For 45857/45857 co-relation queries the response was YES. [2024-06-04 17:07:43,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8209 conditions, 1274 events. 703/1274 cut-off events. For 45857/45857 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 7044 event pairs, 212 based on Foata normal form. 2/1276 useless extension candidates. Maximal degree in co-relation 8104. Up to 1219 conditions per place. [2024-06-04 17:07:43,980 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 248 selfloop transitions, 20 changer transitions 0/270 dead transitions. [2024-06-04 17:07:43,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 270 transitions, 3805 flow [2024-06-04 17:07:43,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:07:43,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:07:43,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2024-06-04 17:07:43,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-04 17:07:43,982 INFO L175 Difference]: Start difference. First operand has 266 places, 254 transitions, 3173 flow. Second operand 10 states and 110 transitions. [2024-06-04 17:07:43,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 270 transitions, 3805 flow [2024-06-04 17:07:44,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 270 transitions, 3698 flow, removed 23 selfloop flow, removed 8 redundant places. [2024-06-04 17:07:44,109 INFO L231 Difference]: Finished difference. Result has 268 places, 258 transitions, 3185 flow [2024-06-04 17:07:44,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3066, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3185, PETRI_PLACES=268, PETRI_TRANSITIONS=258} [2024-06-04 17:07:44,109 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 238 predicate places. [2024-06-04 17:07:44,110 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 258 transitions, 3185 flow [2024-06-04 17:07:44,110 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-04 17:07:44,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:07:44,110 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:07:44,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-04 17:07:44,110 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-04 17:07:44,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:07:44,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1170379318, now seen corresponding path program 4 times [2024-06-04 17:07:44,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:07:44,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961305248] [2024-06-04 17:07:44,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:07:44,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:07:44,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:07:49,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:07:49,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:07:49,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961305248] [2024-06-04 17:07:49,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961305248] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:07:49,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:07:49,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:07:49,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265156617] [2024-06-04 17:07:49,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:07:49,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:07:49,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:07:49,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:07:49,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:07:49,716 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:07:49,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 258 transitions, 3185 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-04 17:07:49,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:07:49,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:07:49,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:07:50,150 INFO L124 PetriNetUnfolderBase]: 707/1282 cut-off events. [2024-06-04 17:07:50,150 INFO L125 PetriNetUnfolderBase]: For 46759/46759 co-relation queries the response was YES. [2024-06-04 17:07:50,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8193 conditions, 1282 events. 707/1282 cut-off events. For 46759/46759 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 7085 event pairs, 216 based on Foata normal form. 2/1284 useless extension candidates. Maximal degree in co-relation 8087. Up to 1246 conditions per place. [2024-06-04 17:07:50,161 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 253 selfloop transitions, 14 changer transitions 0/269 dead transitions. [2024-06-04 17:07:50,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 269 transitions, 3759 flow [2024-06-04 17:07:50,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:07:50,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:07:50,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-04 17:07:50,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34767025089605735 [2024-06-04 17:07:50,163 INFO L175 Difference]: Start difference. First operand has 268 places, 258 transitions, 3185 flow. Second operand 9 states and 97 transitions. [2024-06-04 17:07:50,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 269 transitions, 3759 flow [2024-06-04 17:07:50,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 269 transitions, 3687 flow, removed 19 selfloop flow, removed 7 redundant places. [2024-06-04 17:07:50,285 INFO L231 Difference]: Finished difference. Result has 270 places, 259 transitions, 3165 flow [2024-06-04 17:07:50,286 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3113, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3165, PETRI_PLACES=270, PETRI_TRANSITIONS=259} [2024-06-04 17:07:50,286 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 240 predicate places. [2024-06-04 17:07:50,286 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 259 transitions, 3165 flow [2024-06-04 17:07:50,286 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-04 17:07:50,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:07:50,287 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:07:50,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-04 17:07:50,287 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-04 17:07:50,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:07:50,287 INFO L85 PathProgramCache]: Analyzing trace with hash -913878808, now seen corresponding path program 5 times [2024-06-04 17:07:50,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:07:50,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387132530] [2024-06-04 17:07:50,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:07:50,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:07:50,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:07:55,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:07:55,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:07:55,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387132530] [2024-06-04 17:07:55,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387132530] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:07:55,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:07:55,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:07:55,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090059720] [2024-06-04 17:07:55,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:07:55,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:07:55,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:07:55,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:07:55,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:07:55,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:07:55,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 259 transitions, 3165 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-04 17:07:55,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:07:55,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:07:55,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:07:56,300 INFO L124 PetriNetUnfolderBase]: 711/1290 cut-off events. [2024-06-04 17:07:56,300 INFO L125 PetriNetUnfolderBase]: For 48037/48037 co-relation queries the response was YES. [2024-06-04 17:07:56,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8203 conditions, 1290 events. 711/1290 cut-off events. For 48037/48037 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 7148 event pairs, 213 based on Foata normal form. 2/1292 useless extension candidates. Maximal degree in co-relation 8097. Up to 1249 conditions per place. [2024-06-04 17:07:56,312 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 255 selfloop transitions, 14 changer transitions 0/271 dead transitions. [2024-06-04 17:07:56,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 271 transitions, 3747 flow [2024-06-04 17:07:56,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:07:56,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:07:56,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-04 17:07:56,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35125448028673834 [2024-06-04 17:07:56,316 INFO L175 Difference]: Start difference. First operand has 270 places, 259 transitions, 3165 flow. Second operand 9 states and 98 transitions. [2024-06-04 17:07:56,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 271 transitions, 3747 flow [2024-06-04 17:07:56,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 271 transitions, 3704 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-04 17:07:56,437 INFO L231 Difference]: Finished difference. Result has 272 places, 260 transitions, 3176 flow [2024-06-04 17:07:56,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3122, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3176, PETRI_PLACES=272, PETRI_TRANSITIONS=260} [2024-06-04 17:07:56,438 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 242 predicate places. [2024-06-04 17:07:56,438 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 260 transitions, 3176 flow [2024-06-04 17:07:56,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-04 17:07:56,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:07:56,438 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:07:56,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-04 17:07:56,439 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-04 17:07:56,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:07:56,439 INFO L85 PathProgramCache]: Analyzing trace with hash -913886744, now seen corresponding path program 24 times [2024-06-04 17:07:56,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:07:56,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148662277] [2024-06-04 17:07:56,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:07:56,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:07:56,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:08:01,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:08:01,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:08:01,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148662277] [2024-06-04 17:08:01,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148662277] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:08:01,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:08:01,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:08:01,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756714610] [2024-06-04 17:08:01,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:08:01,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:08:01,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:08:01,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:08:01,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:08:01,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:08:01,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 260 transitions, 3176 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-04 17:08:01,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:08:01,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:08:01,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:08:02,329 INFO L124 PetriNetUnfolderBase]: 707/1284 cut-off events. [2024-06-04 17:08:02,329 INFO L125 PetriNetUnfolderBase]: For 45654/45654 co-relation queries the response was YES. [2024-06-04 17:08:02,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8056 conditions, 1284 events. 707/1284 cut-off events. For 45654/45654 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 7139 event pairs, 213 based on Foata normal form. 2/1286 useless extension candidates. Maximal degree in co-relation 7949. Up to 1233 conditions per place. [2024-06-04 17:08:02,341 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 254 selfloop transitions, 17 changer transitions 0/273 dead transitions. [2024-06-04 17:08:02,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 273 transitions, 3746 flow [2024-06-04 17:08:02,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:08:02,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:08:02,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2024-06-04 17:08:02,342 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35161290322580646 [2024-06-04 17:08:02,342 INFO L175 Difference]: Start difference. First operand has 272 places, 260 transitions, 3176 flow. Second operand 10 states and 109 transitions. [2024-06-04 17:08:02,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 273 transitions, 3746 flow [2024-06-04 17:08:02,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 273 transitions, 3702 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-04 17:08:02,461 INFO L231 Difference]: Finished difference. Result has 275 places, 260 transitions, 3171 flow [2024-06-04 17:08:02,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3132, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3171, PETRI_PLACES=275, PETRI_TRANSITIONS=260} [2024-06-04 17:08:02,461 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 245 predicate places. [2024-06-04 17:08:02,462 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 260 transitions, 3171 flow [2024-06-04 17:08:02,462 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-04 17:08:02,462 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:08:02,462 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:08:02,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-04 17:08:02,462 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-04 17:08:02,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:08:02,463 INFO L85 PathProgramCache]: Analyzing trace with hash 354404143, now seen corresponding path program 25 times [2024-06-04 17:08:02,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:08:02,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770020469] [2024-06-04 17:08:02,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:08:02,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:08:02,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:08:08,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:08:08,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:08:08,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770020469] [2024-06-04 17:08:08,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770020469] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:08:08,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:08:08,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:08:08,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820222213] [2024-06-04 17:08:08,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:08:08,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:08:08,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:08:08,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:08:08,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:08:08,391 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:08:08,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 260 transitions, 3171 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-04 17:08:08,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:08:08,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:08:08,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:08:08,909 INFO L124 PetriNetUnfolderBase]: 711/1292 cut-off events. [2024-06-04 17:08:08,910 INFO L125 PetriNetUnfolderBase]: For 47150/47150 co-relation queries the response was YES. [2024-06-04 17:08:08,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8113 conditions, 1292 events. 711/1292 cut-off events. For 47150/47150 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 7183 event pairs, 219 based on Foata normal form. 2/1294 useless extension candidates. Maximal degree in co-relation 8005. Up to 1250 conditions per place. [2024-06-04 17:08:08,918 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 250 selfloop transitions, 20 changer transitions 0/272 dead transitions. [2024-06-04 17:08:08,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 272 transitions, 3759 flow [2024-06-04 17:08:08,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:08:08,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:08:08,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2024-06-04 17:08:08,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33724340175953077 [2024-06-04 17:08:08,919 INFO L175 Difference]: Start difference. First operand has 275 places, 260 transitions, 3171 flow. Second operand 11 states and 115 transitions. [2024-06-04 17:08:08,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 272 transitions, 3759 flow [2024-06-04 17:08:09,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 272 transitions, 3708 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-04 17:08:09,053 INFO L231 Difference]: Finished difference. Result has 278 places, 261 transitions, 3190 flow [2024-06-04 17:08:09,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3120, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3190, PETRI_PLACES=278, PETRI_TRANSITIONS=261} [2024-06-04 17:08:09,053 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 248 predicate places. [2024-06-04 17:08:09,053 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 261 transitions, 3190 flow [2024-06-04 17:08:09,054 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-04 17:08:09,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:08:09,054 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:08:09,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-04 17:08:09,054 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-04 17:08:09,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:08:09,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1170589064, now seen corresponding path program 25 times [2024-06-04 17:08:09,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:08:09,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028810766] [2024-06-04 17:08:09,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:08:09,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:08:09,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:08:14,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:08:14,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:08:14,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028810766] [2024-06-04 17:08:14,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028810766] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:08:14,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:08:14,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:08:14,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236284675] [2024-06-04 17:08:14,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:08:14,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:08:14,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:08:14,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:08:14,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:08:14,598 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:08:14,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 261 transitions, 3190 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-04 17:08:14,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:08:14,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:08:14,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:08:15,059 INFO L124 PetriNetUnfolderBase]: 707/1286 cut-off events. [2024-06-04 17:08:15,059 INFO L125 PetriNetUnfolderBase]: For 44550/44550 co-relation queries the response was YES. [2024-06-04 17:08:15,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7943 conditions, 1286 events. 707/1286 cut-off events. For 44550/44550 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 7178 event pairs, 212 based on Foata normal form. 2/1288 useless extension candidates. Maximal degree in co-relation 7834. Up to 1231 conditions per place. [2024-06-04 17:08:15,071 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 252 selfloop transitions, 20 changer transitions 0/274 dead transitions. [2024-06-04 17:08:15,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 274 transitions, 3762 flow [2024-06-04 17:08:15,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:08:15,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:08:15,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2024-06-04 17:08:15,072 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3580645161290323 [2024-06-04 17:08:15,072 INFO L175 Difference]: Start difference. First operand has 278 places, 261 transitions, 3190 flow. Second operand 10 states and 111 transitions. [2024-06-04 17:08:15,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 274 transitions, 3762 flow [2024-06-04 17:08:15,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 274 transitions, 3696 flow, removed 14 selfloop flow, removed 9 redundant places. [2024-06-04 17:08:15,202 INFO L231 Difference]: Finished difference. Result has 279 places, 261 transitions, 3169 flow [2024-06-04 17:08:15,202 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3124, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3169, PETRI_PLACES=279, PETRI_TRANSITIONS=261} [2024-06-04 17:08:15,202 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 249 predicate places. [2024-06-04 17:08:15,203 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 261 transitions, 3169 flow [2024-06-04 17:08:15,203 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-04 17:08:15,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:08:15,203 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:08:15,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-04 17:08:15,203 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-04 17:08:15,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:08:15,204 INFO L85 PathProgramCache]: Analyzing trace with hash -371751582, now seen corresponding path program 6 times [2024-06-04 17:08:15,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:08:15,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493695938] [2024-06-04 17:08:15,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:08:15,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:08:15,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:08:20,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:08:20,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:08:20,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493695938] [2024-06-04 17:08:20,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493695938] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:08:20,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:08:20,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:08:20,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275598776] [2024-06-04 17:08:20,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:08:20,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:08:20,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:08:20,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:08:20,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:08:20,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:08:20,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 261 transitions, 3169 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-04 17:08:20,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:08:20,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:08:20,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:08:20,985 INFO L124 PetriNetUnfolderBase]: 704/1281 cut-off events. [2024-06-04 17:08:20,985 INFO L125 PetriNetUnfolderBase]: For 41418/41418 co-relation queries the response was YES. [2024-06-04 17:08:20,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7766 conditions, 1281 events. 704/1281 cut-off events. For 41418/41418 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 7139 event pairs, 209 based on Foata normal form. 2/1283 useless extension candidates. Maximal degree in co-relation 7656. Up to 1240 conditions per place. [2024-06-04 17:08:20,997 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 257 selfloop transitions, 13 changer transitions 0/272 dead transitions. [2024-06-04 17:08:20,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 272 transitions, 3733 flow [2024-06-04 17:08:20,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:08:20,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:08:20,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2024-06-04 17:08:20,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34408602150537637 [2024-06-04 17:08:20,998 INFO L175 Difference]: Start difference. First operand has 279 places, 261 transitions, 3169 flow. Second operand 9 states and 96 transitions. [2024-06-04 17:08:20,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 272 transitions, 3733 flow [2024-06-04 17:08:21,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 272 transitions, 3607 flow, removed 14 selfloop flow, removed 10 redundant places. [2024-06-04 17:08:21,135 INFO L231 Difference]: Finished difference. Result has 278 places, 261 transitions, 3073 flow [2024-06-04 17:08:21,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3043, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3073, PETRI_PLACES=278, PETRI_TRANSITIONS=261} [2024-06-04 17:08:21,135 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 248 predicate places. [2024-06-04 17:08:21,136 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 261 transitions, 3073 flow [2024-06-04 17:08:21,136 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-04 17:08:21,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:08:21,136 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:08:21,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-04 17:08:21,136 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-04 17:08:21,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:08:21,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1170594799, now seen corresponding path program 26 times [2024-06-04 17:08:21,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:08:21,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780807492] [2024-06-04 17:08:21,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:08:21,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:08:21,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:08:26,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:08:26,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:08:26,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780807492] [2024-06-04 17:08:26,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780807492] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:08:26,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:08:26,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:08:26,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261001578] [2024-06-04 17:08:26,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:08:26,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:08:26,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:08:26,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:08:26,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:08:26,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:08:26,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 261 transitions, 3073 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-04 17:08:26,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:08:26,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:08:26,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:08:27,404 INFO L124 PetriNetUnfolderBase]: 701/1276 cut-off events. [2024-06-04 17:08:27,404 INFO L125 PetriNetUnfolderBase]: For 38127/38127 co-relation queries the response was YES. [2024-06-04 17:08:27,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7506 conditions, 1276 events. 701/1276 cut-off events. For 38127/38127 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 7124 event pairs, 216 based on Foata normal form. 2/1278 useless extension candidates. Maximal degree in co-relation 7395. Up to 1240 conditions per place. [2024-06-04 17:08:27,416 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 253 selfloop transitions, 16 changer transitions 0/271 dead transitions. [2024-06-04 17:08:27,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 271 transitions, 3633 flow [2024-06-04 17:08:27,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:08:27,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:08:27,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2024-06-04 17:08:27,417 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2024-06-04 17:08:27,417 INFO L175 Difference]: Start difference. First operand has 278 places, 261 transitions, 3073 flow. Second operand 10 states and 105 transitions. [2024-06-04 17:08:27,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 271 transitions, 3633 flow [2024-06-04 17:08:27,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 271 transitions, 3561 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-06-04 17:08:27,538 INFO L231 Difference]: Finished difference. Result has 280 places, 261 transitions, 3037 flow [2024-06-04 17:08:27,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3001, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3037, PETRI_PLACES=280, PETRI_TRANSITIONS=261} [2024-06-04 17:08:27,538 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 250 predicate places. [2024-06-04 17:08:27,538 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 261 transitions, 3037 flow [2024-06-04 17:08:27,539 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-04 17:08:27,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:08:27,539 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:08:27,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-04 17:08:27,539 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-04 17:08:27,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:08:27,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1170594644, now seen corresponding path program 26 times [2024-06-04 17:08:27,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:08:27,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114784438] [2024-06-04 17:08:27,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:08:27,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:08:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:08:33,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:08:33,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:08:33,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114784438] [2024-06-04 17:08:33,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114784438] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:08:33,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:08:33,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:08:33,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539679591] [2024-06-04 17:08:33,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:08:33,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:08:33,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:08:33,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:08:33,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:08:33,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:08:33,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 261 transitions, 3037 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-04 17:08:33,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:08:33,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:08:33,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:08:33,713 INFO L124 PetriNetUnfolderBase]: 697/1270 cut-off events. [2024-06-04 17:08:33,713 INFO L125 PetriNetUnfolderBase]: For 34283/34283 co-relation queries the response was YES. [2024-06-04 17:08:33,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7250 conditions, 1270 events. 697/1270 cut-off events. For 34283/34283 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 7100 event pairs, 203 based on Foata normal form. 2/1272 useless extension candidates. Maximal degree in co-relation 7139. Up to 1168 conditions per place. [2024-06-04 17:08:33,725 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 241 selfloop transitions, 32 changer transitions 0/275 dead transitions. [2024-06-04 17:08:33,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 275 transitions, 3613 flow [2024-06-04 17:08:33,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:08:33,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:08:33,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2024-06-04 17:08:33,726 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36774193548387096 [2024-06-04 17:08:33,726 INFO L175 Difference]: Start difference. First operand has 280 places, 261 transitions, 3037 flow. Second operand 10 states and 114 transitions. [2024-06-04 17:08:33,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 275 transitions, 3613 flow [2024-06-04 17:08:33,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 275 transitions, 3443 flow, removed 18 selfloop flow, removed 10 redundant places. [2024-06-04 17:08:33,829 INFO L231 Difference]: Finished difference. Result has 280 places, 261 transitions, 2936 flow [2024-06-04 17:08:33,829 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2867, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2936, PETRI_PLACES=280, PETRI_TRANSITIONS=261} [2024-06-04 17:08:33,829 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 250 predicate places. [2024-06-04 17:08:33,829 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 261 transitions, 2936 flow [2024-06-04 17:08:33,830 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-04 17:08:33,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:08:33,830 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-04 17:08:33,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-04 17:08:33,830 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-04 17:08:33,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:08:33,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1839162242, now seen corresponding path program 1 times [2024-06-04 17:08:33,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:08:33,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358849030] [2024-06-04 17:08:33,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:08:33,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:08:33,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:08:39,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:08:39,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:08:39,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358849030] [2024-06-04 17:08:39,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358849030] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:08:39,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:08:39,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:08:39,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035468856] [2024-06-04 17:08:39,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:08:39,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:08:39,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:08:39,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:08:39,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:08:39,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:08:39,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 261 transitions, 2936 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-04 17:08:39,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:08:39,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:08:39,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:08:40,249 INFO L124 PetriNetUnfolderBase]: 738/1357 cut-off events. [2024-06-04 17:08:40,249 INFO L125 PetriNetUnfolderBase]: For 69950/69950 co-relation queries the response was YES. [2024-06-04 17:08:40,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8105 conditions, 1357 events. 738/1357 cut-off events. For 69950/69950 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 7678 event pairs, 133 based on Foata normal form. 8/1365 useless extension candidates. Maximal degree in co-relation 7993. Up to 746 conditions per place. [2024-06-04 17:08:40,258 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 200 selfloop transitions, 74 changer transitions 15/291 dead transitions. [2024-06-04 17:08:40,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 291 transitions, 3758 flow [2024-06-04 17:08:40,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:08:40,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:08:40,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 145 transitions. [2024-06-04 17:08:40,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4252199413489736 [2024-06-04 17:08:40,259 INFO L175 Difference]: Start difference. First operand has 280 places, 261 transitions, 2936 flow. Second operand 11 states and 145 transitions. [2024-06-04 17:08:40,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 291 transitions, 3758 flow [2024-06-04 17:08:40,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 291 transitions, 3441 flow, removed 12 selfloop flow, removed 11 redundant places. [2024-06-04 17:08:40,418 INFO L231 Difference]: Finished difference. Result has 280 places, 256 transitions, 2706 flow [2024-06-04 17:08:40,418 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2619, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2706, PETRI_PLACES=280, PETRI_TRANSITIONS=256} [2024-06-04 17:08:40,418 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 250 predicate places. [2024-06-04 17:08:40,418 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 256 transitions, 2706 flow [2024-06-04 17:08:40,418 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-04 17:08:40,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:08:40,419 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-04 17:08:40,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-06-04 17:08:40,419 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-04 17:08:40,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:08:40,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1489987466, now seen corresponding path program 2 times [2024-06-04 17:08:40,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:08:40,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824011082] [2024-06-04 17:08:40,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:08:40,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:08:40,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:08:46,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:08:46,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:08:46,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824011082] [2024-06-04 17:08:46,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824011082] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:08:46,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:08:46,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:08:46,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660933807] [2024-06-04 17:08:46,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:08:46,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:08:46,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:08:46,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:08:46,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:08:46,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:08:46,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 256 transitions, 2706 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-04 17:08:46,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:08:46,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:08:46,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:08:46,759 INFO L124 PetriNetUnfolderBase]: 747/1384 cut-off events. [2024-06-04 17:08:46,759 INFO L125 PetriNetUnfolderBase]: For 94703/94703 co-relation queries the response was YES. [2024-06-04 17:08:46,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8594 conditions, 1384 events. 747/1384 cut-off events. For 94703/94703 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 7858 event pairs, 142 based on Foata normal form. 8/1392 useless extension candidates. Maximal degree in co-relation 8482. Up to 949 conditions per place. [2024-06-04 17:08:46,772 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 198 selfloop transitions, 75 changer transitions 10/285 dead transitions. [2024-06-04 17:08:46,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 285 transitions, 3514 flow [2024-06-04 17:08:46,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:08:46,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:08:46,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2024-06-04 17:08:46,772 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4281524926686217 [2024-06-04 17:08:46,772 INFO L175 Difference]: Start difference. First operand has 280 places, 256 transitions, 2706 flow. Second operand 11 states and 146 transitions. [2024-06-04 17:08:46,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 285 transitions, 3514 flow [2024-06-04 17:08:46,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 285 transitions, 3351 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-04 17:08:46,970 INFO L231 Difference]: Finished difference. Result has 277 places, 253 transitions, 2661 flow [2024-06-04 17:08:46,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2545, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2661, PETRI_PLACES=277, PETRI_TRANSITIONS=253} [2024-06-04 17:08:46,970 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 247 predicate places. [2024-06-04 17:08:46,970 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 253 transitions, 2661 flow [2024-06-04 17:08:46,971 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-04 17:08:46,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:08:46,971 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-04 17:08:46,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-06-04 17:08:46,971 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-04 17:08:46,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:08:46,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1490107436, now seen corresponding path program 3 times [2024-06-04 17:08:46,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:08:46,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385820804] [2024-06-04 17:08:46,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:08:46,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:08:47,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:08:52,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:08:52,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:08:52,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385820804] [2024-06-04 17:08:52,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385820804] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:08:52,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:08:52,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:08:52,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834821920] [2024-06-04 17:08:52,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:08:52,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:08:52,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:08:52,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:08:52,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:08:52,826 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:08:52,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 253 transitions, 2661 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-04 17:08:52,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:08:52,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:08:52,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:08:53,306 INFO L124 PetriNetUnfolderBase]: 734/1361 cut-off events. [2024-06-04 17:08:53,306 INFO L125 PetriNetUnfolderBase]: For 94506/94506 co-relation queries the response was YES. [2024-06-04 17:08:53,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8328 conditions, 1361 events. 734/1361 cut-off events. For 94506/94506 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 7730 event pairs, 153 based on Foata normal form. 10/1371 useless extension candidates. Maximal degree in co-relation 8218. Up to 1005 conditions per place. [2024-06-04 17:08:53,319 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 189 selfloop transitions, 74 changer transitions 11/276 dead transitions. [2024-06-04 17:08:53,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 276 transitions, 3289 flow [2024-06-04 17:08:53,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:08:53,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:08:53,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2024-06-04 17:08:53,320 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4046920821114369 [2024-06-04 17:08:53,320 INFO L175 Difference]: Start difference. First operand has 277 places, 253 transitions, 2661 flow. Second operand 11 states and 138 transitions. [2024-06-04 17:08:53,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 276 transitions, 3289 flow [2024-06-04 17:08:53,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 276 transitions, 3138 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-04 17:08:53,481 INFO L231 Difference]: Finished difference. Result has 276 places, 250 transitions, 2631 flow [2024-06-04 17:08:53,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2510, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2631, PETRI_PLACES=276, PETRI_TRANSITIONS=250} [2024-06-04 17:08:53,481 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 246 predicate places. [2024-06-04 17:08:53,482 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 250 transitions, 2631 flow [2024-06-04 17:08:53,482 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-04 17:08:53,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:08:53,482 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-04 17:08:53,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-06-04 17:08:53,482 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-04 17:08:53,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:08:53,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1744086420, now seen corresponding path program 4 times [2024-06-04 17:08:53,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:08:53,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626604422] [2024-06-04 17:08:53,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:08:53,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:08:53,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:08:59,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-04 17:08:59,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:08:59,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626604422] [2024-06-04 17:08:59,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626604422] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:08:59,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:08:59,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:08:59,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426560487] [2024-06-04 17:08:59,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:08:59,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:08:59,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:08:59,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:08:59,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:08:59,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:08:59,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 250 transitions, 2631 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-04 17:08:59,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:08:59,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:08:59,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:08:59,843 INFO L124 PetriNetUnfolderBase]: 700/1295 cut-off events. [2024-06-04 17:08:59,844 INFO L125 PetriNetUnfolderBase]: For 71558/71558 co-relation queries the response was YES. [2024-06-04 17:08:59,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7544 conditions, 1295 events. 700/1295 cut-off events. For 71558/71558 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 7284 event pairs, 131 based on Foata normal form. 8/1303 useless extension candidates. Maximal degree in co-relation 7434. Up to 949 conditions per place. [2024-06-04 17:08:59,855 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 185 selfloop transitions, 69 changer transitions 16/272 dead transitions. [2024-06-04 17:08:59,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 272 transitions, 3237 flow [2024-06-04 17:08:59,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:08:59,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:08:59,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2024-06-04 17:08:59,856 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39589442815249265 [2024-06-04 17:08:59,856 INFO L175 Difference]: Start difference. First operand has 276 places, 250 transitions, 2631 flow. Second operand 11 states and 135 transitions. [2024-06-04 17:08:59,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 272 transitions, 3237 flow [2024-06-04 17:08:59,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 272 transitions, 3083 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-04 17:08:59,994 INFO L231 Difference]: Finished difference. Result has 275 places, 244 transitions, 2545 flow [2024-06-04 17:08:59,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2477, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2545, PETRI_PLACES=275, PETRI_TRANSITIONS=244} [2024-06-04 17:08:59,995 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 245 predicate places. [2024-06-04 17:08:59,995 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 244 transitions, 2545 flow [2024-06-04 17:08:59,995 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-04 17:08:59,995 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:08:59,996 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-04 17:08:59,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-06-04 17:08:59,996 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-04 17:08:59,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:08:59,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1678745514, now seen corresponding path program 5 times [2024-06-04 17:08:59,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:08:59,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772564423] [2024-06-04 17:08:59,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:08:59,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:09:00,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:09:05,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:09:05,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:09:05,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772564423] [2024-06-04 17:09:05,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772564423] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:09:05,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:09:05,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:09:05,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946301436] [2024-06-04 17:09:05,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:09:05,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:09:05,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:09:05,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:09:05,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:09:05,699 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:09:05,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 244 transitions, 2545 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-04 17:09:05,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:09:05,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:09:05,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:09:06,358 INFO L124 PetriNetUnfolderBase]: 717/1331 cut-off events. [2024-06-04 17:09:06,358 INFO L125 PetriNetUnfolderBase]: For 94480/94480 co-relation queries the response was YES. [2024-06-04 17:09:06,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8272 conditions, 1331 events. 717/1331 cut-off events. For 94480/94480 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 7510 event pairs, 134 based on Foata normal form. 8/1339 useless extension candidates. Maximal degree in co-relation 8162. Up to 1004 conditions per place. [2024-06-04 17:09:06,369 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 207 selfloop transitions, 55 changer transitions 7/271 dead transitions. [2024-06-04 17:09:06,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 271 transitions, 3319 flow [2024-06-04 17:09:06,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:09:06,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:09:06,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 143 transitions. [2024-06-04 17:09:06,370 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2024-06-04 17:09:06,370 INFO L175 Difference]: Start difference. First operand has 275 places, 244 transitions, 2545 flow. Second operand 11 states and 143 transitions. [2024-06-04 17:09:06,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 271 transitions, 3319 flow [2024-06-04 17:09:06,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 271 transitions, 3164 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-04 17:09:06,552 INFO L231 Difference]: Finished difference. Result has 270 places, 242 transitions, 2482 flow [2024-06-04 17:09:06,552 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2392, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2482, PETRI_PLACES=270, PETRI_TRANSITIONS=242} [2024-06-04 17:09:06,552 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 240 predicate places. [2024-06-04 17:09:06,552 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 242 transitions, 2482 flow [2024-06-04 17:09:06,552 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-04 17:09:06,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:09:06,552 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-04 17:09:06,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-06-04 17:09:06,553 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-04 17:09:06,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:09:06,553 INFO L85 PathProgramCache]: Analyzing trace with hash -818082396, now seen corresponding path program 6 times [2024-06-04 17:09:06,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:09:06,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591342840] [2024-06-04 17:09:06,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:09:06,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:09:06,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:09:12,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:09:12,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:09:12,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591342840] [2024-06-04 17:09:12,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591342840] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:09:12,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:09:12,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:09:12,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725885878] [2024-06-04 17:09:12,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:09:12,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:09:12,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:09:12,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:09:12,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:09:12,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:09:12,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 242 transitions, 2482 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-04 17:09:12,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:09:12,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:09:12,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:09:12,968 INFO L124 PetriNetUnfolderBase]: 686/1270 cut-off events. [2024-06-04 17:09:12,968 INFO L125 PetriNetUnfolderBase]: For 76145/76145 co-relation queries the response was YES. [2024-06-04 17:09:12,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7327 conditions, 1270 events. 686/1270 cut-off events. For 76145/76145 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 7132 event pairs, 125 based on Foata normal form. 10/1280 useless extension candidates. Maximal degree in co-relation 7218. Up to 1004 conditions per place. [2024-06-04 17:09:12,979 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 197 selfloop transitions, 52 changer transitions 13/264 dead transitions. [2024-06-04 17:09:12,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 264 transitions, 3082 flow [2024-06-04 17:09:12,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:09:12,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:09:12,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 137 transitions. [2024-06-04 17:09:12,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40175953079178883 [2024-06-04 17:09:12,980 INFO L175 Difference]: Start difference. First operand has 270 places, 242 transitions, 2482 flow. Second operand 11 states and 137 transitions. [2024-06-04 17:09:12,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 264 transitions, 3082 flow [2024-06-04 17:09:13,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 264 transitions, 2970 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-04 17:09:13,148 INFO L231 Difference]: Finished difference. Result has 270 places, 238 transitions, 2431 flow [2024-06-04 17:09:13,148 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2370, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2431, PETRI_PLACES=270, PETRI_TRANSITIONS=238} [2024-06-04 17:09:13,149 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 240 predicate places. [2024-06-04 17:09:13,149 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 238 transitions, 2431 flow [2024-06-04 17:09:13,149 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-04 17:09:13,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:09:13,149 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:09:13,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-06-04 17:09:13,149 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-04 17:09:13,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:09:13,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1883329136, now seen corresponding path program 7 times [2024-06-04 17:09:13,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:09:13,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299684155] [2024-06-04 17:09:13,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:09:13,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:09:13,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:09:19,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:09:19,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:09:19,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299684155] [2024-06-04 17:09:19,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299684155] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:09:19,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:09:19,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:09:19,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528559251] [2024-06-04 17:09:19,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:09:19,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:09:19,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:09:19,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:09:19,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:09:19,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:09:19,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 238 transitions, 2431 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-04 17:09:19,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:09:19,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:09:19,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:09:19,897 INFO L124 PetriNetUnfolderBase]: 677/1255 cut-off events. [2024-06-04 17:09:19,897 INFO L125 PetriNetUnfolderBase]: For 76101/76101 co-relation queries the response was YES. [2024-06-04 17:09:19,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7227 conditions, 1255 events. 677/1255 cut-off events. For 76101/76101 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 7010 event pairs, 125 based on Foata normal form. 10/1265 useless extension candidates. Maximal degree in co-relation 7118. Up to 986 conditions per place. [2024-06-04 17:09:19,908 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 193 selfloop transitions, 54 changer transitions 11/260 dead transitions. [2024-06-04 17:09:19,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 260 transitions, 3023 flow [2024-06-04 17:09:19,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:09:19,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:09:19,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2024-06-04 17:09:19,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4046920821114369 [2024-06-04 17:09:19,909 INFO L175 Difference]: Start difference. First operand has 270 places, 238 transitions, 2431 flow. Second operand 11 states and 138 transitions. [2024-06-04 17:09:19,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 260 transitions, 3023 flow [2024-06-04 17:09:20,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 260 transitions, 2909 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-04 17:09:20,053 INFO L231 Difference]: Finished difference. Result has 267 places, 235 transitions, 2398 flow [2024-06-04 17:09:20,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2317, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2398, PETRI_PLACES=267, PETRI_TRANSITIONS=235} [2024-06-04 17:09:20,054 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 237 predicate places. [2024-06-04 17:09:20,054 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 235 transitions, 2398 flow [2024-06-04 17:09:20,054 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-04 17:09:20,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:09:20,054 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-04 17:09:20,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-06-04 17:09:20,054 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-04 17:09:20,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:09:20,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1883333786, now seen corresponding path program 8 times [2024-06-04 17:09:20,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:09:20,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150420164] [2024-06-04 17:09:20,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:09:20,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:09:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:09:25,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:09:25,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:09:25,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150420164] [2024-06-04 17:09:25,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150420164] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:09:25,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:09:25,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:09:25,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734928940] [2024-06-04 17:09:25,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:09:25,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:09:25,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:09:25,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:09:25,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:09:26,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:09:26,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 235 transitions, 2398 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-04 17:09:26,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:09:26,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:09:26,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:09:26,582 INFO L124 PetriNetUnfolderBase]: 665/1235 cut-off events. [2024-06-04 17:09:26,582 INFO L125 PetriNetUnfolderBase]: For 71373/71373 co-relation queries the response was YES. [2024-06-04 17:09:26,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7113 conditions, 1235 events. 665/1235 cut-off events. For 71373/71373 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 6881 event pairs, 121 based on Foata normal form. 8/1243 useless extension candidates. Maximal degree in co-relation 7004. Up to 976 conditions per place. [2024-06-04 17:09:26,592 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 191 selfloop transitions, 52 changer transitions 11/256 dead transitions. [2024-06-04 17:09:26,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 256 transitions, 2968 flow [2024-06-04 17:09:26,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:09:26,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:09:26,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2024-06-04 17:09:26,593 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39589442815249265 [2024-06-04 17:09:26,593 INFO L175 Difference]: Start difference. First operand has 267 places, 235 transitions, 2398 flow. Second operand 11 states and 135 transitions. [2024-06-04 17:09:26,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 256 transitions, 2968 flow [2024-06-04 17:09:26,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 256 transitions, 2854 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-04 17:09:26,750 INFO L231 Difference]: Finished difference. Result has 266 places, 232 transitions, 2356 flow [2024-06-04 17:09:26,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2284, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2356, PETRI_PLACES=266, PETRI_TRANSITIONS=232} [2024-06-04 17:09:26,750 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 236 predicate places. [2024-06-04 17:09:26,750 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 232 transitions, 2356 flow [2024-06-04 17:09:26,750 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-04 17:09:26,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:09:26,751 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-04 17:09:26,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-06-04 17:09:26,751 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-04 17:09:26,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:09:26,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1883449106, now seen corresponding path program 9 times [2024-06-04 17:09:26,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:09:26,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731678782] [2024-06-04 17:09:26,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:09:26,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:09:26,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:09:32,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:09:32,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:09:32,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731678782] [2024-06-04 17:09:32,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731678782] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:09:32,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:09:32,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:09:32,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388774382] [2024-06-04 17:09:32,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:09:32,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:09:32,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:09:32,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:09:32,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:09:32,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:09:32,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 232 transitions, 2356 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-04 17:09:32,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:09:32,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:09:32,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:09:33,265 INFO L124 PetriNetUnfolderBase]: 658/1222 cut-off events. [2024-06-04 17:09:33,266 INFO L125 PetriNetUnfolderBase]: For 71351/71351 co-relation queries the response was YES. [2024-06-04 17:09:33,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7039 conditions, 1222 events. 658/1222 cut-off events. For 71351/71351 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 6764 event pairs, 119 based on Foata normal form. 8/1230 useless extension candidates. Maximal degree in co-relation 6930. Up to 958 conditions per place. [2024-06-04 17:09:33,275 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 188 selfloop transitions, 50 changer transitions 14/254 dead transitions. [2024-06-04 17:09:33,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 254 transitions, 2924 flow [2024-06-04 17:09:33,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:09:33,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:09:33,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2024-06-04 17:09:33,276 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39589442815249265 [2024-06-04 17:09:33,276 INFO L175 Difference]: Start difference. First operand has 266 places, 232 transitions, 2356 flow. Second operand 11 states and 135 transitions. [2024-06-04 17:09:33,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 254 transitions, 2924 flow [2024-06-04 17:09:33,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 254 transitions, 2812 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-04 17:09:33,430 INFO L231 Difference]: Finished difference. Result has 264 places, 228 transitions, 2289 flow [2024-06-04 17:09:33,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2244, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2289, PETRI_PLACES=264, PETRI_TRANSITIONS=228} [2024-06-04 17:09:33,431 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 234 predicate places. [2024-06-04 17:09:33,431 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 228 transitions, 2289 flow [2024-06-04 17:09:33,431 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-04 17:09:33,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:09:33,431 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-04 17:09:33,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-06-04 17:09:33,431 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-04 17:09:33,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:09:33,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1311928148, now seen corresponding path program 10 times [2024-06-04 17:09:33,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:09:33,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512802637] [2024-06-04 17:09:33,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:09:33,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:09:33,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:09:39,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:09:39,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:09:39,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512802637] [2024-06-04 17:09:39,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512802637] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:09:39,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:09:39,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:09:39,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592285263] [2024-06-04 17:09:39,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:09:39,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:09:39,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:09:39,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:09:39,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:09:39,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:09:39,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 228 transitions, 2289 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-04 17:09:39,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:09:39,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:09:39,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:09:40,488 INFO L124 PetriNetUnfolderBase]: 647/1199 cut-off events. [2024-06-04 17:09:40,488 INFO L125 PetriNetUnfolderBase]: For 71115/71115 co-relation queries the response was YES. [2024-06-04 17:09:40,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6911 conditions, 1199 events. 647/1199 cut-off events. For 71115/71115 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 6566 event pairs, 92 based on Foata normal form. 8/1207 useless extension candidates. Maximal degree in co-relation 6802. Up to 756 conditions per place. [2024-06-04 17:09:40,499 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 154 selfloop transitions, 77 changer transitions 18/251 dead transitions. [2024-06-04 17:09:40,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 251 transitions, 2855 flow [2024-06-04 17:09:40,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:09:40,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:09:40,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 129 transitions. [2024-06-04 17:09:40,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3782991202346041 [2024-06-04 17:09:40,500 INFO L175 Difference]: Start difference. First operand has 264 places, 228 transitions, 2289 flow. Second operand 11 states and 129 transitions. [2024-06-04 17:09:40,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 251 transitions, 2855 flow [2024-06-04 17:09:40,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 251 transitions, 2709 flow, removed 3 selfloop flow, removed 11 redundant places. [2024-06-04 17:09:40,655 INFO L231 Difference]: Finished difference. Result has 257 places, 223 transitions, 2255 flow [2024-06-04 17:09:40,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2143, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2255, PETRI_PLACES=257, PETRI_TRANSITIONS=223} [2024-06-04 17:09:40,656 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 227 predicate places. [2024-06-04 17:09:40,656 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 223 transitions, 2255 flow [2024-06-04 17:09:40,656 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-04 17:09:40,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:09:40,656 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-04 17:09:40,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-06-04 17:09:40,656 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-04 17:09:40,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:09:40,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1956000312, now seen corresponding path program 11 times [2024-06-04 17:09:40,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:09:40,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586166308] [2024-06-04 17:09:40,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:09:40,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:09:40,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:09:47,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:09:47,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:09:47,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586166308] [2024-06-04 17:09:47,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586166308] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:09:47,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:09:47,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:09:47,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183195903] [2024-06-04 17:09:47,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:09:47,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:09:47,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:09:47,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:09:47,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:09:47,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:09:47,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 223 transitions, 2255 flow. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:09:47,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:09:47,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:09:47,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:09:48,047 INFO L124 PetriNetUnfolderBase]: 666/1234 cut-off events. [2024-06-04 17:09:48,047 INFO L125 PetriNetUnfolderBase]: For 98316/98316 co-relation queries the response was YES. [2024-06-04 17:09:48,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7851 conditions, 1234 events. 666/1234 cut-off events. For 98316/98316 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 6711 event pairs, 132 based on Foata normal form. 8/1242 useless extension candidates. Maximal degree in co-relation 7743. Up to 637 conditions per place. [2024-06-04 17:09:48,058 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 168 selfloop transitions, 66 changer transitions 14/250 dead transitions. [2024-06-04 17:09:48,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 250 transitions, 2995 flow [2024-06-04 17:09:48,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:09:48,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:09:48,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 141 transitions. [2024-06-04 17:09:48,059 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41348973607038125 [2024-06-04 17:09:48,059 INFO L175 Difference]: Start difference. First operand has 257 places, 223 transitions, 2255 flow. Second operand 11 states and 141 transitions. [2024-06-04 17:09:48,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 250 transitions, 2995 flow [2024-06-04 17:09:48,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 250 transitions, 2778 flow, removed 3 selfloop flow, removed 11 redundant places. [2024-06-04 17:09:48,260 INFO L231 Difference]: Finished difference. Result has 250 places, 219 transitions, 2140 flow [2024-06-04 17:09:48,260 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2040, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2140, PETRI_PLACES=250, PETRI_TRANSITIONS=219} [2024-06-04 17:09:48,260 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 220 predicate places. [2024-06-04 17:09:48,260 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 219 transitions, 2140 flow [2024-06-04 17:09:48,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:09:48,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:09:48,260 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:09:48,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2024-06-04 17:09:48,261 INFO L420 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:09:48,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:09:48,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1065405256, now seen corresponding path program 12 times [2024-06-04 17:09:48,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:09:48,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230621683] [2024-06-04 17:09:48,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:09:48,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:09:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:09:54,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:09:54,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:09:54,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230621683] [2024-06-04 17:09:54,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230621683] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:09:54,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:09:54,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:09:54,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498696272] [2024-06-04 17:09:54,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:09:54,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:09:54,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:09:54,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:09:54,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:09:54,486 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:09:54,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 219 transitions, 2140 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-04 17:09:54,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:09:54,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:09:54,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:09:55,076 INFO L124 PetriNetUnfolderBase]: 665/1237 cut-off events. [2024-06-04 17:09:55,077 INFO L125 PetriNetUnfolderBase]: For 111452/111452 co-relation queries the response was YES. [2024-06-04 17:09:55,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8110 conditions, 1237 events. 665/1237 cut-off events. For 111452/111452 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 6709 event pairs, 133 based on Foata normal form. 8/1245 useless extension candidates. Maximal degree in co-relation 8004. Up to 936 conditions per place. [2024-06-04 17:09:55,088 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 174 selfloop transitions, 60 changer transitions 10/246 dead transitions. [2024-06-04 17:09:55,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 246 transitions, 2866 flow [2024-06-04 17:09:55,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:09:55,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:09:55,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 144 transitions. [2024-06-04 17:09:55,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-04 17:09:55,089 INFO L175 Difference]: Start difference. First operand has 250 places, 219 transitions, 2140 flow. Second operand 12 states and 144 transitions. [2024-06-04 17:09:55,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 246 transitions, 2866 flow [2024-06-04 17:09:55,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 246 transitions, 2799 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-04 17:09:55,298 INFO L231 Difference]: Finished difference. Result has 250 places, 216 transitions, 2174 flow [2024-06-04 17:09:55,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2075, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2174, PETRI_PLACES=250, PETRI_TRANSITIONS=216} [2024-06-04 17:09:55,299 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 220 predicate places. [2024-06-04 17:09:55,299 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 216 transitions, 2174 flow [2024-06-04 17:09:55,299 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-04 17:09:55,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:09:55,299 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-04 17:09:55,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2024-06-04 17:09:55,299 INFO L420 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:09:55,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:09:55,299 INFO L85 PathProgramCache]: Analyzing trace with hash 677641756, now seen corresponding path program 13 times [2024-06-04 17:09:55,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:09:55,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287683943] [2024-06-04 17:09:55,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:09:55,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:09:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:10:01,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:10:01,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:10:01,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287683943] [2024-06-04 17:10:01,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287683943] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:10:01,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:10:01,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:10:01,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965167845] [2024-06-04 17:10:01,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:10:01,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:10:01,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:10:01,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:10:01,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:10:01,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:10:01,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 216 transitions, 2174 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-04 17:10:01,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:10:01,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:10:01,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:10:01,735 INFO L124 PetriNetUnfolderBase]: 655/1219 cut-off events. [2024-06-04 17:10:01,735 INFO L125 PetriNetUnfolderBase]: For 111494/111494 co-relation queries the response was YES. [2024-06-04 17:10:01,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8091 conditions, 1219 events. 655/1219 cut-off events. For 111494/111494 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 6612 event pairs, 127 based on Foata normal form. 8/1227 useless extension candidates. Maximal degree in co-relation 7986. Up to 936 conditions per place. [2024-06-04 17:10:01,746 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 173 selfloop transitions, 60 changer transitions 7/242 dead transitions. [2024-06-04 17:10:01,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 242 transitions, 2890 flow [2024-06-04 17:10:01,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:10:01,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:10:01,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 141 transitions. [2024-06-04 17:10:01,747 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3790322580645161 [2024-06-04 17:10:01,747 INFO L175 Difference]: Start difference. First operand has 250 places, 216 transitions, 2174 flow. Second operand 12 states and 141 transitions. [2024-06-04 17:10:01,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 242 transitions, 2890 flow [2024-06-04 17:10:01,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 242 transitions, 2749 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-04 17:10:01,973 INFO L231 Difference]: Finished difference. Result has 248 places, 214 transitions, 2139 flow [2024-06-04 17:10:01,973 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2035, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2139, PETRI_PLACES=248, PETRI_TRANSITIONS=214} [2024-06-04 17:10:01,974 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 218 predicate places. [2024-06-04 17:10:01,974 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 214 transitions, 2139 flow [2024-06-04 17:10:01,974 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-04 17:10:01,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:10:01,974 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-04 17:10:01,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2024-06-04 17:10:01,974 INFO L420 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:10:01,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:10:01,974 INFO L85 PathProgramCache]: Analyzing trace with hash 677646406, now seen corresponding path program 14 times [2024-06-04 17:10:01,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:10:01,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364649451] [2024-06-04 17:10:01,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:10:01,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:10:02,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:10:08,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:10:08,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:10:08,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364649451] [2024-06-04 17:10:08,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364649451] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:10:08,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:10:08,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:10:08,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208558781] [2024-06-04 17:10:08,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:10:08,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:10:08,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:10:08,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:10:08,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:10:08,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:10:08,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 214 transitions, 2139 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-04 17:10:08,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:10:08,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:10:08,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:10:08,673 INFO L124 PetriNetUnfolderBase]: 624/1158 cut-off events. [2024-06-04 17:10:08,673 INFO L125 PetriNetUnfolderBase]: For 93256/93256 co-relation queries the response was YES. [2024-06-04 17:10:08,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7170 conditions, 1158 events. 624/1158 cut-off events. For 93256/93256 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 6205 event pairs, 118 based on Foata normal form. 10/1168 useless extension candidates. Maximal degree in co-relation 7066. Up to 936 conditions per place. [2024-06-04 17:10:08,683 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 159 selfloop transitions, 53 changer transitions 20/234 dead transitions. [2024-06-04 17:10:08,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 234 transitions, 2677 flow [2024-06-04 17:10:08,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:10:08,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:10:08,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 127 transitions. [2024-06-04 17:10:08,685 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3724340175953079 [2024-06-04 17:10:08,686 INFO L175 Difference]: Start difference. First operand has 248 places, 214 transitions, 2139 flow. Second operand 11 states and 127 transitions. [2024-06-04 17:10:08,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 234 transitions, 2677 flow [2024-06-04 17:10:08,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 234 transitions, 2555 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-04 17:10:08,887 INFO L231 Difference]: Finished difference. Result has 247 places, 207 transitions, 2050 flow [2024-06-04 17:10:08,887 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2017, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2050, PETRI_PLACES=247, PETRI_TRANSITIONS=207} [2024-06-04 17:10:08,887 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 217 predicate places. [2024-06-04 17:10:08,887 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 207 transitions, 2050 flow [2024-06-04 17:10:08,887 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-04 17:10:08,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:10:08,887 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-04 17:10:08,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2024-06-04 17:10:08,888 INFO L420 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:10:08,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:10:08,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1889465770, now seen corresponding path program 15 times [2024-06-04 17:10:08,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:10:08,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700618925] [2024-06-04 17:10:08,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:10:08,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:10:08,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:10:14,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:10:14,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:10:14,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700618925] [2024-06-04 17:10:14,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700618925] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:10:14,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:10:14,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:10:14,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125535928] [2024-06-04 17:10:14,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:10:14,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:10:14,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:10:14,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:10:14,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:10:14,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:10:14,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 207 transitions, 2050 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-04 17:10:14,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:10:14,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:10:14,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:10:15,405 INFO L124 PetriNetUnfolderBase]: 609/1124 cut-off events. [2024-06-04 17:10:15,405 INFO L125 PetriNetUnfolderBase]: For 88662/88662 co-relation queries the response was YES. [2024-06-04 17:10:15,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6984 conditions, 1124 events. 609/1124 cut-off events. For 88662/88662 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 5977 event pairs, 87 based on Foata normal form. 8/1132 useless extension candidates. Maximal degree in co-relation 6880. Up to 675 conditions per place. [2024-06-04 17:10:15,420 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 160 selfloop transitions, 63 changer transitions 12/237 dead transitions. [2024-06-04 17:10:15,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 237 transitions, 2768 flow [2024-06-04 17:10:15,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:10:15,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:10:15,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 145 transitions. [2024-06-04 17:10:15,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4252199413489736 [2024-06-04 17:10:15,421 INFO L175 Difference]: Start difference. First operand has 247 places, 207 transitions, 2050 flow. Second operand 11 states and 145 transitions. [2024-06-04 17:10:15,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 237 transitions, 2768 flow [2024-06-04 17:10:15,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 237 transitions, 2579 flow, removed 8 selfloop flow, removed 11 redundant places. [2024-06-04 17:10:15,575 INFO L231 Difference]: Finished difference. Result has 236 places, 204 transitions, 1965 flow [2024-06-04 17:10:15,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1867, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1965, PETRI_PLACES=236, PETRI_TRANSITIONS=204} [2024-06-04 17:10:15,576 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 206 predicate places. [2024-06-04 17:10:15,576 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 204 transitions, 1965 flow [2024-06-04 17:10:15,576 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-04 17:10:15,576 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:10:15,576 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-04 17:10:15,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2024-06-04 17:10:15,576 INFO L420 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:10:15,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:10:15,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1889581090, now seen corresponding path program 16 times [2024-06-04 17:10:15,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:10:15,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268193593] [2024-06-04 17:10:15,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:10:15,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:10:15,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:10:21,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:10:21,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:10:21,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268193593] [2024-06-04 17:10:21,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268193593] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:10:21,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:10:21,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:10:21,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802975366] [2024-06-04 17:10:21,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:10:21,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:10:21,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:10:21,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:10:21,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:10:21,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:10:21,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 204 transitions, 1965 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-04 17:10:21,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:10:21,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:10:21,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:10:22,069 INFO L124 PetriNetUnfolderBase]: 624/1155 cut-off events. [2024-06-04 17:10:22,069 INFO L125 PetriNetUnfolderBase]: For 108623/108623 co-relation queries the response was YES. [2024-06-04 17:10:22,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7644 conditions, 1155 events. 624/1155 cut-off events. For 108623/108623 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 6200 event pairs, 98 based on Foata normal form. 8/1163 useless extension candidates. Maximal degree in co-relation 7542. Up to 784 conditions per place. [2024-06-04 17:10:22,081 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 160 selfloop transitions, 63 changer transitions 8/233 dead transitions. [2024-06-04 17:10:22,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 233 transitions, 2667 flow [2024-06-04 17:10:22,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:10:22,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:10:22,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 145 transitions. [2024-06-04 17:10:22,082 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4252199413489736 [2024-06-04 17:10:22,082 INFO L175 Difference]: Start difference. First operand has 236 places, 204 transitions, 1965 flow. Second operand 11 states and 145 transitions. [2024-06-04 17:10:22,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 233 transitions, 2667 flow [2024-06-04 17:10:22,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 233 transitions, 2546 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-06-04 17:10:22,263 INFO L231 Difference]: Finished difference. Result has 234 places, 202 transitions, 1953 flow [2024-06-04 17:10:22,263 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1846, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1953, PETRI_PLACES=234, PETRI_TRANSITIONS=202} [2024-06-04 17:10:22,264 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 204 predicate places. [2024-06-04 17:10:22,264 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 202 transitions, 1953 flow [2024-06-04 17:10:22,264 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-04 17:10:22,264 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:10:22,264 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-04 17:10:22,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2024-06-04 17:10:22,264 INFO L420 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:10:22,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:10:22,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1889585740, now seen corresponding path program 17 times [2024-06-04 17:10:22,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:10:22,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392406799] [2024-06-04 17:10:22,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:10:22,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:10:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:10:28,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:10:28,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:10:28,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392406799] [2024-06-04 17:10:28,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392406799] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:10:28,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:10:28,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:10:28,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181864178] [2024-06-04 17:10:28,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:10:28,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:10:28,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:10:28,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:10:28,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:10:28,514 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:10:28,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 202 transitions, 1953 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-04 17:10:28,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:10:28,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:10:28,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:10:29,065 INFO L124 PetriNetUnfolderBase]: 593/1094 cut-off events. [2024-06-04 17:10:29,065 INFO L125 PetriNetUnfolderBase]: For 90915/90915 co-relation queries the response was YES. [2024-06-04 17:10:29,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6799 conditions, 1094 events. 593/1094 cut-off events. For 90915/90915 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 5801 event pairs, 89 based on Foata normal form. 10/1104 useless extension candidates. Maximal degree in co-relation 6698. Up to 784 conditions per place. [2024-06-04 17:10:29,074 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 150 selfloop transitions, 59 changer transitions 15/226 dead transitions. [2024-06-04 17:10:29,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 226 transitions, 2483 flow [2024-06-04 17:10:29,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:10:29,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:10:29,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 139 transitions. [2024-06-04 17:10:29,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40762463343108507 [2024-06-04 17:10:29,075 INFO L175 Difference]: Start difference. First operand has 234 places, 202 transitions, 1953 flow. Second operand 11 states and 139 transitions. [2024-06-04 17:10:29,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 226 transitions, 2483 flow [2024-06-04 17:10:29,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 226 transitions, 2355 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-04 17:10:29,217 INFO L231 Difference]: Finished difference. Result has 234 places, 197 transitions, 1885 flow [2024-06-04 17:10:29,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1825, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1885, PETRI_PLACES=234, PETRI_TRANSITIONS=197} [2024-06-04 17:10:29,217 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 204 predicate places. [2024-06-04 17:10:29,217 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 197 transitions, 1885 flow [2024-06-04 17:10:29,217 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-04 17:10:29,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:10:29,217 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-04 17:10:29,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2024-06-04 17:10:29,218 INFO L420 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:10:29,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:10:29,218 INFO L85 PathProgramCache]: Analyzing trace with hash 2066954844, now seen corresponding path program 1 times [2024-06-04 17:10:29,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:10:29,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131015307] [2024-06-04 17:10:29,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:10:29,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:10:29,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:10:35,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:10:35,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:10:35,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131015307] [2024-06-04 17:10:35,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131015307] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:10:35,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:10:35,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:10:35,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312025785] [2024-06-04 17:10:35,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:10:35,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:10:35,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:10:35,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:10:35,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:10:36,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:10:36,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 197 transitions, 1885 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-04 17:10:36,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:10:36,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:10:36,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:10:36,707 INFO L124 PetriNetUnfolderBase]: 569/1044 cut-off events. [2024-06-04 17:10:36,707 INFO L125 PetriNetUnfolderBase]: For 73117/73117 co-relation queries the response was YES. [2024-06-04 17:10:36,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6546 conditions, 1044 events. 569/1044 cut-off events. For 73117/73117 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 5462 event pairs, 87 based on Foata normal form. 2/1046 useless extension candidates. Maximal degree in co-relation 6445. Up to 828 conditions per place. [2024-06-04 17:10:36,716 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 164 selfloop transitions, 52 changer transitions 0/218 dead transitions. [2024-06-04 17:10:36,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 218 transitions, 2371 flow [2024-06-04 17:10:36,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-04 17:10:36,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-04 17:10:36,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 149 transitions. [2024-06-04 17:10:36,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.369727047146402 [2024-06-04 17:10:36,717 INFO L175 Difference]: Start difference. First operand has 234 places, 197 transitions, 1885 flow. Second operand 13 states and 149 transitions. [2024-06-04 17:10:36,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 218 transitions, 2371 flow [2024-06-04 17:10:36,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 218 transitions, 2236 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-06-04 17:10:36,861 INFO L231 Difference]: Finished difference. Result has 231 places, 198 transitions, 1868 flow [2024-06-04 17:10:36,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1750, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1868, PETRI_PLACES=231, PETRI_TRANSITIONS=198} [2024-06-04 17:10:36,861 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 201 predicate places. [2024-06-04 17:10:36,861 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 198 transitions, 1868 flow [2024-06-04 17:10:36,862 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-04 17:10:36,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:10:36,862 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-04 17:10:36,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2024-06-04 17:10:36,862 INFO L420 AbstractCegarLoop]: === Iteration 126 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:10:36,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:10:36,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1317641304, now seen corresponding path program 18 times [2024-06-04 17:10:36,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:10:36,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792817721] [2024-06-04 17:10:36,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:10:36,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:10:36,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:10:43,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:10:43,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:10:43,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792817721] [2024-06-04 17:10:43,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792817721] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:10:43,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:10:43,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:10:43,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39249631] [2024-06-04 17:10:43,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:10:43,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:10:43,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:10:43,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:10:43,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:10:43,178 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:10:43,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 198 transitions, 1868 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-04 17:10:43,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:10:43,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:10:43,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:10:43,893 INFO L124 PetriNetUnfolderBase]: 585/1080 cut-off events. [2024-06-04 17:10:43,893 INFO L125 PetriNetUnfolderBase]: For 90816/90816 co-relation queries the response was YES. [2024-06-04 17:10:43,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6646 conditions, 1080 events. 585/1080 cut-off events. For 90816/90816 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 5707 event pairs, 89 based on Foata normal form. 10/1090 useless extension candidates. Maximal degree in co-relation 6545. Up to 820 conditions per place. [2024-06-04 17:10:43,902 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 161 selfloop transitions, 50 changer transitions 11/224 dead transitions. [2024-06-04 17:10:43,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 224 transitions, 2394 flow [2024-06-04 17:10:43,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-04 17:10:43,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-04 17:10:43,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 162 transitions. [2024-06-04 17:10:43,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37327188940092165 [2024-06-04 17:10:43,905 INFO L175 Difference]: Start difference. First operand has 231 places, 198 transitions, 1868 flow. Second operand 14 states and 162 transitions. [2024-06-04 17:10:43,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 224 transitions, 2394 flow [2024-06-04 17:10:44,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 224 transitions, 2286 flow, removed 3 selfloop flow, removed 11 redundant places. [2024-06-04 17:10:44,057 INFO L231 Difference]: Finished difference. Result has 234 places, 195 transitions, 1824 flow [2024-06-04 17:10:44,058 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1760, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1824, PETRI_PLACES=234, PETRI_TRANSITIONS=195} [2024-06-04 17:10:44,058 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 204 predicate places. [2024-06-04 17:10:44,058 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 195 transitions, 1824 flow [2024-06-04 17:10:44,058 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-04 17:10:44,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:10:44,058 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-04 17:10:44,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2024-06-04 17:10:44,059 INFO L420 AbstractCegarLoop]: === Iteration 127 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:10:44,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:10:44,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1879872000, now seen corresponding path program 19 times [2024-06-04 17:10:44,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:10:44,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286040654] [2024-06-04 17:10:44,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:10:44,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:10:44,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:10:49,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:10:49,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:10:49,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286040654] [2024-06-04 17:10:49,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286040654] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:10:49,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:10:49,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:10:49,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964378665] [2024-06-04 17:10:49,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:10:49,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:10:49,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:10:49,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:10:49,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:10:50,126 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:10:50,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 195 transitions, 1824 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-04 17:10:50,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:10:50,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:10:50,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:10:50,780 INFO L124 PetriNetUnfolderBase]: 575/1066 cut-off events. [2024-06-04 17:10:50,780 INFO L125 PetriNetUnfolderBase]: For 93437/93437 co-relation queries the response was YES. [2024-06-04 17:10:50,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6563 conditions, 1066 events. 575/1066 cut-off events. For 93437/93437 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 5634 event pairs, 89 based on Foata normal form. 10/1076 useless extension candidates. Maximal degree in co-relation 6461. Up to 806 conditions per place. [2024-06-04 17:10:50,791 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 158 selfloop transitions, 48 changer transitions 11/219 dead transitions. [2024-06-04 17:10:50,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 219 transitions, 2336 flow [2024-06-04 17:10:50,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:10:50,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:10:50,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 146 transitions. [2024-06-04 17:10:50,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3924731182795699 [2024-06-04 17:10:50,792 INFO L175 Difference]: Start difference. First operand has 234 places, 195 transitions, 1824 flow. Second operand 12 states and 146 transitions. [2024-06-04 17:10:50,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 219 transitions, 2336 flow [2024-06-04 17:10:50,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 219 transitions, 2230 flow, removed 3 selfloop flow, removed 12 redundant places. [2024-06-04 17:10:50,958 INFO L231 Difference]: Finished difference. Result has 231 places, 192 transitions, 1778 flow [2024-06-04 17:10:50,959 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1718, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1778, PETRI_PLACES=231, PETRI_TRANSITIONS=192} [2024-06-04 17:10:50,959 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 201 predicate places. [2024-06-04 17:10:50,959 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 192 transitions, 1778 flow [2024-06-04 17:10:50,959 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-04 17:10:50,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:10:50,959 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-04 17:10:50,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2024-06-04 17:10:50,960 INFO L420 AbstractCegarLoop]: === Iteration 128 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:10:50,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:10:50,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1033985918, now seen corresponding path program 20 times [2024-06-04 17:10:50,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:10:50,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426980207] [2024-06-04 17:10:50,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:10:50,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:10:50,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:10:56,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:10:56,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:10:56,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426980207] [2024-06-04 17:10:56,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426980207] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:10:56,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:10:56,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:10:56,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527124340] [2024-06-04 17:10:56,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:10:56,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:10:56,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:10:56,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:10:56,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:10:56,994 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:10:56,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 192 transitions, 1778 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-04 17:10:56,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:10:56,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:10:56,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:10:57,559 INFO L124 PetriNetUnfolderBase]: 590/1102 cut-off events. [2024-06-04 17:10:57,559 INFO L125 PetriNetUnfolderBase]: For 111555/111555 co-relation queries the response was YES. [2024-06-04 17:10:57,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7286 conditions, 1102 events. 590/1102 cut-off events. For 111555/111555 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 5880 event pairs, 96 based on Foata normal form. 8/1110 useless extension candidates. Maximal degree in co-relation 7184. Up to 745 conditions per place. [2024-06-04 17:10:57,568 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 158 selfloop transitions, 54 changer transitions 7/221 dead transitions. [2024-06-04 17:10:57,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 221 transitions, 2456 flow [2024-06-04 17:10:57,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:10:57,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:10:57,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 145 transitions. [2024-06-04 17:10:57,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4252199413489736 [2024-06-04 17:10:57,569 INFO L175 Difference]: Start difference. First operand has 231 places, 192 transitions, 1778 flow. Second operand 11 states and 145 transitions. [2024-06-04 17:10:57,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 221 transitions, 2456 flow [2024-06-04 17:10:57,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 221 transitions, 2352 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-04 17:10:57,744 INFO L231 Difference]: Finished difference. Result has 229 places, 190 transitions, 1762 flow [2024-06-04 17:10:57,744 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1676, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1762, PETRI_PLACES=229, PETRI_TRANSITIONS=190} [2024-06-04 17:10:57,745 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 199 predicate places. [2024-06-04 17:10:57,745 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 190 transitions, 1762 flow [2024-06-04 17:10:57,745 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-04 17:10:57,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:10:57,745 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-04 17:10:57,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2024-06-04 17:10:57,746 INFO L420 AbstractCegarLoop]: === Iteration 129 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:10:57,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:10:57,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1894054390, now seen corresponding path program 21 times [2024-06-04 17:10:57,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:10:57,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078799633] [2024-06-04 17:10:57,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:10:57,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:10:57,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:11:03,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:11:03,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:11:03,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078799633] [2024-06-04 17:11:03,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078799633] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:11:03,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:11:03,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:11:03,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588720542] [2024-06-04 17:11:03,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:11:03,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:11:03,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:11:03,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:11:03,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:11:03,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:11:03,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 190 transitions, 1762 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-04 17:11:03,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:11:03,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:11:03,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:11:03,941 INFO L124 PetriNetUnfolderBase]: 588/1100 cut-off events. [2024-06-04 17:11:03,941 INFO L125 PetriNetUnfolderBase]: For 116207/116207 co-relation queries the response was YES. [2024-06-04 17:11:03,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7283 conditions, 1100 events. 588/1100 cut-off events. For 116207/116207 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5895 event pairs, 100 based on Foata normal form. 10/1110 useless extension candidates. Maximal degree in co-relation 7181. Up to 810 conditions per place. [2024-06-04 17:11:03,950 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 150 selfloop transitions, 51 changer transitions 12/215 dead transitions. [2024-06-04 17:11:03,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 215 transitions, 2270 flow [2024-06-04 17:11:03,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:11:03,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:11:03,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 142 transitions. [2024-06-04 17:11:03,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41642228739002934 [2024-06-04 17:11:03,951 INFO L175 Difference]: Start difference. First operand has 229 places, 190 transitions, 1762 flow. Second operand 11 states and 142 transitions. [2024-06-04 17:11:03,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 215 transitions, 2270 flow [2024-06-04 17:11:04,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 215 transitions, 2162 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-04 17:11:04,174 INFO L231 Difference]: Finished difference. Result has 229 places, 186 transitions, 1700 flow [2024-06-04 17:11:04,174 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1654, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1700, PETRI_PLACES=229, PETRI_TRANSITIONS=186} [2024-06-04 17:11:04,174 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 199 predicate places. [2024-06-04 17:11:04,175 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 186 transitions, 1700 flow [2024-06-04 17:11:04,175 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-04 17:11:04,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:11:04,175 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-04 17:11:04,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2024-06-04 17:11:04,175 INFO L420 AbstractCegarLoop]: === Iteration 130 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:11:04,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:11:04,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1894227370, now seen corresponding path program 22 times [2024-06-04 17:11:04,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:11:04,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983856301] [2024-06-04 17:11:04,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:11:04,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:11:04,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:11:09,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:11:09,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:11:09,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983856301] [2024-06-04 17:11:09,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983856301] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:11:09,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:11:09,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:11:09,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500143879] [2024-06-04 17:11:09,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:11:09,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:11:09,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:11:09,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:11:09,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:11:09,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:11:09,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 186 transitions, 1700 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-04 17:11:09,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:11:09,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:11:09,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:11:10,406 INFO L124 PetriNetUnfolderBase]: 550/1026 cut-off events. [2024-06-04 17:11:10,407 INFO L125 PetriNetUnfolderBase]: For 93323/93323 co-relation queries the response was YES. [2024-06-04 17:11:10,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6299 conditions, 1026 events. 550/1026 cut-off events. For 93323/93323 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 5427 event pairs, 91 based on Foata normal form. 10/1036 useless extension candidates. Maximal degree in co-relation 6197. Up to 767 conditions per place. [2024-06-04 17:11:10,415 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 151 selfloop transitions, 45 changer transitions 11/209 dead transitions. [2024-06-04 17:11:10,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 209 transitions, 2192 flow [2024-06-04 17:11:10,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:11:10,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:11:10,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2024-06-04 17:11:10,416 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39882697947214074 [2024-06-04 17:11:10,416 INFO L175 Difference]: Start difference. First operand has 229 places, 186 transitions, 1700 flow. Second operand 11 states and 136 transitions. [2024-06-04 17:11:10,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 209 transitions, 2192 flow [2024-06-04 17:11:10,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 209 transitions, 2080 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-06-04 17:11:10,570 INFO L231 Difference]: Finished difference. Result has 227 places, 183 transitions, 1638 flow [2024-06-04 17:11:10,571 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1588, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1638, PETRI_PLACES=227, PETRI_TRANSITIONS=183} [2024-06-04 17:11:10,571 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 197 predicate places. [2024-06-04 17:11:10,571 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 183 transitions, 1638 flow [2024-06-04 17:11:10,571 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-04 17:11:10,571 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:11:10,571 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-04 17:11:10,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2024-06-04 17:11:10,571 INFO L420 AbstractCegarLoop]: === Iteration 131 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:11:10,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:11:10,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1894234314, now seen corresponding path program 2 times [2024-06-04 17:11:10,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:11:10,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5052309] [2024-06-04 17:11:10,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:11:10,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:11:10,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15