./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix034_pso.opt_tso.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix034_pso.opt_tso.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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/mix034_pso.opt_tso.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix034_pso.opt_tso.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-04 17:13:39,998 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-04 17:13:40,084 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-04 17:13:40,087 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-04 17:13:40,087 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-04 17:13:40,102 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-04 17:13:40,103 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-04 17:13:40,103 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-04 17:13:40,103 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-04 17:13:40,104 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-04 17:13:40,104 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-04 17:13:40,104 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-04 17:13:40,105 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-04 17:13:40,105 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-04 17:13:40,105 INFO L153 SettingsManager]: * Use SBE=true [2024-06-04 17:13:40,105 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-04 17:13:40,108 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-04 17:13:40,109 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-04 17:13:40,110 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-04 17:13:40,111 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-04 17:13:40,111 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-04 17:13:40,112 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-04 17:13:40,112 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-04 17:13:40,112 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-04 17:13:40,112 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-04 17:13:40,113 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-04 17:13:40,113 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-04 17:13:40,113 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-04 17:13:40,113 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-04 17:13:40,114 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-04 17:13:40,114 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-04 17:13:40,115 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-04 17:13:40,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 17:13:40,115 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-04 17:13:40,115 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-04 17:13:40,115 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-04 17:13:40,116 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-04 17:13:40,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-04 17:13:40,116 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-04 17:13:40,116 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-04 17:13:40,116 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-04 17:13:40,117 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-04 17:13:40,117 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-04 17:13:40,117 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 17:13:40,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-04 17:13:40,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-04 17:13:40,365 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-04 17:13:40,366 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-04 17:13:40,367 INFO L274 PluginConnector]: CDTParser initialized [2024-06-04 17:13:40,368 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix034_pso.opt_tso.opt.i [2024-06-04 17:13:41,376 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-04 17:13:41,567 INFO L384 CDTParser]: Found 1 translation units. [2024-06-04 17:13:41,568 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_pso.opt_tso.opt.i [2024-06-04 17:13:41,582 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff72a8277/f81bc1ad7d54409aa484c080e2354e14/FLAG2341cd581 [2024-06-04 17:13:41,593 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff72a8277/f81bc1ad7d54409aa484c080e2354e14 [2024-06-04 17:13:41,595 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-04 17:13:41,596 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-04 17:13:41,596 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/mutex-meet/mix034_pso.opt_tso.opt.yml/witness.yml [2024-06-04 17:13:41,745 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-04 17:13:41,746 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-04 17:13:41,748 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-04 17:13:41,748 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-04 17:13:41,752 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-04 17:13:41,752 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 05:13:41" (1/2) ... [2024-06-04 17:13:41,754 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a94f7d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:13:41, skipping insertion in model container [2024-06-04 17:13:41,754 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 05:13:41" (1/2) ... [2024-06-04 17:13:41,755 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4c615e5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:13:41, skipping insertion in model container [2024-06-04 17:13:41,755 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:13:41" (2/2) ... [2024-06-04 17:13:41,756 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a94f7d5 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:13:41, skipping insertion in model container [2024-06-04 17:13:41,756 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:13:41" (2/2) ... [2024-06-04 17:13:41,757 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-04 17:13:41,807 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-04 17:13:41,808 INFO L97 edCorrectnessWitness]: Location invariant before [L816-L816] (((((((((((((((((! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1))) [2024-06-04 17:13:41,809 INFO L97 edCorrectnessWitness]: Location invariant before [L817-L817] (((((((((((((((((! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1))) [2024-06-04 17:13:41,809 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-04 17:13:41,809 INFO L106 edCorrectnessWitness]: ghost_update [L814-L814] multithreaded = 1; [2024-06-04 17:13:41,846 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-04 17:13:42,133 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 17:13:42,144 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-04 17:13:42,389 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 17:13:42,424 INFO L206 MainTranslator]: Completed translation [2024-06-04 17:13:42,424 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:13:42 WrapperNode [2024-06-04 17:13:42,424 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-04 17:13:42,425 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-04 17:13:42,425 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-04 17:13:42,425 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-04 17:13:42,431 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 05:13:42" (1/1) ... [2024-06-04 17:13:42,460 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 05:13:42" (1/1) ... [2024-06-04 17:13:42,517 INFO L138 Inliner]: procedures = 174, calls = 38, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 121 [2024-06-04 17:13:42,517 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-04 17:13:42,518 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-04 17:13:42,518 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-04 17:13:42,518 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-04 17:13:42,526 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 05:13:42" (1/1) ... [2024-06-04 17:13:42,526 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 05:13:42" (1/1) ... [2024-06-04 17:13:42,533 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 05:13:42" (1/1) ... [2024-06-04 17:13:42,553 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 17:13:42,553 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 05:13:42" (1/1) ... [2024-06-04 17:13:42,553 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 05:13:42" (1/1) ... [2024-06-04 17:13:42,571 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 05:13:42" (1/1) ... [2024-06-04 17:13:42,573 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 05:13:42" (1/1) ... [2024-06-04 17:13:42,578 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 05:13:42" (1/1) ... [2024-06-04 17:13:42,584 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 05:13:42" (1/1) ... [2024-06-04 17:13:42,596 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-04 17:13:42,597 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-04 17:13:42,597 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-04 17:13:42,597 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-04 17:13:42,598 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 05:13:42" (1/1) ... [2024-06-04 17:13:42,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 17:13:42,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 17:13:42,621 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 17:13:42,635 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 17:13:42,653 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-04 17:13:42,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-04 17:13:42,654 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-04 17:13:42,654 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-04 17:13:42,654 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-04 17:13:42,654 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-04 17:13:42,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-04 17:13:42,654 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-04 17:13:42,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-04 17:13:42,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-04 17:13:42,656 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 17:13:42,769 INFO L244 CfgBuilder]: Building ICFG [2024-06-04 17:13:42,771 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-04 17:13:43,409 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-04 17:13:43,409 INFO L293 CfgBuilder]: Performing block encoding [2024-06-04 17:13:43,572 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-04 17:13:43,572 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-04 17:13:43,577 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 05:13:43 BoogieIcfgContainer [2024-06-04 17:13:43,578 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-04 17:13:43,580 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-04 17:13:43,580 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-04 17:13:43,582 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-04 17:13:43,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 05:13:41" (1/4) ... [2024-06-04 17:13:43,583 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49dbf75d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 05:13:43, skipping insertion in model container [2024-06-04 17:13:43,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:13:41" (2/4) ... [2024-06-04 17:13:43,584 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49dbf75d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 05:13:43, skipping insertion in model container [2024-06-04 17:13:43,584 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 05:13:42" (3/4) ... [2024-06-04 17:13:43,584 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49dbf75d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 05:13:43, skipping insertion in model container [2024-06-04 17:13:43,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 05:13:43" (4/4) ... [2024-06-04 17:13:43,586 INFO L112 eAbstractionObserver]: Analyzing ICFG mix034_pso.opt_tso.opt.i [2024-06-04 17:13:43,599 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-04 17:13:43,599 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-04 17:13:43,599 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-04 17:13:43,654 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-04 17:13:43,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 32 transitions, 72 flow [2024-06-04 17:13:43,727 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2024-06-04 17:13:43,742 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 17:13:43,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 30 events. 0/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-04 17:13:43,744 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 32 transitions, 72 flow [2024-06-04 17:13:43,746 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 24 transitions, 54 flow [2024-06-04 17:13:43,770 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 17:13:43,775 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;@4f3a2b16, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 17:13:43,775 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-04 17:13:43,780 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 17:13:43,780 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-04 17:13:43,780 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 17:13:43,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:13:43,781 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-04 17:13:43,781 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 17:13:43,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:13:43,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1491071914, now seen corresponding path program 1 times [2024-06-04 17:13:43,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:13:43,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755870479] [2024-06-04 17:13:43,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:13:43,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:13:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:13:47,406 INFO 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:13:47,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:13:47,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755870479] [2024-06-04 17:13:47,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755870479] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:13:47,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:13:47,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-04 17:13:47,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644234765] [2024-06-04 17:13:47,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:13:47,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-04 17:13:47,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:13:47,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-04 17:13:47,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-04 17:13:47,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2024-06-04 17:13:47,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:13:47,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:13:47,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2024-06-04 17:13:47,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:13:47,691 INFO L124 PetriNetUnfolderBase]: 131/265 cut-off events. [2024-06-04 17:13:47,692 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-04 17:13:47,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 523 conditions, 265 events. 131/265 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1002 event pairs, 75 based on Foata normal form. 1/253 useless extension candidates. Maximal degree in co-relation 509. Up to 235 conditions per place. [2024-06-04 17:13:47,697 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 22 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2024-06-04 17:13:47,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 119 flow [2024-06-04 17:13:47,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-04 17:13:47,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-04 17:13:47,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2024-06-04 17:13:47,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.59375 [2024-06-04 17:13:47,707 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 54 flow. Second operand 3 states and 57 transitions. [2024-06-04 17:13:47,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 119 flow [2024-06-04 17:13:47,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 30 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-04 17:13:47,710 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 73 flow [2024-06-04 17:13:47,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2024-06-04 17:13:47,714 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 1 predicate places. [2024-06-04 17:13:47,714 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 73 flow [2024-06-04 17:13:47,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:13:47,715 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:13:47,715 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:13:47,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-04 17:13:47,715 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 17:13:47,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:13:47,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1598758531, now seen corresponding path program 1 times [2024-06-04 17:13:47,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:13:47,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841772556] [2024-06-04 17:13:47,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:13:47,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:13:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:13:50,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:13:50,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:13:50,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841772556] [2024-06-04 17:13:50,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841772556] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:13:50,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:13:50,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 17:13:50,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369515456] [2024-06-04 17:13:50,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:13:50,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 17:13:50,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:13:50,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 17:13:50,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-04 17:13:50,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-04 17:13:50,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 73 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:13:50,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:13:50,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-04 17:13:50,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:13:50,440 INFO L124 PetriNetUnfolderBase]: 150/291 cut-off events. [2024-06-04 17:13:50,441 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2024-06-04 17:13:50,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 661 conditions, 291 events. 150/291 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1099 event pairs, 68 based on Foata normal form. 2/287 useless extension candidates. Maximal degree in co-relation 646. Up to 258 conditions per place. [2024-06-04 17:13:50,443 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 27 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2024-06-04 17:13:50,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 163 flow [2024-06-04 17:13:50,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 17:13:50,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 17:13:50,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2024-06-04 17:13:50,445 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.546875 [2024-06-04 17:13:50,445 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 73 flow. Second operand 4 states and 70 transitions. [2024-06-04 17:13:50,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 163 flow [2024-06-04 17:13:50,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 36 transitions, 160 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-04 17:13:50,447 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 97 flow [2024-06-04 17:13:50,447 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=97, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2024-06-04 17:13:50,448 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2024-06-04 17:13:50,448 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 97 flow [2024-06-04 17:13:50,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:13:50,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:13:50,448 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:13:50,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-04 17:13:50,449 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 17:13:50,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:13:50,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1972731897, now seen corresponding path program 1 times [2024-06-04 17:13:50,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:13:50,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716751188] [2024-06-04 17:13:50,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:13:50,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:13:50,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:13:53,756 INFO 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:13:53,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:13:53,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716751188] [2024-06-04 17:13:53,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716751188] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:13:53,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:13:53,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 17:13:53,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784446152] [2024-06-04 17:13:53,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:13:53,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 17:13:53,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:13:53,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 17:13:53,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-04 17:13:53,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-04 17:13:53,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 97 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:13:53,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:13:53,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-04 17:13:53,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:13:54,084 INFO L124 PetriNetUnfolderBase]: 147/288 cut-off events. [2024-06-04 17:13:54,084 INFO L125 PetriNetUnfolderBase]: For 166/166 co-relation queries the response was YES. [2024-06-04 17:13:54,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 288 events. 147/288 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1085 event pairs, 47 based on Foata normal form. 2/286 useless extension candidates. Maximal degree in co-relation 709. Up to 244 conditions per place. [2024-06-04 17:13:54,086 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 31 selfloop transitions, 7 changer transitions 0/42 dead transitions. [2024-06-04 17:13:54,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 42 transitions, 211 flow [2024-06-04 17:13:54,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 17:13:54,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 17:13:54,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2024-06-04 17:13:54,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.53125 [2024-06-04 17:13:54,088 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 97 flow. Second operand 5 states and 85 transitions. [2024-06-04 17:13:54,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 42 transitions, 211 flow [2024-06-04 17:13:54,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 202 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-04 17:13:54,090 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 121 flow [2024-06-04 17:13:54,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2024-06-04 17:13:54,091 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2024-06-04 17:13:54,091 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 121 flow [2024-06-04 17:13:54,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:13:54,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:13:54,092 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:13:54,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-04 17:13:54,092 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 17:13:54,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:13:54,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1714814456, now seen corresponding path program 1 times [2024-06-04 17:13:54,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:13:54,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693854134] [2024-06-04 17:13:54,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:13:54,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:13:54,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:13:57,405 INFO 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:13:57,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:13:57,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693854134] [2024-06-04 17:13:57,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693854134] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:13:57,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:13:57,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 17:13:57,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196913906] [2024-06-04 17:13:57,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:13:57,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 17:13:57,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:13:57,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 17:13:57,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-04 17:13:57,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-04 17:13:57,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 121 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:13:57,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:13:57,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-04 17:13:57,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:13:57,810 INFO L124 PetriNetUnfolderBase]: 143/278 cut-off events. [2024-06-04 17:13:57,810 INFO L125 PetriNetUnfolderBase]: For 274/274 co-relation queries the response was YES. [2024-06-04 17:13:57,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 766 conditions, 278 events. 143/278 cut-off events. For 274/274 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1021 event pairs, 25 based on Foata normal form. 4/276 useless extension candidates. Maximal degree in co-relation 748. Up to 218 conditions per place. [2024-06-04 17:13:57,812 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 31 selfloop transitions, 8 changer transitions 0/43 dead transitions. [2024-06-04 17:13:57,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 43 transitions, 225 flow [2024-06-04 17:13:57,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:13:57,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:13:57,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2024-06-04 17:13:57,814 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4947916666666667 [2024-06-04 17:13:57,814 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 121 flow. Second operand 6 states and 95 transitions. [2024-06-04 17:13:57,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 43 transitions, 225 flow [2024-06-04 17:13:57,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 210 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-04 17:13:57,816 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 118 flow [2024-06-04 17:13:57,816 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=118, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2024-06-04 17:13:57,817 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2024-06-04 17:13:57,817 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 118 flow [2024-06-04 17:13:57,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:13:57,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:13:57,817 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:13:57,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-04 17:13:57,818 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:13:57,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:13:57,818 INFO L85 PathProgramCache]: Analyzing trace with hash 983479153, now seen corresponding path program 1 times [2024-06-04 17:13:57,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:13:57,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353581506] [2024-06-04 17:13:57,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:13:57,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:13:57,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:14:01,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:14:01,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:14:01,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353581506] [2024-06-04 17:14:01,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353581506] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:14:01,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:14:01,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 17:14:01,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397529456] [2024-06-04 17:14:01,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:14:01,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 17:14:01,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:14:01,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 17:14:01,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-04 17:14:02,040 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-04 17:14:02,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 118 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:14:02,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:14:02,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-04 17:14:02,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:14:02,225 INFO L124 PetriNetUnfolderBase]: 119/248 cut-off events. [2024-06-04 17:14:02,225 INFO L125 PetriNetUnfolderBase]: For 340/340 co-relation queries the response was YES. [2024-06-04 17:14:02,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 702 conditions, 248 events. 119/248 cut-off events. For 340/340 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 915 event pairs, 34 based on Foata normal form. 1/243 useless extension candidates. Maximal degree in co-relation 683. Up to 211 conditions per place. [2024-06-04 17:14:02,226 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 25 selfloop transitions, 6 changer transitions 0/36 dead transitions. [2024-06-04 17:14:02,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 36 transitions, 198 flow [2024-06-04 17:14:02,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 17:14:02,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 17:14:02,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2024-06-04 17:14:02,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45625 [2024-06-04 17:14:02,229 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 118 flow. Second operand 5 states and 73 transitions. [2024-06-04 17:14:02,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 36 transitions, 198 flow [2024-06-04 17:14:02,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 36 transitions, 178 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-04 17:14:02,231 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 125 flow [2024-06-04 17:14:02,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2024-06-04 17:14:02,232 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 10 predicate places. [2024-06-04 17:14:02,232 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 125 flow [2024-06-04 17:14:02,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:14:02,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:14:02,232 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:14:02,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-04 17:14:02,233 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 17:14:02,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:14:02,233 INFO L85 PathProgramCache]: Analyzing trace with hash 396271573, now seen corresponding path program 1 times [2024-06-04 17:14:02,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:14:02,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721632509] [2024-06-04 17:14:02,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:14:02,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:14:02,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:14:06,765 INFO 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:14:06,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:14:06,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721632509] [2024-06-04 17:14:06,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721632509] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:14:06,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:14:06,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:14:06,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730100169] [2024-06-04 17:14:06,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:14:06,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:14:06,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:14:06,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:14:06,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:14:06,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:14:06,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 125 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:14:06,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:14:06,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:14:06,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:14:07,035 INFO L124 PetriNetUnfolderBase]: 139/276 cut-off events. [2024-06-04 17:14:07,035 INFO L125 PetriNetUnfolderBase]: For 509/509 co-relation queries the response was YES. [2024-06-04 17:14:07,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 827 conditions, 276 events. 139/276 cut-off events. For 509/509 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1009 event pairs, 41 based on Foata normal form. 1/276 useless extension candidates. Maximal degree in co-relation 806. Up to 242 conditions per place. [2024-06-04 17:14:07,037 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 27 selfloop transitions, 8 changer transitions 0/39 dead transitions. [2024-06-04 17:14:07,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 39 transitions, 217 flow [2024-06-04 17:14:07,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:14:07,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:14:07,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2024-06-04 17:14:07,038 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-04 17:14:07,038 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 125 flow. Second operand 6 states and 80 transitions. [2024-06-04 17:14:07,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 39 transitions, 217 flow [2024-06-04 17:14:07,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 39 transitions, 206 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-04 17:14:07,040 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 147 flow [2024-06-04 17:14:07,040 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=147, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2024-06-04 17:14:07,041 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 13 predicate places. [2024-06-04 17:14:07,041 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 147 flow [2024-06-04 17:14:07,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:14:07,042 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:14:07,042 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:14:07,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-04 17:14:07,042 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 17:14:07,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:14:07,042 INFO L85 PathProgramCache]: Analyzing trace with hash -606204148, now seen corresponding path program 1 times [2024-06-04 17:14:07,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:14:07,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71230335] [2024-06-04 17:14:07,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:14:07,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:14:07,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:14:11,364 INFO 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:14:11,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:14:11,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71230335] [2024-06-04 17:14:11,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71230335] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:14:11,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:14:11,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:14:11,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214560207] [2024-06-04 17:14:11,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:14:11,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:14:11,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:14:11,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:14:11,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:14:11,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:14:11,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 147 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:14:11,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:14:11,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:14:11,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:14:11,739 INFO L124 PetriNetUnfolderBase]: 156/300 cut-off events. [2024-06-04 17:14:11,739 INFO L125 PetriNetUnfolderBase]: For 844/844 co-relation queries the response was YES. [2024-06-04 17:14:11,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 983 conditions, 300 events. 156/300 cut-off events. For 844/844 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1113 event pairs, 46 based on Foata normal form. 2/301 useless extension candidates. Maximal degree in co-relation 961. Up to 255 conditions per place. [2024-06-04 17:14:11,741 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 32 selfloop transitions, 8 changer transitions 0/45 dead transitions. [2024-06-04 17:14:11,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 45 transitions, 261 flow [2024-06-04 17:14:11,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:14:11,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:14:11,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2024-06-04 17:14:11,744 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-04 17:14:11,744 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 147 flow. Second operand 6 states and 84 transitions. [2024-06-04 17:14:11,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 45 transitions, 261 flow [2024-06-04 17:14:11,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 45 transitions, 244 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-04 17:14:11,748 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 163 flow [2024-06-04 17:14:11,748 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=163, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2024-06-04 17:14:11,749 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 15 predicate places. [2024-06-04 17:14:11,749 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 163 flow [2024-06-04 17:14:11,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:14:11,749 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:14:11,749 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:14:11,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-04 17:14:11,750 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 17:14:11,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:14:11,750 INFO L85 PathProgramCache]: Analyzing trace with hash 230678672, now seen corresponding path program 2 times [2024-06-04 17:14:11,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:14:11,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679909830] [2024-06-04 17:14:11,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:14:11,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:14:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:14:16,175 INFO 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:14:16,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:14:16,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679909830] [2024-06-04 17:14:16,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679909830] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:14:16,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:14:16,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:14:16,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076014976] [2024-06-04 17:14:16,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:14:16,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:14:16,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:14:16,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:14:16,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:14:16,270 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:14:16,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 163 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:14:16,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:14:16,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:14:16,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:14:16,455 INFO L124 PetriNetUnfolderBase]: 157/305 cut-off events. [2024-06-04 17:14:16,455 INFO L125 PetriNetUnfolderBase]: For 1121/1123 co-relation queries the response was YES. [2024-06-04 17:14:16,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1062 conditions, 305 events. 157/305 cut-off events. For 1121/1123 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1147 event pairs, 50 based on Foata normal form. 4/308 useless extension candidates. Maximal degree in co-relation 1039. Up to 248 conditions per place. [2024-06-04 17:14:16,457 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 29 selfloop transitions, 11 changer transitions 0/45 dead transitions. [2024-06-04 17:14:16,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 45 transitions, 277 flow [2024-06-04 17:14:16,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:14:16,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:14:16,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2024-06-04 17:14:16,458 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-04 17:14:16,458 INFO L175 Difference]: Start difference. First operand has 46 places, 35 transitions, 163 flow. Second operand 6 states and 84 transitions. [2024-06-04 17:14:16,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 45 transitions, 277 flow [2024-06-04 17:14:16,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 45 transitions, 260 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-04 17:14:16,460 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 189 flow [2024-06-04 17:14:16,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=189, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2024-06-04 17:14:16,460 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 17 predicate places. [2024-06-04 17:14:16,461 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 189 flow [2024-06-04 17:14:16,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:14:16,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:14:16,461 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:14:16,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-04 17:14:16,461 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 17:14:16,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:14:16,462 INFO L85 PathProgramCache]: Analyzing trace with hash 230686608, now seen corresponding path program 1 times [2024-06-04 17:14:16,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:14:16,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051281841] [2024-06-04 17:14:16,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:14:16,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:14:16,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:14:21,068 INFO 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:14:21,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:14:21,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051281841] [2024-06-04 17:14:21,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051281841] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:14:21,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:14:21,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:14:21,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445880360] [2024-06-04 17:14:21,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:14:21,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:14:21,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:14:21,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:14:21,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:14:21,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:14:21,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 189 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:14:21,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:14:21,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:14:21,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:14:21,413 INFO L124 PetriNetUnfolderBase]: 144/285 cut-off events. [2024-06-04 17:14:21,413 INFO L125 PetriNetUnfolderBase]: For 1084/1084 co-relation queries the response was YES. [2024-06-04 17:14:21,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1031 conditions, 285 events. 144/285 cut-off events. For 1084/1084 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1044 event pairs, 39 based on Foata normal form. 1/285 useless extension candidates. Maximal degree in co-relation 1007. Up to 248 conditions per place. [2024-06-04 17:14:21,417 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 32 selfloop transitions, 10 changer transitions 0/46 dead transitions. [2024-06-04 17:14:21,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 46 transitions, 299 flow [2024-06-04 17:14:21,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:14:21,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:14:21,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2024-06-04 17:14:21,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-04 17:14:21,419 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 189 flow. Second operand 7 states and 91 transitions. [2024-06-04 17:14:21,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 46 transitions, 299 flow [2024-06-04 17:14:21,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 46 transitions, 272 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-04 17:14:21,424 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 201 flow [2024-06-04 17:14:21,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=201, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2024-06-04 17:14:21,425 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 20 predicate places. [2024-06-04 17:14:21,425 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 201 flow [2024-06-04 17:14:21,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:14:21,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:14:21,426 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:14:21,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-04 17:14:21,426 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 17:14:21,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:14:21,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1612578758, now seen corresponding path program 1 times [2024-06-04 17:14:21,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:14:21,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115861326] [2024-06-04 17:14:21,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:14:21,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:14:21,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:14:26,074 INFO 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:14:26,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:14:26,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115861326] [2024-06-04 17:14:26,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115861326] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:14:26,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:14:26,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:14:26,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747167509] [2024-06-04 17:14:26,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:14:26,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:14:26,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:14:26,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:14:26,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:14:26,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:14:26,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 201 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:14:26,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:14:26,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:14:26,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:14:26,461 INFO L124 PetriNetUnfolderBase]: 150/294 cut-off events. [2024-06-04 17:14:26,461 INFO L125 PetriNetUnfolderBase]: For 1477/1477 co-relation queries the response was YES. [2024-06-04 17:14:26,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1116 conditions, 294 events. 150/294 cut-off events. For 1477/1477 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1089 event pairs, 42 based on Foata normal form. 1/294 useless extension candidates. Maximal degree in co-relation 1091. Up to 241 conditions per place. [2024-06-04 17:14:26,463 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 39 selfloop transitions, 10 changer transitions 0/54 dead transitions. [2024-06-04 17:14:26,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 54 transitions, 347 flow [2024-06-04 17:14:26,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:14:26,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:14:26,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2024-06-04 17:14:26,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4017857142857143 [2024-06-04 17:14:26,464 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 201 flow. Second operand 7 states and 90 transitions. [2024-06-04 17:14:26,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 54 transitions, 347 flow [2024-06-04 17:14:26,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 54 transitions, 324 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-04 17:14:26,466 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 223 flow [2024-06-04 17:14:26,466 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=223, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2024-06-04 17:14:26,467 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 22 predicate places. [2024-06-04 17:14:26,467 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 223 flow [2024-06-04 17:14:26,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:14:26,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:14:26,467 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:14:26,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-04 17:14:26,468 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 17:14:26,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:14:26,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1445324048, now seen corresponding path program 1 times [2024-06-04 17:14:26,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:14:26,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875828697] [2024-06-04 17:14:26,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:14:26,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:14:26,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:14:31,212 INFO 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:14:31,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:14:31,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875828697] [2024-06-04 17:14:31,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875828697] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:14:31,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:14:31,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:14:31,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472333689] [2024-06-04 17:14:31,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:14:31,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:14:31,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:14:31,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:14:31,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:14:31,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:14:31,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 223 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:14:31,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:14:31,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:14:31,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:14:31,580 INFO L124 PetriNetUnfolderBase]: 168/316 cut-off events. [2024-06-04 17:14:31,580 INFO L125 PetriNetUnfolderBase]: For 1820/1820 co-relation queries the response was YES. [2024-06-04 17:14:31,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1248 conditions, 316 events. 168/316 cut-off events. For 1820/1820 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1154 event pairs, 44 based on Foata normal form. 2/317 useless extension candidates. Maximal degree in co-relation 1222. Up to 275 conditions per place. [2024-06-04 17:14:31,582 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 42 selfloop transitions, 10 changer transitions 0/55 dead transitions. [2024-06-04 17:14:31,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 55 transitions, 373 flow [2024-06-04 17:14:31,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:14:31,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:14:31,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2024-06-04 17:14:31,587 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4017857142857143 [2024-06-04 17:14:31,587 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 223 flow. Second operand 7 states and 90 transitions. [2024-06-04 17:14:31,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 55 transitions, 373 flow [2024-06-04 17:14:31,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 55 transitions, 344 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-04 17:14:31,590 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 237 flow [2024-06-04 17:14:31,590 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=237, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2024-06-04 17:14:31,590 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 24 predicate places. [2024-06-04 17:14:31,590 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 237 flow [2024-06-04 17:14:31,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:14:31,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:14:31,591 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:14:31,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-04 17:14:31,591 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 17:14:31,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:14:31,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1438657808, now seen corresponding path program 2 times [2024-06-04 17:14:31,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:14:31,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553569686] [2024-06-04 17:14:31,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:14:31,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:14:31,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:14:36,141 INFO 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:14:36,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:14:36,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553569686] [2024-06-04 17:14:36,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553569686] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:14:36,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:14:36,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:14:36,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346062395] [2024-06-04 17:14:36,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:14:36,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:14:36,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:14:36,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:14:36,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:14:36,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:14:36,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 237 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:14:36,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:14:36,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:14:36,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:14:36,487 INFO L124 PetriNetUnfolderBase]: 171/322 cut-off events. [2024-06-04 17:14:36,487 INFO L125 PetriNetUnfolderBase]: For 2167/2169 co-relation queries the response was YES. [2024-06-04 17:14:36,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1322 conditions, 322 events. 171/322 cut-off events. For 2167/2169 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1203 event pairs, 48 based on Foata normal form. 3/324 useless extension candidates. Maximal degree in co-relation 1295. Up to 272 conditions per place. [2024-06-04 17:14:36,489 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 40 selfloop transitions, 16 changer transitions 0/59 dead transitions. [2024-06-04 17:14:36,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 59 transitions, 431 flow [2024-06-04 17:14:36,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:14:36,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:14:36,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2024-06-04 17:14:36,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39732142857142855 [2024-06-04 17:14:36,490 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 237 flow. Second operand 7 states and 89 transitions. [2024-06-04 17:14:36,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 59 transitions, 431 flow [2024-06-04 17:14:36,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 59 transitions, 400 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-04 17:14:36,493 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 309 flow [2024-06-04 17:14:36,493 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=309, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2024-06-04 17:14:36,494 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 28 predicate places. [2024-06-04 17:14:36,494 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 309 flow [2024-06-04 17:14:36,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:14:36,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:14:36,494 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:14:36,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-04 17:14:36,495 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 17:14:36,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:14:36,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1438894958, now seen corresponding path program 3 times [2024-06-04 17:14:36,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:14:36,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252145233] [2024-06-04 17:14:36,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:14:36,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:14:36,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:14:41,225 INFO 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:14:41,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:14:41,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252145233] [2024-06-04 17:14:41,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252145233] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:14:41,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:14:41,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:14:41,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997605764] [2024-06-04 17:14:41,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:14:41,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:14:41,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:14:41,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:14:41,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:14:41,289 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:14:41,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 309 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:14:41,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:14:41,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:14:41,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:14:41,510 INFO L124 PetriNetUnfolderBase]: 177/334 cut-off events. [2024-06-04 17:14:41,511 INFO L125 PetriNetUnfolderBase]: For 2665/2667 co-relation queries the response was YES. [2024-06-04 17:14:41,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1470 conditions, 334 events. 177/334 cut-off events. For 2665/2667 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1261 event pairs, 48 based on Foata normal form. 4/337 useless extension candidates. Maximal degree in co-relation 1440. Up to 263 conditions per place. [2024-06-04 17:14:41,513 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 41 selfloop transitions, 21 changer transitions 0/65 dead transitions. [2024-06-04 17:14:41,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 65 transitions, 529 flow [2024-06-04 17:14:41,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:14:41,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:14:41,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 93 transitions. [2024-06-04 17:14:41,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41517857142857145 [2024-06-04 17:14:41,514 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 309 flow. Second operand 7 states and 93 transitions. [2024-06-04 17:14:41,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 65 transitions, 529 flow [2024-06-04 17:14:41,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 65 transitions, 509 flow, removed 7 selfloop flow, removed 2 redundant places. [2024-06-04 17:14:41,517 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 386 flow [2024-06-04 17:14:41,518 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=386, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2024-06-04 17:14:41,518 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 33 predicate places. [2024-06-04 17:14:41,518 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 386 flow [2024-06-04 17:14:41,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:14:41,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:14:41,519 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:14:41,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-04 17:14:41,519 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 17:14:41,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:14:41,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1829894808, now seen corresponding path program 1 times [2024-06-04 17:14:41,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:14:41,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048164360] [2024-06-04 17:14:41,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:14:41,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:14:41,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:14:46,308 INFO 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:14:46,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:14:46,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048164360] [2024-06-04 17:14:46,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048164360] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:14:46,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:14:46,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:14:46,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122522867] [2024-06-04 17:14:46,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:14:46,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:14:46,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:14:46,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:14:46,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:14:46,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:14:46,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 386 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:14:46,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:14:46,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:14:46,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:14:46,703 INFO L124 PetriNetUnfolderBase]: 195/369 cut-off events. [2024-06-04 17:14:46,703 INFO L125 PetriNetUnfolderBase]: For 3203/3203 co-relation queries the response was YES. [2024-06-04 17:14:46,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1699 conditions, 369 events. 195/369 cut-off events. For 3203/3203 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1442 event pairs, 44 based on Foata normal form. 1/369 useless extension candidates. Maximal degree in co-relation 1667. Up to 311 conditions per place. [2024-06-04 17:14:46,705 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 58 selfloop transitions, 18 changer transitions 0/79 dead transitions. [2024-06-04 17:14:46,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 79 transitions, 649 flow [2024-06-04 17:14:46,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:14:46,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:14:46,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2024-06-04 17:14:46,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-06-04 17:14:46,707 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 386 flow. Second operand 9 states and 112 transitions. [2024-06-04 17:14:46,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 79 transitions, 649 flow [2024-06-04 17:14:46,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 79 transitions, 613 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-06-04 17:14:46,711 INFO L231 Difference]: Finished difference. Result has 73 places, 66 transitions, 493 flow [2024-06-04 17:14:46,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=493, PETRI_PLACES=73, PETRI_TRANSITIONS=66} [2024-06-04 17:14:46,711 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 42 predicate places. [2024-06-04 17:14:46,711 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 66 transitions, 493 flow [2024-06-04 17:14:46,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:14:46,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:14:46,712 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:14:46,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-04 17:14:46,712 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 17:14:46,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:14:46,712 INFO L85 PathProgramCache]: Analyzing trace with hash 238653906, now seen corresponding path program 2 times [2024-06-04 17:14:46,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:14:46,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24777629] [2024-06-04 17:14:46,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:14:46,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:14:46,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:14:52,202 INFO 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:14:52,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:14:52,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24777629] [2024-06-04 17:14:52,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24777629] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:14:52,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:14:52,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:14:52,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823344707] [2024-06-04 17:14:52,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:14:52,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:14:52,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:14:52,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:14:52,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:14:52,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:14:52,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 66 transitions, 493 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:14:52,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:14:52,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:14:52,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:14:52,632 INFO L124 PetriNetUnfolderBase]: 193/366 cut-off events. [2024-06-04 17:14:52,632 INFO L125 PetriNetUnfolderBase]: For 3603/3603 co-relation queries the response was YES. [2024-06-04 17:14:52,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1786 conditions, 366 events. 193/366 cut-off events. For 3603/3603 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1427 event pairs, 43 based on Foata normal form. 1/366 useless extension candidates. Maximal degree in co-relation 1749. Up to 300 conditions per place. [2024-06-04 17:14:52,634 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 56 selfloop transitions, 22 changer transitions 0/81 dead transitions. [2024-06-04 17:14:52,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 81 transitions, 715 flow [2024-06-04 17:14:52,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:14:52,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:14:52,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2024-06-04 17:14:52,635 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39453125 [2024-06-04 17:14:52,635 INFO L175 Difference]: Start difference. First operand has 73 places, 66 transitions, 493 flow. Second operand 8 states and 101 transitions. [2024-06-04 17:14:52,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 81 transitions, 715 flow [2024-06-04 17:14:52,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 81 transitions, 678 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-06-04 17:14:52,639 INFO L231 Difference]: Finished difference. Result has 78 places, 68 transitions, 540 flow [2024-06-04 17:14:52,640 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=540, PETRI_PLACES=78, PETRI_TRANSITIONS=68} [2024-06-04 17:14:52,640 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 47 predicate places. [2024-06-04 17:14:52,640 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 68 transitions, 540 flow [2024-06-04 17:14:52,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:14:52,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:14:52,640 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:14:52,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-04 17:14:52,641 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 17:14:52,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:14:52,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1553391723, now seen corresponding path program 1 times [2024-06-04 17:14:52,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:14:52,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402295435] [2024-06-04 17:14:52,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:14:52,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:14:52,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:14:57,431 INFO 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:14:57,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:14:57,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402295435] [2024-06-04 17:14:57,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402295435] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:14:57,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:14:57,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:14:57,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620440621] [2024-06-04 17:14:57,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:14:57,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:14:57,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:14:57,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:14:57,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:14:57,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:14:57,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 68 transitions, 540 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:14:57,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:14:57,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:14:57,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:14:57,832 INFO L124 PetriNetUnfolderBase]: 199/376 cut-off events. [2024-06-04 17:14:57,833 INFO L125 PetriNetUnfolderBase]: For 4192/4192 co-relation queries the response was YES. [2024-06-04 17:14:57,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1889 conditions, 376 events. 199/376 cut-off events. For 4192/4192 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1474 event pairs, 42 based on Foata normal form. 2/377 useless extension candidates. Maximal degree in co-relation 1851. Up to 316 conditions per place. [2024-06-04 17:14:57,835 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 65 selfloop transitions, 16 changer transitions 0/84 dead transitions. [2024-06-04 17:14:57,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 84 transitions, 770 flow [2024-06-04 17:14:57,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:14:57,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:14:57,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2024-06-04 17:14:57,836 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39453125 [2024-06-04 17:14:57,836 INFO L175 Difference]: Start difference. First operand has 78 places, 68 transitions, 540 flow. Second operand 8 states and 101 transitions. [2024-06-04 17:14:57,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 84 transitions, 770 flow [2024-06-04 17:14:57,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 84 transitions, 704 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-04 17:14:57,840 INFO L231 Difference]: Finished difference. Result has 80 places, 70 transitions, 536 flow [2024-06-04 17:14:57,841 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=536, PETRI_PLACES=80, PETRI_TRANSITIONS=70} [2024-06-04 17:14:57,841 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 49 predicate places. [2024-06-04 17:14:57,841 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 70 transitions, 536 flow [2024-06-04 17:14:57,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:14:57,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:14:57,842 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:14:57,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-04 17:14:57,844 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 17:14:57,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:14:57,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1537847189, now seen corresponding path program 2 times [2024-06-04 17:14:57,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:14:57,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666956218] [2024-06-04 17:14:57,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:14:57,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:14:57,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:15:02,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:15:02,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:15:02,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666956218] [2024-06-04 17:15:02,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666956218] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:15:02,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:15:02,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:15:02,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857638563] [2024-06-04 17:15:02,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:15:02,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:15:02,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:15:02,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:15:02,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:15:02,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:15:02,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 70 transitions, 536 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:15:02,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:15:02,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:15:02,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:15:03,062 INFO L124 PetriNetUnfolderBase]: 210/397 cut-off events. [2024-06-04 17:15:03,062 INFO L125 PetriNetUnfolderBase]: For 4372/4374 co-relation queries the response was YES. [2024-06-04 17:15:03,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1976 conditions, 397 events. 210/397 cut-off events. For 4372/4374 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1597 event pairs, 45 based on Foata normal form. 4/400 useless extension candidates. Maximal degree in co-relation 1937. Up to 282 conditions per place. [2024-06-04 17:15:03,066 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 54 selfloop transitions, 31 changer transitions 0/88 dead transitions. [2024-06-04 17:15:03,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 88 transitions, 856 flow [2024-06-04 17:15:03,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:15:03,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:15:03,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2024-06-04 17:15:03,068 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41015625 [2024-06-04 17:15:03,068 INFO L175 Difference]: Start difference. First operand has 80 places, 70 transitions, 536 flow. Second operand 8 states and 105 transitions. [2024-06-04 17:15:03,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 88 transitions, 856 flow [2024-06-04 17:15:03,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 88 transitions, 814 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-04 17:15:03,075 INFO L231 Difference]: Finished difference. Result has 83 places, 75 transitions, 627 flow [2024-06-04 17:15:03,076 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=627, PETRI_PLACES=83, PETRI_TRANSITIONS=75} [2024-06-04 17:15:03,076 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 52 predicate places. [2024-06-04 17:15:03,076 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 75 transitions, 627 flow [2024-06-04 17:15:03,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:15:03,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:15:03,077 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:15:03,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-04 17:15:03,077 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 17:15:03,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:15:03,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1538114316, now seen corresponding path program 3 times [2024-06-04 17:15:03,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:15:03,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586397401] [2024-06-04 17:15:03,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:15:03,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:15:03,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:15:07,779 INFO 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:15:07,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:15:07,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586397401] [2024-06-04 17:15:07,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586397401] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:15:07,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:15:07,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:15:07,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182992949] [2024-06-04 17:15:07,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:15:07,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:15:07,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:15:07,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:15:07,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:15:07,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:15:07,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 75 transitions, 627 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:15:07,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:15:07,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:15:07,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:15:08,080 INFO L124 PetriNetUnfolderBase]: 208/394 cut-off events. [2024-06-04 17:15:08,080 INFO L125 PetriNetUnfolderBase]: For 4721/4723 co-relation queries the response was YES. [2024-06-04 17:15:08,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2052 conditions, 394 events. 208/394 cut-off events. For 4721/4723 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1576 event pairs, 45 based on Foata normal form. 3/396 useless extension candidates. Maximal degree in co-relation 2011. Up to 313 conditions per place. [2024-06-04 17:15:08,084 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 55 selfloop transitions, 26 changer transitions 0/84 dead transitions. [2024-06-04 17:15:08,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 84 transitions, 815 flow [2024-06-04 17:15:08,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:15:08,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:15:08,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2024-06-04 17:15:08,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-04 17:15:08,086 INFO L175 Difference]: Start difference. First operand has 83 places, 75 transitions, 627 flow. Second operand 8 states and 100 transitions. [2024-06-04 17:15:08,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 84 transitions, 815 flow [2024-06-04 17:15:08,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 84 transitions, 763 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-06-04 17:15:08,092 INFO L231 Difference]: Finished difference. Result has 88 places, 75 transitions, 632 flow [2024-06-04 17:15:08,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=632, PETRI_PLACES=88, PETRI_TRANSITIONS=75} [2024-06-04 17:15:08,093 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 57 predicate places. [2024-06-04 17:15:08,093 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 75 transitions, 632 flow [2024-06-04 17:15:08,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:15:08,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:15:08,094 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:15:08,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-04 17:15:08,094 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 17:15:08,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:15:08,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1648718255, now seen corresponding path program 3 times [2024-06-04 17:15:08,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:15:08,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482286638] [2024-06-04 17:15:08,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:15:08,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:15:08,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:15:12,900 INFO 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:15:12,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:15:12,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482286638] [2024-06-04 17:15:12,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482286638] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:15:12,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:15:12,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:15:12,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888785671] [2024-06-04 17:15:12,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:15:12,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:15:12,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:15:12,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:15:12,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:15:13,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:15:13,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 75 transitions, 632 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:15:13,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:15:13,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:15:13,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:15:13,269 INFO L124 PetriNetUnfolderBase]: 214/404 cut-off events. [2024-06-04 17:15:13,269 INFO L125 PetriNetUnfolderBase]: For 5250/5252 co-relation queries the response was YES. [2024-06-04 17:15:13,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2149 conditions, 404 events. 214/404 cut-off events. For 5250/5252 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1619 event pairs, 45 based on Foata normal form. 4/407 useless extension candidates. Maximal degree in co-relation 2106. Up to 287 conditions per place. [2024-06-04 17:15:13,272 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 58 selfloop transitions, 29 changer transitions 0/90 dead transitions. [2024-06-04 17:15:13,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 90 transitions, 912 flow [2024-06-04 17:15:13,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:15:13,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:15:13,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2024-06-04 17:15:13,274 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41015625 [2024-06-04 17:15:13,274 INFO L175 Difference]: Start difference. First operand has 88 places, 75 transitions, 632 flow. Second operand 8 states and 105 transitions. [2024-06-04 17:15:13,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 90 transitions, 912 flow [2024-06-04 17:15:13,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 90 transitions, 838 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-04 17:15:13,285 INFO L231 Difference]: Finished difference. Result has 88 places, 77 transitions, 648 flow [2024-06-04 17:15:13,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=648, PETRI_PLACES=88, PETRI_TRANSITIONS=77} [2024-06-04 17:15:13,286 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 57 predicate places. [2024-06-04 17:15:13,286 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 77 transitions, 648 flow [2024-06-04 17:15:13,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:15:13,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:15:13,286 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:15:13,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-04 17:15:13,286 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 17:15:13,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:15:13,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1656069905, now seen corresponding path program 4 times [2024-06-04 17:15:13,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:15:13,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147678357] [2024-06-04 17:15:13,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:15:13,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:15:13,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:15:18,072 INFO 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:15:18,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:15:18,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147678357] [2024-06-04 17:15:18,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147678357] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:15:18,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:15:18,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:15:18,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530508173] [2024-06-04 17:15:18,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:15:18,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:15:18,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:15:18,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:15:18,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:15:18,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:15:18,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 77 transitions, 648 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:15:18,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:15:18,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:15:18,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:15:18,389 INFO L124 PetriNetUnfolderBase]: 210/400 cut-off events. [2024-06-04 17:15:18,389 INFO L125 PetriNetUnfolderBase]: For 5478/5480 co-relation queries the response was YES. [2024-06-04 17:15:18,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2123 conditions, 400 events. 210/400 cut-off events. For 5478/5480 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1622 event pairs, 45 based on Foata normal form. 4/403 useless extension candidates. Maximal degree in co-relation 2079. Up to 284 conditions per place. [2024-06-04 17:15:18,392 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 61 selfloop transitions, 28 changer transitions 0/92 dead transitions. [2024-06-04 17:15:18,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 92 transitions, 889 flow [2024-06-04 17:15:18,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:15:18,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:15:18,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2024-06-04 17:15:18,393 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41015625 [2024-06-04 17:15:18,393 INFO L175 Difference]: Start difference. First operand has 88 places, 77 transitions, 648 flow. Second operand 8 states and 105 transitions. [2024-06-04 17:15:18,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 92 transitions, 889 flow [2024-06-04 17:15:18,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 92 transitions, 819 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-06-04 17:15:18,400 INFO L231 Difference]: Finished difference. Result has 91 places, 78 transitions, 649 flow [2024-06-04 17:15:18,400 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=579, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=649, PETRI_PLACES=91, PETRI_TRANSITIONS=78} [2024-06-04 17:15:18,400 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 60 predicate places. [2024-06-04 17:15:18,400 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 78 transitions, 649 flow [2024-06-04 17:15:18,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:15:18,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:15:18,400 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:15:18,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-04 17:15:18,401 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 17:15:18,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:15:18,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1648441425, now seen corresponding path program 1 times [2024-06-04 17:15:18,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:15:18,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797238014] [2024-06-04 17:15:18,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:15:18,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:15:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:15:24,629 INFO 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:15:24,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:15:24,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797238014] [2024-06-04 17:15:24,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797238014] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:15:24,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:15:24,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:15:24,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849647258] [2024-06-04 17:15:24,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:15:24,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:15:24,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:15:24,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:15:24,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:15:24,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:15:24,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 78 transitions, 649 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:15:24,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:15:24,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:15:24,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:15:24,988 INFO L124 PetriNetUnfolderBase]: 208/395 cut-off events. [2024-06-04 17:15:24,988 INFO L125 PetriNetUnfolderBase]: For 5540/5542 co-relation queries the response was YES. [2024-06-04 17:15:24,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2105 conditions, 395 events. 208/395 cut-off events. For 5540/5542 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1570 event pairs, 45 based on Foata normal form. 1/395 useless extension candidates. Maximal degree in co-relation 2060. Up to 352 conditions per place. [2024-06-04 17:15:24,991 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 72 selfloop transitions, 14 changer transitions 0/89 dead transitions. [2024-06-04 17:15:24,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 89 transitions, 855 flow [2024-06-04 17:15:24,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:15:24,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:15:24,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2024-06-04 17:15:24,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3645833333333333 [2024-06-04 17:15:24,994 INFO L175 Difference]: Start difference. First operand has 91 places, 78 transitions, 649 flow. Second operand 9 states and 105 transitions. [2024-06-04 17:15:24,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 89 transitions, 855 flow [2024-06-04 17:15:24,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 89 transitions, 810 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-04 17:15:25,000 INFO L231 Difference]: Finished difference. Result has 95 places, 80 transitions, 653 flow [2024-06-04 17:15:25,000 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=653, PETRI_PLACES=95, PETRI_TRANSITIONS=80} [2024-06-04 17:15:25,000 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 64 predicate places. [2024-06-04 17:15:25,001 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 80 transitions, 653 flow [2024-06-04 17:15:25,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:15:25,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:15:25,001 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:15:25,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-04 17:15:25,001 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 17:15:25,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:15:25,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1686718291, now seen corresponding path program 1 times [2024-06-04 17:15:25,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:15:25,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501822249] [2024-06-04 17:15:25,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:15:25,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:15:25,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:15:29,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:15:29,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:15:29,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501822249] [2024-06-04 17:15:29,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501822249] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:15:29,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:15:29,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:15:29,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601789701] [2024-06-04 17:15:29,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:15:29,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:15:29,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:15:29,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:15:29,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:15:29,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:15:29,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 80 transitions, 653 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:15:29,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:15:29,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:15:29,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:15:30,222 INFO L124 PetriNetUnfolderBase]: 200/392 cut-off events. [2024-06-04 17:15:30,222 INFO L125 PetriNetUnfolderBase]: For 6256/6256 co-relation queries the response was YES. [2024-06-04 17:15:30,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2105 conditions, 392 events. 200/392 cut-off events. For 6256/6256 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1608 event pairs, 19 based on Foata normal form. 2/393 useless extension candidates. Maximal degree in co-relation 2059. Up to 280 conditions per place. [2024-06-04 17:15:30,225 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 67 selfloop transitions, 16 changer transitions 0/96 dead transitions. [2024-06-04 17:15:30,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 96 transitions, 871 flow [2024-06-04 17:15:30,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:15:30,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:15:30,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2024-06-04 17:15:30,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41796875 [2024-06-04 17:15:30,227 INFO L175 Difference]: Start difference. First operand has 95 places, 80 transitions, 653 flow. Second operand 8 states and 107 transitions. [2024-06-04 17:15:30,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 96 transitions, 871 flow [2024-06-04 17:15:30,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 96 transitions, 781 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-04 17:15:30,233 INFO L231 Difference]: Finished difference. Result has 93 places, 81 transitions, 611 flow [2024-06-04 17:15:30,234 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=611, PETRI_PLACES=93, PETRI_TRANSITIONS=81} [2024-06-04 17:15:30,234 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 62 predicate places. [2024-06-04 17:15:30,234 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 81 transitions, 611 flow [2024-06-04 17:15:30,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:15:30,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:15:30,235 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:15:30,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-04 17:15:30,235 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 17:15:30,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:15:30,235 INFO L85 PathProgramCache]: Analyzing trace with hash 792231643, now seen corresponding path program 2 times [2024-06-04 17:15:30,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:15:30,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149545512] [2024-06-04 17:15:30,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:15:30,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:15:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:15:34,681 INFO 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:15:34,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:15:34,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149545512] [2024-06-04 17:15:34,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149545512] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:15:34,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:15:34,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:15:34,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295862800] [2024-06-04 17:15:34,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:15:34,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:15:34,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:15:34,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:15:34,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:15:34,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:15:34,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 81 transitions, 611 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:15:34,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:15:34,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:15:34,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:15:35,125 INFO L124 PetriNetUnfolderBase]: 203/397 cut-off events. [2024-06-04 17:15:35,125 INFO L125 PetriNetUnfolderBase]: For 6820/6820 co-relation queries the response was YES. [2024-06-04 17:15:35,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2129 conditions, 397 events. 203/397 cut-off events. For 6820/6820 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1650 event pairs, 36 based on Foata normal form. 2/398 useless extension candidates. Maximal degree in co-relation 2083. Up to 303 conditions per place. [2024-06-04 17:15:35,128 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 64 selfloop transitions, 19 changer transitions 0/96 dead transitions. [2024-06-04 17:15:35,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 96 transitions, 829 flow [2024-06-04 17:15:35,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:15:35,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:15:35,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 108 transitions. [2024-06-04 17:15:35,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.421875 [2024-06-04 17:15:35,129 INFO L175 Difference]: Start difference. First operand has 93 places, 81 transitions, 611 flow. Second operand 8 states and 108 transitions. [2024-06-04 17:15:35,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 96 transitions, 829 flow [2024-06-04 17:15:35,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 96 transitions, 791 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-04 17:15:35,136 INFO L231 Difference]: Finished difference. Result has 95 places, 82 transitions, 630 flow [2024-06-04 17:15:35,136 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=630, PETRI_PLACES=95, PETRI_TRANSITIONS=82} [2024-06-04 17:15:35,137 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 64 predicate places. [2024-06-04 17:15:35,137 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 82 transitions, 630 flow [2024-06-04 17:15:35,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:15:35,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:15:35,137 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:15:35,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-04 17:15:35,137 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 17:15:35,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:15:35,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1191662673, now seen corresponding path program 1 times [2024-06-04 17:15:35,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:15:35,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819751028] [2024-06-04 17:15:35,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:15:35,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:15:35,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:15:39,668 INFO 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:15:39,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:15:39,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819751028] [2024-06-04 17:15:39,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819751028] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:15:39,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:15:39,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:15:39,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919674850] [2024-06-04 17:15:39,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:15:39,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:15:39,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:15:39,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:15:39,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:15:39,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:15:39,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 82 transitions, 630 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:15:39,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:15:39,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:15:39,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:15:40,054 INFO L124 PetriNetUnfolderBase]: 214/407 cut-off events. [2024-06-04 17:15:40,054 INFO L125 PetriNetUnfolderBase]: For 6945/6945 co-relation queries the response was YES. [2024-06-04 17:15:40,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2168 conditions, 407 events. 214/407 cut-off events. For 6945/6945 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1635 event pairs, 38 based on Foata normal form. 1/407 useless extension candidates. Maximal degree in co-relation 2121. Up to 334 conditions per place. [2024-06-04 17:15:40,057 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 71 selfloop transitions, 24 changer transitions 0/98 dead transitions. [2024-06-04 17:15:40,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 98 transitions, 886 flow [2024-06-04 17:15:40,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:15:40,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:15:40,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-04 17:15:40,059 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2024-06-04 17:15:40,059 INFO L175 Difference]: Start difference. First operand has 95 places, 82 transitions, 630 flow. Second operand 9 states and 111 transitions. [2024-06-04 17:15:40,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 98 transitions, 886 flow [2024-06-04 17:15:40,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 98 transitions, 841 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-04 17:15:40,066 INFO L231 Difference]: Finished difference. Result has 98 places, 84 transitions, 669 flow [2024-06-04 17:15:40,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=585, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=669, PETRI_PLACES=98, PETRI_TRANSITIONS=84} [2024-06-04 17:15:40,067 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 67 predicate places. [2024-06-04 17:15:40,067 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 84 transitions, 669 flow [2024-06-04 17:15:40,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:15:40,067 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:15:40,067 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:15:40,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-04 17:15:40,068 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 17:15:40,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:15:40,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1665358981, now seen corresponding path program 3 times [2024-06-04 17:15:40,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:15:40,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912089754] [2024-06-04 17:15:40,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:15:40,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:15:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:15:44,716 INFO 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:15:44,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:15:44,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912089754] [2024-06-04 17:15:44,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912089754] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:15:44,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:15:44,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:15:44,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786816137] [2024-06-04 17:15:44,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:15:44,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:15:44,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:15:44,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:15:44,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:15:44,851 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:15:44,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 84 transitions, 669 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:15:44,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:15:44,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:15:44,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:15:45,201 INFO L124 PetriNetUnfolderBase]: 206/405 cut-off events. [2024-06-04 17:15:45,201 INFO L125 PetriNetUnfolderBase]: For 7913/7913 co-relation queries the response was YES. [2024-06-04 17:15:45,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2201 conditions, 405 events. 206/405 cut-off events. For 7913/7913 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1694 event pairs, 36 based on Foata normal form. 2/406 useless extension candidates. Maximal degree in co-relation 2153. Up to 327 conditions per place. [2024-06-04 17:15:45,203 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 72 selfloop transitions, 13 changer transitions 0/98 dead transitions. [2024-06-04 17:15:45,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 98 transitions, 892 flow [2024-06-04 17:15:45,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:15:45,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:15:45,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2024-06-04 17:15:45,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41015625 [2024-06-04 17:15:45,205 INFO L175 Difference]: Start difference. First operand has 98 places, 84 transitions, 669 flow. Second operand 8 states and 105 transitions. [2024-06-04 17:15:45,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 98 transitions, 892 flow [2024-06-04 17:15:45,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 98 transitions, 826 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-04 17:15:45,213 INFO L231 Difference]: Finished difference. Result has 100 places, 86 transitions, 660 flow [2024-06-04 17:15:45,213 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=660, PETRI_PLACES=100, PETRI_TRANSITIONS=86} [2024-06-04 17:15:45,213 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 69 predicate places. [2024-06-04 17:15:45,213 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 86 transitions, 660 flow [2024-06-04 17:15:45,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:15:45,214 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:15:45,214 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:15:45,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-04 17:15:45,214 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 17:15:45,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:15:45,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1076191765, now seen corresponding path program 1 times [2024-06-04 17:15:45,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:15:45,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73165869] [2024-06-04 17:15:45,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:15:45,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:15:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:15:49,519 INFO 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:15:49,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:15:49,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73165869] [2024-06-04 17:15:49,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73165869] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:15:49,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:15:49,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:15:49,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277393118] [2024-06-04 17:15:49,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:15:49,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:15:49,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:15:49,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:15:49,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:15:49,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:15:49,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 86 transitions, 660 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:15:49,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:15:49,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:15:49,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:15:49,955 INFO L124 PetriNetUnfolderBase]: 224/433 cut-off events. [2024-06-04 17:15:49,955 INFO L125 PetriNetUnfolderBase]: For 8375/8375 co-relation queries the response was YES. [2024-06-04 17:15:49,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2302 conditions, 433 events. 224/433 cut-off events. For 8375/8375 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1821 event pairs, 37 based on Foata normal form. 2/434 useless extension candidates. Maximal degree in co-relation 2252. Up to 355 conditions per place. [2024-06-04 17:15:49,958 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 82 selfloop transitions, 18 changer transitions 0/103 dead transitions. [2024-06-04 17:15:49,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 103 transitions, 937 flow [2024-06-04 17:15:49,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:15:49,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:15:49,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2024-06-04 17:15:49,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-06-04 17:15:49,959 INFO L175 Difference]: Start difference. First operand has 100 places, 86 transitions, 660 flow. Second operand 9 states and 112 transitions. [2024-06-04 17:15:49,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 103 transitions, 937 flow [2024-06-04 17:15:49,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 103 transitions, 901 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-04 17:15:49,967 INFO L231 Difference]: Finished difference. Result has 104 places, 88 transitions, 695 flow [2024-06-04 17:15:49,968 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=695, PETRI_PLACES=104, PETRI_TRANSITIONS=88} [2024-06-04 17:15:49,968 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 73 predicate places. [2024-06-04 17:15:49,968 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 88 transitions, 695 flow [2024-06-04 17:15:49,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:15:49,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:15:49,968 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:15:49,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-04 17:15:49,968 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 17:15:49,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:15:49,969 INFO L85 PathProgramCache]: Analyzing trace with hash 201256663, now seen corresponding path program 4 times [2024-06-04 17:15:49,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:15:49,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203599882] [2024-06-04 17:15:49,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:15:49,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:15:50,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:15:54,902 INFO 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:15:54,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:15:54,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203599882] [2024-06-04 17:15:54,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203599882] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:15:54,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:15:54,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:15:54,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689294268] [2024-06-04 17:15:54,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:15:54,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:15:54,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:15:54,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:15:54,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:15:55,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:15:55,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 88 transitions, 695 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:15:55,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:15:55,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:15:55,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:15:55,221 INFO L124 PetriNetUnfolderBase]: 209/413 cut-off events. [2024-06-04 17:15:55,221 INFO L125 PetriNetUnfolderBase]: For 8443/8445 co-relation queries the response was YES. [2024-06-04 17:15:55,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2222 conditions, 413 events. 209/413 cut-off events. For 8443/8445 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1752 event pairs, 37 based on Foata normal form. 4/416 useless extension candidates. Maximal degree in co-relation 2171. Up to 323 conditions per place. [2024-06-04 17:15:55,225 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 68 selfloop transitions, 17 changer transitions 0/98 dead transitions. [2024-06-04 17:15:55,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 98 transitions, 893 flow [2024-06-04 17:15:55,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:15:55,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:15:55,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2024-06-04 17:15:55,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41015625 [2024-06-04 17:15:55,226 INFO L175 Difference]: Start difference. First operand has 104 places, 88 transitions, 695 flow. Second operand 8 states and 105 transitions. [2024-06-04 17:15:55,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 98 transitions, 893 flow [2024-06-04 17:15:55,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 98 transitions, 838 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-04 17:15:55,236 INFO L231 Difference]: Finished difference. Result has 105 places, 88 transitions, 678 flow [2024-06-04 17:15:55,236 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=678, PETRI_PLACES=105, PETRI_TRANSITIONS=88} [2024-06-04 17:15:55,236 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 74 predicate places. [2024-06-04 17:15:55,236 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 88 transitions, 678 flow [2024-06-04 17:15:55,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:15:55,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:15:55,237 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:15:55,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-04 17:15:55,237 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 17:15:55,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:15:55,238 INFO L85 PathProgramCache]: Analyzing trace with hash 437616721, now seen corresponding path program 2 times [2024-06-04 17:15:55,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:15:55,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431336530] [2024-06-04 17:15:55,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:15:55,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:15:55,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:16:00,804 INFO 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:16:00,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:16:00,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431336530] [2024-06-04 17:16:00,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431336530] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:16:00,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:16:00,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:16:00,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087690686] [2024-06-04 17:16:00,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:16:00,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:16:00,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:16:00,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:16:00,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:16:00,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:16:00,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 88 transitions, 678 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:16:00,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:16:00,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:16:00,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:16:01,174 INFO L124 PetriNetUnfolderBase]: 242/457 cut-off events. [2024-06-04 17:16:01,175 INFO L125 PetriNetUnfolderBase]: For 10225/10227 co-relation queries the response was YES. [2024-06-04 17:16:01,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2538 conditions, 457 events. 242/457 cut-off events. For 10225/10227 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1894 event pairs, 40 based on Foata normal form. 4/460 useless extension candidates. Maximal degree in co-relation 2486. Up to 298 conditions per place. [2024-06-04 17:16:01,180 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 66 selfloop transitions, 40 changer transitions 0/109 dead transitions. [2024-06-04 17:16:01,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 109 transitions, 1134 flow [2024-06-04 17:16:01,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:16:01,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:16:01,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-04 17:16:01,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4097222222222222 [2024-06-04 17:16:01,181 INFO L175 Difference]: Start difference. First operand has 105 places, 88 transitions, 678 flow. Second operand 9 states and 118 transitions. [2024-06-04 17:16:01,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 109 transitions, 1134 flow [2024-06-04 17:16:01,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 109 transitions, 1048 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-04 17:16:01,195 INFO L231 Difference]: Finished difference. Result has 105 places, 94 transitions, 771 flow [2024-06-04 17:16:01,195 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=771, PETRI_PLACES=105, PETRI_TRANSITIONS=94} [2024-06-04 17:16:01,196 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 74 predicate places. [2024-06-04 17:16:01,196 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 94 transitions, 771 flow [2024-06-04 17:16:01,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:16:01,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:16:01,196 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:16:01,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-04 17:16:01,197 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 17:16:01,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:16:01,197 INFO L85 PathProgramCache]: Analyzing trace with hash 201441361, now seen corresponding path program 3 times [2024-06-04 17:16:01,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:16:01,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521952056] [2024-06-04 17:16:01,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:16:01,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:16:01,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:16:06,648 INFO 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:16:06,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:16:06,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521952056] [2024-06-04 17:16:06,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521952056] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:16:06,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:16:06,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:16:06,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501669726] [2024-06-04 17:16:06,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:16:06,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:16:06,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:16:06,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:16:06,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:16:06,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:16:06,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 94 transitions, 771 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:16:06,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:16:06,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:16:06,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:16:06,986 INFO L124 PetriNetUnfolderBase]: 248/477 cut-off events. [2024-06-04 17:16:06,986 INFO L125 PetriNetUnfolderBase]: For 11192/11194 co-relation queries the response was YES. [2024-06-04 17:16:06,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2655 conditions, 477 events. 248/477 cut-off events. For 11192/11194 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2071 event pairs, 47 based on Foata normal form. 4/480 useless extension candidates. Maximal degree in co-relation 2604. Up to 304 conditions per place. [2024-06-04 17:16:06,999 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 73 selfloop transitions, 36 changer transitions 0/112 dead transitions. [2024-06-04 17:16:07,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 112 transitions, 1136 flow [2024-06-04 17:16:07,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:16:07,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:16:07,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-04 17:16:07,001 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4131944444444444 [2024-06-04 17:16:07,001 INFO L175 Difference]: Start difference. First operand has 105 places, 94 transitions, 771 flow. Second operand 9 states and 119 transitions. [2024-06-04 17:16:07,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 112 transitions, 1136 flow [2024-06-04 17:16:07,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 112 transitions, 1071 flow, removed 16 selfloop flow, removed 4 redundant places. [2024-06-04 17:16:07,013 INFO L231 Difference]: Finished difference. Result has 110 places, 96 transitions, 817 flow [2024-06-04 17:16:07,013 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=708, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=817, PETRI_PLACES=110, PETRI_TRANSITIONS=96} [2024-06-04 17:16:07,016 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 79 predicate places. [2024-06-04 17:16:07,016 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 96 transitions, 817 flow [2024-06-04 17:16:07,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:16:07,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:16:07,016 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:16:07,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-04 17:16:07,017 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 17:16:07,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:16:07,017 INFO L85 PathProgramCache]: Analyzing trace with hash 437625091, now seen corresponding path program 4 times [2024-06-04 17:16:07,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:16:07,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688245630] [2024-06-04 17:16:07,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:16:07,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:16:07,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:16:12,369 INFO 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:16:12,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:16:12,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688245630] [2024-06-04 17:16:12,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688245630] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:16:12,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:16:12,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:16:12,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371682764] [2024-06-04 17:16:12,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:16:12,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:16:12,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:16:12,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:16:12,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:16:12,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:16:12,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 96 transitions, 817 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:16:12,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:16:12,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:16:12,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:16:12,797 INFO L124 PetriNetUnfolderBase]: 244/461 cut-off events. [2024-06-04 17:16:12,798 INFO L125 PetriNetUnfolderBase]: For 10949/10951 co-relation queries the response was YES. [2024-06-04 17:16:12,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2624 conditions, 461 events. 244/461 cut-off events. For 10949/10951 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1927 event pairs, 42 based on Foata normal form. 2/462 useless extension candidates. Maximal degree in co-relation 2571. Up to 413 conditions per place. [2024-06-04 17:16:12,801 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 89 selfloop transitions, 14 changer transitions 0/106 dead transitions. [2024-06-04 17:16:12,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 106 transitions, 1051 flow [2024-06-04 17:16:12,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:16:12,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:16:12,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-04 17:16:12,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3680555555555556 [2024-06-04 17:16:12,803 INFO L175 Difference]: Start difference. First operand has 110 places, 96 transitions, 817 flow. Second operand 9 states and 106 transitions. [2024-06-04 17:16:12,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 106 transitions, 1051 flow [2024-06-04 17:16:12,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 106 transitions, 952 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-06-04 17:16:12,816 INFO L231 Difference]: Finished difference. Result has 113 places, 96 transitions, 751 flow [2024-06-04 17:16:12,816 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=751, PETRI_PLACES=113, PETRI_TRANSITIONS=96} [2024-06-04 17:16:12,816 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 82 predicate places. [2024-06-04 17:16:12,817 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 96 transitions, 751 flow [2024-06-04 17:16:12,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:16:12,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:16:12,817 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:16:12,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-04 17:16:12,817 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:16:12,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:16:12,817 INFO L85 PathProgramCache]: Analyzing trace with hash 429342511, now seen corresponding path program 5 times [2024-06-04 17:16:12,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:16:12,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200973649] [2024-06-04 17:16:12,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:16:12,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:16:12,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:16:18,337 INFO 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:16:18,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:16:18,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200973649] [2024-06-04 17:16:18,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200973649] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:16:18,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:16:18,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:16:18,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61792568] [2024-06-04 17:16:18,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:16:18,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:16:18,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:16:18,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:16:18,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:16:18,506 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:16:18,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 96 transitions, 751 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:16:18,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:16:18,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:16:18,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:16:18,766 INFO L124 PetriNetUnfolderBase]: 240/459 cut-off events. [2024-06-04 17:16:18,767 INFO L125 PetriNetUnfolderBase]: For 10529/10531 co-relation queries the response was YES. [2024-06-04 17:16:18,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2469 conditions, 459 events. 240/459 cut-off events. For 10529/10531 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1948 event pairs, 41 based on Foata normal form. 4/462 useless extension candidates. Maximal degree in co-relation 2415. Up to 298 conditions per place. [2024-06-04 17:16:18,770 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 69 selfloop transitions, 38 changer transitions 0/110 dead transitions. [2024-06-04 17:16:18,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 110 transitions, 1017 flow [2024-06-04 17:16:18,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:16:18,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:16:18,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-04 17:16:18,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-04 17:16:18,771 INFO L175 Difference]: Start difference. First operand has 113 places, 96 transitions, 751 flow. Second operand 9 states and 117 transitions. [2024-06-04 17:16:18,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 110 transitions, 1017 flow [2024-06-04 17:16:18,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 110 transitions, 962 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-04 17:16:18,784 INFO L231 Difference]: Finished difference. Result has 114 places, 96 transitions, 777 flow [2024-06-04 17:16:18,784 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=777, PETRI_PLACES=114, PETRI_TRANSITIONS=96} [2024-06-04 17:16:18,784 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 83 predicate places. [2024-06-04 17:16:18,784 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 96 transitions, 777 flow [2024-06-04 17:16:18,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:16:18,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:16:18,785 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:16:18,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-04 17:16:18,785 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:16:18,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:16:18,785 INFO L85 PathProgramCache]: Analyzing trace with hash 437924303, now seen corresponding path program 1 times [2024-06-04 17:16:18,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:16:18,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217070400] [2024-06-04 17:16:18,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:16:18,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:16:18,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:16:24,955 INFO 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:16:24,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:16:24,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217070400] [2024-06-04 17:16:24,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217070400] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:16:24,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:16:24,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:16:24,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097412226] [2024-06-04 17:16:24,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:16:24,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:16:24,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:16:24,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:16:24,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:16:25,095 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:16:25,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 96 transitions, 777 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:16:25,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:16:25,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:16:25,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:16:25,326 INFO L124 PetriNetUnfolderBase]: 237/456 cut-off events. [2024-06-04 17:16:25,327 INFO L125 PetriNetUnfolderBase]: For 10363/10365 co-relation queries the response was YES. [2024-06-04 17:16:25,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2448 conditions, 456 events. 237/456 cut-off events. For 10363/10365 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1938 event pairs, 45 based on Foata normal form. 2/457 useless extension candidates. Maximal degree in co-relation 2393. Up to 399 conditions per place. [2024-06-04 17:16:25,330 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 89 selfloop transitions, 15 changer transitions 0/107 dead transitions. [2024-06-04 17:16:25,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 107 transitions, 1011 flow [2024-06-04 17:16:25,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:16:25,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:16:25,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2024-06-04 17:16:25,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35625 [2024-06-04 17:16:25,331 INFO L175 Difference]: Start difference. First operand has 114 places, 96 transitions, 777 flow. Second operand 10 states and 114 transitions. [2024-06-04 17:16:25,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 107 transitions, 1011 flow [2024-06-04 17:16:25,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 107 transitions, 901 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-04 17:16:25,344 INFO L231 Difference]: Finished difference. Result has 115 places, 96 transitions, 701 flow [2024-06-04 17:16:25,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=667, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=701, PETRI_PLACES=115, PETRI_TRANSITIONS=96} [2024-06-04 17:16:25,345 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 84 predicate places. [2024-06-04 17:16:25,346 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 96 transitions, 701 flow [2024-06-04 17:16:25,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:16:25,346 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:16:25,346 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:16:25,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-04 17:16:25,346 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:16:25,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:16:25,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1212495991, now seen corresponding path program 1 times [2024-06-04 17:16:25,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:16:25,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662367881] [2024-06-04 17:16:25,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:16:25,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:16:25,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:16:30,481 INFO 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:16:30,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:16:30,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662367881] [2024-06-04 17:16:30,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662367881] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:16:30,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:16:30,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:16:30,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995338598] [2024-06-04 17:16:30,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:16:30,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:16:30,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:16:30,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:16:30,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:16:30,658 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:16:30,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 96 transitions, 701 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:16:30,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:16:30,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:16:30,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:16:30,970 INFO L124 PetriNetUnfolderBase]: 241/457 cut-off events. [2024-06-04 17:16:30,970 INFO L125 PetriNetUnfolderBase]: For 10738/10738 co-relation queries the response was YES. [2024-06-04 17:16:30,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2424 conditions, 457 events. 241/457 cut-off events. For 10738/10738 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1904 event pairs, 16 based on Foata normal form. 2/458 useless extension candidates. Maximal degree in co-relation 2368. Up to 361 conditions per place. [2024-06-04 17:16:30,974 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 94 selfloop transitions, 17 changer transitions 0/114 dead transitions. [2024-06-04 17:16:30,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 114 transitions, 981 flow [2024-06-04 17:16:30,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:16:30,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:16:30,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2024-06-04 17:16:30,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3819444444444444 [2024-06-04 17:16:30,975 INFO L175 Difference]: Start difference. First operand has 115 places, 96 transitions, 701 flow. Second operand 9 states and 110 transitions. [2024-06-04 17:16:30,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 114 transitions, 981 flow [2024-06-04 17:16:30,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 114 transitions, 943 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-04 17:16:30,988 INFO L231 Difference]: Finished difference. Result has 116 places, 97 transitions, 715 flow [2024-06-04 17:16:30,988 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=663, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=715, PETRI_PLACES=116, PETRI_TRANSITIONS=97} [2024-06-04 17:16:30,988 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 85 predicate places. [2024-06-04 17:16:30,989 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 97 transitions, 715 flow [2024-06-04 17:16:30,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:16:30,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:16:30,989 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:16:30,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-04 17:16:30,989 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:16:30,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:16:30,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1626321753, now seen corresponding path program 2 times [2024-06-04 17:16:30,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:16:30,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123054470] [2024-06-04 17:16:30,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:16:30,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:16:31,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:16:36,928 INFO 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:16:36,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:16:36,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123054470] [2024-06-04 17:16:36,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123054470] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:16:36,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:16:36,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:16:36,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752133534] [2024-06-04 17:16:36,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:16:36,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:16:36,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:16:36,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:16:36,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:16:37,064 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:16:37,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 97 transitions, 715 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:16:37,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:16:37,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:16:37,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:16:37,324 INFO L124 PetriNetUnfolderBase]: 245/465 cut-off events. [2024-06-04 17:16:37,324 INFO L125 PetriNetUnfolderBase]: For 11425/11425 co-relation queries the response was YES. [2024-06-04 17:16:37,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2493 conditions, 465 events. 245/465 cut-off events. For 11425/11425 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1970 event pairs, 37 based on Foata normal form. 2/466 useless extension candidates. Maximal degree in co-relation 2436. Up to 387 conditions per place. [2024-06-04 17:16:37,327 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 87 selfloop transitions, 23 changer transitions 0/113 dead transitions. [2024-06-04 17:16:37,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 113 transitions, 991 flow [2024-06-04 17:16:37,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:16:37,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:16:37,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2024-06-04 17:16:37,328 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-04 17:16:37,328 INFO L175 Difference]: Start difference. First operand has 116 places, 97 transitions, 715 flow. Second operand 9 states and 120 transitions. [2024-06-04 17:16:37,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 113 transitions, 991 flow [2024-06-04 17:16:37,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 113 transitions, 949 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-04 17:16:37,343 INFO L231 Difference]: Finished difference. Result has 118 places, 98 transitions, 740 flow [2024-06-04 17:16:37,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=740, PETRI_PLACES=118, PETRI_TRANSITIONS=98} [2024-06-04 17:16:37,343 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 87 predicate places. [2024-06-04 17:16:37,343 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 98 transitions, 740 flow [2024-06-04 17:16:37,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:16:37,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:16:37,344 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:16:37,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-04 17:16:37,344 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:16:37,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:16:37,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1123930231, now seen corresponding path program 3 times [2024-06-04 17:16:37,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:16:37,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000216060] [2024-06-04 17:16:37,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:16:37,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:16:37,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:16:42,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:16:42,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:16:42,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000216060] [2024-06-04 17:16:42,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000216060] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:16:42,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:16:42,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:16:42,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748111695] [2024-06-04 17:16:42,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:16:42,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:16:42,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:16:42,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:16:42,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:16:42,881 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:16:42,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 98 transitions, 740 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:16:42,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:16:42,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:16:42,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:16:43,219 INFO L124 PetriNetUnfolderBase]: 249/473 cut-off events. [2024-06-04 17:16:43,219 INFO L125 PetriNetUnfolderBase]: For 12361/12361 co-relation queries the response was YES. [2024-06-04 17:16:43,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2559 conditions, 473 events. 249/473 cut-off events. For 12361/12361 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2021 event pairs, 35 based on Foata normal form. 2/474 useless extension candidates. Maximal degree in co-relation 2501. Up to 379 conditions per place. [2024-06-04 17:16:43,222 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 89 selfloop transitions, 23 changer transitions 0/115 dead transitions. [2024-06-04 17:16:43,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 115 transitions, 1024 flow [2024-06-04 17:16:43,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:16:43,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:16:43,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-04 17:16:43,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3923611111111111 [2024-06-04 17:16:43,225 INFO L175 Difference]: Start difference. First operand has 118 places, 98 transitions, 740 flow. Second operand 9 states and 113 transitions. [2024-06-04 17:16:43,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 115 transitions, 1024 flow [2024-06-04 17:16:43,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 115 transitions, 969 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-04 17:16:43,239 INFO L231 Difference]: Finished difference. Result has 120 places, 99 transitions, 753 flow [2024-06-04 17:16:43,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=753, PETRI_PLACES=120, PETRI_TRANSITIONS=99} [2024-06-04 17:16:43,239 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 89 predicate places. [2024-06-04 17:16:43,239 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 99 transitions, 753 flow [2024-06-04 17:16:43,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:16:43,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:16:43,240 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:16:43,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-04 17:16:43,240 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:16:43,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:16:43,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1123776409, now seen corresponding path program 1 times [2024-06-04 17:16:43,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:16:43,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324965916] [2024-06-04 17:16:43,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:16:43,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:16:43,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:16:48,412 INFO 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:16:48,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:16:48,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324965916] [2024-06-04 17:16:48,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324965916] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:16:48,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:16:48,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:16:48,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146646782] [2024-06-04 17:16:48,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:16:48,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:16:48,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:16:48,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:16:48,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:16:48,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:16:48,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 99 transitions, 753 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:16:48,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:16:48,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:16:48,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:16:48,824 INFO L124 PetriNetUnfolderBase]: 247/470 cut-off events. [2024-06-04 17:16:48,824 INFO L125 PetriNetUnfolderBase]: For 11891/11891 co-relation queries the response was YES. [2024-06-04 17:16:48,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2518 conditions, 470 events. 247/470 cut-off events. For 11891/11891 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2000 event pairs, 36 based on Foata normal form. 1/470 useless extension candidates. Maximal degree in co-relation 2459. Up to 392 conditions per place. [2024-06-04 17:16:48,827 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 87 selfloop transitions, 26 changer transitions 0/116 dead transitions. [2024-06-04 17:16:48,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 116 transitions, 1055 flow [2024-06-04 17:16:48,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:16:48,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:16:48,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2024-06-04 17:16:48,828 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.378125 [2024-06-04 17:16:48,828 INFO L175 Difference]: Start difference. First operand has 120 places, 99 transitions, 753 flow. Second operand 10 states and 121 transitions. [2024-06-04 17:16:48,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 116 transitions, 1055 flow [2024-06-04 17:16:48,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 116 transitions, 997 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-04 17:16:48,844 INFO L231 Difference]: Finished difference. Result has 123 places, 101 transitions, 790 flow [2024-06-04 17:16:48,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=790, PETRI_PLACES=123, PETRI_TRANSITIONS=101} [2024-06-04 17:16:48,844 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 92 predicate places. [2024-06-04 17:16:48,845 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 101 transitions, 790 flow [2024-06-04 17:16:48,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:16:48,845 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:16:48,845 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:16:48,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-04 17:16:48,845 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:16:48,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:16:48,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1844723387, now seen corresponding path program 4 times [2024-06-04 17:16:48,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:16:48,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624207393] [2024-06-04 17:16:48,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:16:48,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:16:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:16:54,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:16:54,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:16:54,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624207393] [2024-06-04 17:16:54,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624207393] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:16:54,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:16:54,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:16:54,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670455250] [2024-06-04 17:16:54,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:16:54,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:16:54,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:16:54,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:16:54,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:16:54,658 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:16:54,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 101 transitions, 790 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:16:54,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:16:54,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:16:54,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:16:55,021 INFO L124 PetriNetUnfolderBase]: 254/485 cut-off events. [2024-06-04 17:16:55,022 INFO L125 PetriNetUnfolderBase]: For 13109/13109 co-relation queries the response was YES. [2024-06-04 17:16:55,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2608 conditions, 485 events. 254/485 cut-off events. For 13109/13109 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2095 event pairs, 38 based on Foata normal form. 2/486 useless extension candidates. Maximal degree in co-relation 2548. Up to 420 conditions per place. [2024-06-04 17:16:55,025 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 97 selfloop transitions, 18 changer transitions 0/118 dead transitions. [2024-06-04 17:16:55,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 118 transitions, 1095 flow [2024-06-04 17:16:55,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:16:55,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:16:55,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2024-06-04 17:16:55,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3819444444444444 [2024-06-04 17:16:55,026 INFO L175 Difference]: Start difference. First operand has 123 places, 101 transitions, 790 flow. Second operand 9 states and 110 transitions. [2024-06-04 17:16:55,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 118 transitions, 1095 flow [2024-06-04 17:16:55,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 118 transitions, 1016 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-04 17:16:55,044 INFO L231 Difference]: Finished difference. Result has 125 places, 105 transitions, 799 flow [2024-06-04 17:16:55,044 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=711, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=799, PETRI_PLACES=125, PETRI_TRANSITIONS=105} [2024-06-04 17:16:55,045 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 94 predicate places. [2024-06-04 17:16:55,045 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 105 transitions, 799 flow [2024-06-04 17:16:55,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:16:55,045 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:16:55,045 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:16:55,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-04 17:16:55,045 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:16:55,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:16:55,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1844871257, now seen corresponding path program 5 times [2024-06-04 17:16:55,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:16:55,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360964179] [2024-06-04 17:16:55,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:16:55,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:16:55,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:17:00,439 INFO 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:17:00,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:17:00,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360964179] [2024-06-04 17:17:00,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360964179] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:17:00,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:17:00,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:17:00,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191159579] [2024-06-04 17:17:00,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:17:00,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:17:00,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:17:00,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:17:00,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:17:00,580 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:17:00,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 105 transitions, 799 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:17:00,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:17:00,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:17:00,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:17:00,912 INFO L124 PetriNetUnfolderBase]: 265/509 cut-off events. [2024-06-04 17:17:00,912 INFO L125 PetriNetUnfolderBase]: For 15447/15449 co-relation queries the response was YES. [2024-06-04 17:17:00,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2806 conditions, 509 events. 265/509 cut-off events. For 15447/15449 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2265 event pairs, 41 based on Foata normal form. 2/510 useless extension candidates. Maximal degree in co-relation 2744. Up to 388 conditions per place. [2024-06-04 17:17:00,916 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 88 selfloop transitions, 30 changer transitions 0/121 dead transitions. [2024-06-04 17:17:00,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 121 transitions, 1181 flow [2024-06-04 17:17:00,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:17:00,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:17:00,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-04 17:17:00,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-04 17:17:00,918 INFO L175 Difference]: Start difference. First operand has 125 places, 105 transitions, 799 flow. Second operand 9 states and 114 transitions. [2024-06-04 17:17:00,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 121 transitions, 1181 flow [2024-06-04 17:17:00,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 121 transitions, 1132 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-04 17:17:00,942 INFO L231 Difference]: Finished difference. Result has 129 places, 107 transitions, 856 flow [2024-06-04 17:17:00,943 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=856, PETRI_PLACES=129, PETRI_TRANSITIONS=107} [2024-06-04 17:17:00,943 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 98 predicate places. [2024-06-04 17:17:00,943 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 107 transitions, 856 flow [2024-06-04 17:17:00,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:17:00,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:17:00,943 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:17:00,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-04 17:17:00,944 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:17:00,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:17:00,944 INFO L85 PathProgramCache]: Analyzing trace with hash 92031911, now seen corresponding path program 6 times [2024-06-04 17:17:00,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:17:00,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524237597] [2024-06-04 17:17:00,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:17:00,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:17:00,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:17:06,440 INFO 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:17:06,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:17:06,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524237597] [2024-06-04 17:17:06,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524237597] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:17:06,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:17:06,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:17:06,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821195802] [2024-06-04 17:17:06,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:17:06,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:17:06,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:17:06,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:17:06,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:17:06,536 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:17:06,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 107 transitions, 856 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:17:06,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:17:06,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:17:06,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:17:06,824 INFO L124 PetriNetUnfolderBase]: 262/505 cut-off events. [2024-06-04 17:17:06,824 INFO L125 PetriNetUnfolderBase]: For 14922/14922 co-relation queries the response was YES. [2024-06-04 17:17:06,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2730 conditions, 505 events. 262/505 cut-off events. For 14922/14922 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2236 event pairs, 40 based on Foata normal form. 2/506 useless extension candidates. Maximal degree in co-relation 2668. Up to 436 conditions per place. [2024-06-04 17:17:06,827 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 99 selfloop transitions, 18 changer transitions 0/120 dead transitions. [2024-06-04 17:17:06,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 120 transitions, 1126 flow [2024-06-04 17:17:06,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:17:06,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:17:06,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2024-06-04 17:17:06,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3819444444444444 [2024-06-04 17:17:06,829 INFO L175 Difference]: Start difference. First operand has 129 places, 107 transitions, 856 flow. Second operand 9 states and 110 transitions. [2024-06-04 17:17:06,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 120 transitions, 1126 flow [2024-06-04 17:17:06,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 120 transitions, 1057 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-04 17:17:06,853 INFO L231 Difference]: Finished difference. Result has 133 places, 107 transitions, 827 flow [2024-06-04 17:17:06,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=787, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=827, PETRI_PLACES=133, PETRI_TRANSITIONS=107} [2024-06-04 17:17:06,854 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 102 predicate places. [2024-06-04 17:17:06,854 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 107 transitions, 827 flow [2024-06-04 17:17:06,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:17:06,854 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:17:06,854 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:17:06,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-04 17:17:06,855 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:17:06,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:17:06,855 INFO L85 PathProgramCache]: Analyzing trace with hash 997794548, now seen corresponding path program 1 times [2024-06-04 17:17:06,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:17:06,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055837774] [2024-06-04 17:17:06,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:17:06,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:17:06,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:17:13,111 INFO 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:17:13,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:17:13,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055837774] [2024-06-04 17:17:13,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055837774] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:17:13,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:17:13,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:17:13,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766452784] [2024-06-04 17:17:13,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:17:13,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:17:13,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:17:13,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:17:13,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:17:13,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:17:13,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 107 transitions, 827 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:17:13,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:17:13,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:17:13,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:17:13,611 INFO L124 PetriNetUnfolderBase]: 268/513 cut-off events. [2024-06-04 17:17:13,612 INFO L125 PetriNetUnfolderBase]: For 15390/15390 co-relation queries the response was YES. [2024-06-04 17:17:13,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2760 conditions, 513 events. 268/513 cut-off events. For 15390/15390 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2282 event pairs, 37 based on Foata normal form. 2/514 useless extension candidates. Maximal degree in co-relation 2696. Up to 428 conditions per place. [2024-06-04 17:17:13,615 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 99 selfloop transitions, 23 changer transitions 0/125 dead transitions. [2024-06-04 17:17:13,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 125 transitions, 1157 flow [2024-06-04 17:17:13,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:17:13,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:17:13,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-04 17:17:13,617 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.384375 [2024-06-04 17:17:13,617 INFO L175 Difference]: Start difference. First operand has 133 places, 107 transitions, 827 flow. Second operand 10 states and 123 transitions. [2024-06-04 17:17:13,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 125 transitions, 1157 flow [2024-06-04 17:17:13,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 125 transitions, 1111 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-04 17:17:13,644 INFO L231 Difference]: Finished difference. Result has 135 places, 110 transitions, 877 flow [2024-06-04 17:17:13,644 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=877, PETRI_PLACES=135, PETRI_TRANSITIONS=110} [2024-06-04 17:17:13,644 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 104 predicate places. [2024-06-04 17:17:13,644 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 110 transitions, 877 flow [2024-06-04 17:17:13,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:17:13,645 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:17:13,645 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:17:13,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-04 17:17:13,645 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:17:13,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:17:13,645 INFO L85 PathProgramCache]: Analyzing trace with hash 424501367, now seen corresponding path program 7 times [2024-06-04 17:17:13,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:17:13,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182751991] [2024-06-04 17:17:13,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:17:13,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:17:13,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:17:19,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:17:19,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:17:19,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182751991] [2024-06-04 17:17:19,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182751991] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:17:19,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:17:19,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:17:19,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148820287] [2024-06-04 17:17:19,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:17:19,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:17:19,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:17:19,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:17:19,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:17:19,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:17:19,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 110 transitions, 877 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:17:19,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:17:19,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:17:19,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:17:19,474 INFO L124 PetriNetUnfolderBase]: 272/520 cut-off events. [2024-06-04 17:17:19,474 INFO L125 PetriNetUnfolderBase]: For 16368/16370 co-relation queries the response was YES. [2024-06-04 17:17:19,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2894 conditions, 520 events. 272/520 cut-off events. For 16368/16370 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2309 event pairs, 40 based on Foata normal form. 4/523 useless extension candidates. Maximal degree in co-relation 2829. Up to 428 conditions per place. [2024-06-04 17:17:19,477 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 90 selfloop transitions, 29 changer transitions 0/122 dead transitions. [2024-06-04 17:17:19,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 122 transitions, 1167 flow [2024-06-04 17:17:19,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:17:19,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:17:19,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2024-06-04 17:17:19,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3819444444444444 [2024-06-04 17:17:19,478 INFO L175 Difference]: Start difference. First operand has 135 places, 110 transitions, 877 flow. Second operand 9 states and 110 transitions. [2024-06-04 17:17:19,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 122 transitions, 1167 flow [2024-06-04 17:17:19,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 122 transitions, 1093 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-06-04 17:17:19,504 INFO L231 Difference]: Finished difference. Result has 136 places, 111 transitions, 889 flow [2024-06-04 17:17:19,504 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=889, PETRI_PLACES=136, PETRI_TRANSITIONS=111} [2024-06-04 17:17:19,505 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 105 predicate places. [2024-06-04 17:17:19,505 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 111 transitions, 889 flow [2024-06-04 17:17:19,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:17:19,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:17:19,505 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:17:19,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-04 17:17:19,505 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:17:19,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:17:19,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1596666291, now seen corresponding path program 8 times [2024-06-04 17:17:19,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:17:19,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504498280] [2024-06-04 17:17:19,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:17:19,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:17:19,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:17:24,340 INFO 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:17:24,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:17:24,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504498280] [2024-06-04 17:17:24,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504498280] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:17:24,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:17:24,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:17:24,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8808498] [2024-06-04 17:17:24,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:17:24,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:17:24,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:17:24,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:17:24,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:17:24,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:17:24,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 111 transitions, 889 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:17:24,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:17:24,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:17:24,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:17:24,816 INFO L124 PetriNetUnfolderBase]: 279/541 cut-off events. [2024-06-04 17:17:24,817 INFO L125 PetriNetUnfolderBase]: For 17332/17334 co-relation queries the response was YES. [2024-06-04 17:17:24,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2996 conditions, 541 events. 279/541 cut-off events. For 17332/17334 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2483 event pairs, 46 based on Foata normal form. 4/544 useless extension candidates. Maximal degree in co-relation 2930. Up to 440 conditions per place. [2024-06-04 17:17:24,820 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 92 selfloop transitions, 30 changer transitions 0/125 dead transitions. [2024-06-04 17:17:24,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 125 transitions, 1207 flow [2024-06-04 17:17:24,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:17:24,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:17:24,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-04 17:17:24,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2024-06-04 17:17:24,834 INFO L175 Difference]: Start difference. First operand has 136 places, 111 transitions, 889 flow. Second operand 9 states and 111 transitions. [2024-06-04 17:17:24,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 125 transitions, 1207 flow [2024-06-04 17:17:24,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 125 transitions, 1127 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-04 17:17:24,862 INFO L231 Difference]: Finished difference. Result has 138 places, 114 transitions, 919 flow [2024-06-04 17:17:24,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=813, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=919, PETRI_PLACES=138, PETRI_TRANSITIONS=114} [2024-06-04 17:17:24,864 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 107 predicate places. [2024-06-04 17:17:24,864 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 114 transitions, 919 flow [2024-06-04 17:17:24,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:17:24,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:17:24,864 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:17:24,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-04 17:17:24,864 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:17:24,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:17:24,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1596814161, now seen corresponding path program 9 times [2024-06-04 17:17:24,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:17:24,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412636439] [2024-06-04 17:17:24,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:17:24,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:17:24,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:17:30,074 INFO 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:17:30,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:17:30,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412636439] [2024-06-04 17:17:30,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412636439] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:17:30,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:17:30,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:17:30,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287538827] [2024-06-04 17:17:30,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:17:30,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:17:30,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:17:30,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:17:30,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:17:30,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:17:30,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 114 transitions, 919 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:17:30,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:17:30,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:17:30,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:17:30,494 INFO L124 PetriNetUnfolderBase]: 283/545 cut-off events. [2024-06-04 17:17:30,494 INFO L125 PetriNetUnfolderBase]: For 18264/18266 co-relation queries the response was YES. [2024-06-04 17:17:30,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3045 conditions, 545 events. 283/545 cut-off events. For 18264/18266 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2501 event pairs, 42 based on Foata normal form. 4/548 useless extension candidates. Maximal degree in co-relation 2978. Up to 419 conditions per place. [2024-06-04 17:17:30,498 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 92 selfloop transitions, 33 changer transitions 0/128 dead transitions. [2024-06-04 17:17:30,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 128 transitions, 1311 flow [2024-06-04 17:17:30,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:17:30,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:17:30,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-04 17:17:30,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3923611111111111 [2024-06-04 17:17:30,508 INFO L175 Difference]: Start difference. First operand has 138 places, 114 transitions, 919 flow. Second operand 9 states and 113 transitions. [2024-06-04 17:17:30,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 128 transitions, 1311 flow [2024-06-04 17:17:30,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 128 transitions, 1239 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-06-04 17:17:30,540 INFO L231 Difference]: Finished difference. Result has 142 places, 115 transitions, 943 flow [2024-06-04 17:17:30,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=847, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=943, PETRI_PLACES=142, PETRI_TRANSITIONS=115} [2024-06-04 17:17:30,541 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 111 predicate places. [2024-06-04 17:17:30,541 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 115 transitions, 943 flow [2024-06-04 17:17:30,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:17:30,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:17:30,541 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:17:30,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-04 17:17:30,542 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:17:30,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:17:30,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1949500309, now seen corresponding path program 10 times [2024-06-04 17:17:30,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:17:30,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341458513] [2024-06-04 17:17:30,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:17:30,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:17:30,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:17:35,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 17:17:35,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:17:35,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341458513] [2024-06-04 17:17:35,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341458513] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:17:35,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:17:35,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:17:35,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065107056] [2024-06-04 17:17:35,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:17:35,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:17:35,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:17:35,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:17:35,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:17:36,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:17:36,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 115 transitions, 943 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:17:36,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:17:36,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:17:36,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:17:36,422 INFO L124 PetriNetUnfolderBase]: 280/546 cut-off events. [2024-06-04 17:17:36,422 INFO L125 PetriNetUnfolderBase]: For 17152/17154 co-relation queries the response was YES. [2024-06-04 17:17:36,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2927 conditions, 546 events. 280/546 cut-off events. For 17152/17154 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2551 event pairs, 47 based on Foata normal form. 4/549 useless extension candidates. Maximal degree in co-relation 2860. Up to 443 conditions per place. [2024-06-04 17:17:36,426 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 94 selfloop transitions, 29 changer transitions 0/126 dead transitions. [2024-06-04 17:17:36,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 126 transitions, 1219 flow [2024-06-04 17:17:36,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:17:36,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:17:36,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2024-06-04 17:17:36,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-06-04 17:17:36,427 INFO L175 Difference]: Start difference. First operand has 142 places, 115 transitions, 943 flow. Second operand 9 states and 112 transitions. [2024-06-04 17:17:36,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 126 transitions, 1219 flow [2024-06-04 17:17:36,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 126 transitions, 1102 flow, removed 22 selfloop flow, removed 7 redundant places. [2024-06-04 17:17:36,460 INFO L231 Difference]: Finished difference. Result has 144 places, 115 transitions, 888 flow [2024-06-04 17:17:36,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=888, PETRI_PLACES=144, PETRI_TRANSITIONS=115} [2024-06-04 17:17:36,460 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 113 predicate places. [2024-06-04 17:17:36,460 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 115 transitions, 888 flow [2024-06-04 17:17:36,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:17:36,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:17:36,461 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:17:36,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-04 17:17:36,461 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:17:36,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:17:36,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1591088430, now seen corresponding path program 2 times [2024-06-04 17:17:36,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:17:36,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801174317] [2024-06-04 17:17:36,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:17:36,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:17:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:17:43,029 INFO 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:17:43,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:17:43,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801174317] [2024-06-04 17:17:43,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801174317] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:17:43,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:17:43,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:17:43,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937975512] [2024-06-04 17:17:43,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:17:43,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:17:43,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:17:43,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:17:43,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:17:43,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:17:43,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 115 transitions, 888 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:17:43,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:17:43,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:17:43,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:17:43,532 INFO L124 PetriNetUnfolderBase]: 286/554 cut-off events. [2024-06-04 17:17:43,532 INFO L125 PetriNetUnfolderBase]: For 17499/17501 co-relation queries the response was YES. [2024-06-04 17:17:43,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2872 conditions, 554 events. 286/554 cut-off events. For 17499/17501 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2582 event pairs, 43 based on Foata normal form. 4/557 useless extension candidates. Maximal degree in co-relation 2805. Up to 375 conditions per place. [2024-06-04 17:17:43,550 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 88 selfloop transitions, 42 changer transitions 0/133 dead transitions. [2024-06-04 17:17:43,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 133 transitions, 1254 flow [2024-06-04 17:17:43,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:17:43,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:17:43,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-04 17:17:43,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403125 [2024-06-04 17:17:43,553 INFO L175 Difference]: Start difference. First operand has 144 places, 115 transitions, 888 flow. Second operand 10 states and 129 transitions. [2024-06-04 17:17:43,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 133 transitions, 1254 flow [2024-06-04 17:17:43,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 133 transitions, 1124 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-04 17:17:43,585 INFO L231 Difference]: Finished difference. Result has 144 places, 118 transitions, 898 flow [2024-06-04 17:17:43,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=898, PETRI_PLACES=144, PETRI_TRANSITIONS=118} [2024-06-04 17:17:43,586 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 113 predicate places. [2024-06-04 17:17:43,587 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 118 transitions, 898 flow [2024-06-04 17:17:43,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:17:43,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:17:43,587 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:17:43,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-04 17:17:43,587 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:17:43,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:17:43,588 INFO L85 PathProgramCache]: Analyzing trace with hash 424716848, now seen corresponding path program 3 times [2024-06-04 17:17:43,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:17:43,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774407306] [2024-06-04 17:17:43,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:17:43,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:17:43,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:17:50,336 INFO 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:17:50,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:17:50,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774407306] [2024-06-04 17:17:50,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774407306] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:17:50,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:17:50,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:17:50,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684165290] [2024-06-04 17:17:50,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:17:50,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:17:50,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:17:50,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:17:50,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:17:50,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:17:50,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 118 transitions, 898 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:17:50,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:17:50,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:17:50,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:17:50,766 INFO L124 PetriNetUnfolderBase]: 292/560 cut-off events. [2024-06-04 17:17:50,766 INFO L125 PetriNetUnfolderBase]: For 18327/18329 co-relation queries the response was YES. [2024-06-04 17:17:50,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2947 conditions, 560 events. 292/560 cut-off events. For 18327/18329 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2583 event pairs, 41 based on Foata normal form. 4/563 useless extension candidates. Maximal degree in co-relation 2880. Up to 385 conditions per place. [2024-06-04 17:17:50,770 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 90 selfloop transitions, 43 changer transitions 0/136 dead transitions. [2024-06-04 17:17:50,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 136 transitions, 1282 flow [2024-06-04 17:17:50,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:17:50,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:17:50,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2024-06-04 17:17:50,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-04 17:17:50,771 INFO L175 Difference]: Start difference. First operand has 144 places, 118 transitions, 898 flow. Second operand 10 states and 128 transitions. [2024-06-04 17:17:50,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 136 transitions, 1282 flow [2024-06-04 17:17:50,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 136 transitions, 1166 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-06-04 17:17:50,804 INFO L231 Difference]: Finished difference. Result has 146 places, 121 transitions, 928 flow [2024-06-04 17:17:50,805 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=928, PETRI_PLACES=146, PETRI_TRANSITIONS=121} [2024-06-04 17:17:50,805 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 115 predicate places. [2024-06-04 17:17:50,805 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 121 transitions, 928 flow [2024-06-04 17:17:50,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:17:50,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:17:50,805 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:17:50,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-04 17:17:50,806 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:17:50,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:17:50,806 INFO L85 PathProgramCache]: Analyzing trace with hash 681217358, now seen corresponding path program 4 times [2024-06-04 17:17:50,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:17:50,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739666867] [2024-06-04 17:17:50,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:17:50,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:17:50,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:17:57,518 INFO 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:17:57,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:17:57,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739666867] [2024-06-04 17:17:57,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739666867] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:17:57,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:17:57,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:17:57,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705105262] [2024-06-04 17:17:57,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:17:57,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:17:57,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:17:57,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:17:57,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:17:57,644 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:17:57,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 121 transitions, 928 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:17:57,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:17:57,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:17:57,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:17:57,949 INFO L124 PetriNetUnfolderBase]: 298/570 cut-off events. [2024-06-04 17:17:57,949 INFO L125 PetriNetUnfolderBase]: For 19281/19283 co-relation queries the response was YES. [2024-06-04 17:17:57,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3062 conditions, 570 events. 298/570 cut-off events. For 19281/19283 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2634 event pairs, 41 based on Foata normal form. 4/573 useless extension candidates. Maximal degree in co-relation 2994. Up to 395 conditions per place. [2024-06-04 17:17:57,953 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 86 selfloop transitions, 49 changer transitions 0/138 dead transitions. [2024-06-04 17:17:57,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 138 transitions, 1318 flow [2024-06-04 17:17:57,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:17:57,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:17:57,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-04 17:17:57,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.396875 [2024-06-04 17:17:57,966 INFO L175 Difference]: Start difference. First operand has 146 places, 121 transitions, 928 flow. Second operand 10 states and 127 transitions. [2024-06-04 17:17:57,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 138 transitions, 1318 flow [2024-06-04 17:17:57,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 138 transitions, 1194 flow, removed 21 selfloop flow, removed 8 redundant places. [2024-06-04 17:17:58,000 INFO L231 Difference]: Finished difference. Result has 148 places, 124 transitions, 968 flow [2024-06-04 17:17:58,000 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=968, PETRI_PLACES=148, PETRI_TRANSITIONS=124} [2024-06-04 17:17:58,000 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 117 predicate places. [2024-06-04 17:17:58,001 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 124 transitions, 968 flow [2024-06-04 17:17:58,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:17:58,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:17:58,001 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:17:58,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-04 17:17:58,001 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:17:58,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:17:58,002 INFO L85 PathProgramCache]: Analyzing trace with hash 432126158, now seen corresponding path program 5 times [2024-06-04 17:17:58,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:17:58,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375454928] [2024-06-04 17:17:58,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:17:58,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:17:58,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:18:04,494 INFO 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:18:04,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:18:04,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375454928] [2024-06-04 17:18:04,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375454928] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:18:04,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:18:04,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:18:04,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922657643] [2024-06-04 17:18:04,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:18:04,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:18:04,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:18:04,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:18:04,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:18:04,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:18:04,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 124 transitions, 968 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:18:04,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:18:04,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:18:04,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:18:05,030 INFO L124 PetriNetUnfolderBase]: 301/573 cut-off events. [2024-06-04 17:18:05,030 INFO L125 PetriNetUnfolderBase]: For 18962/18964 co-relation queries the response was YES. [2024-06-04 17:18:05,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3133 conditions, 573 events. 301/573 cut-off events. For 18962/18964 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2638 event pairs, 44 based on Foata normal form. 1/573 useless extension candidates. Maximal degree in co-relation 3064. Up to 521 conditions per place. [2024-06-04 17:18:05,034 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 119 selfloop transitions, 16 changer transitions 0/138 dead transitions. [2024-06-04 17:18:05,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 138 transitions, 1309 flow [2024-06-04 17:18:05,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:18:05,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:18:05,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-04 17:18:05,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.359375 [2024-06-04 17:18:05,036 INFO L175 Difference]: Start difference. First operand has 148 places, 124 transitions, 968 flow. Second operand 10 states and 115 transitions. [2024-06-04 17:18:05,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 138 transitions, 1309 flow [2024-06-04 17:18:05,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 138 transitions, 1165 flow, removed 24 selfloop flow, removed 8 redundant places. [2024-06-04 17:18:05,066 INFO L231 Difference]: Finished difference. Result has 151 places, 128 transitions, 917 flow [2024-06-04 17:18:05,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=917, PETRI_PLACES=151, PETRI_TRANSITIONS=128} [2024-06-04 17:18:05,067 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 120 predicate places. [2024-06-04 17:18:05,067 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 128 transitions, 917 flow [2024-06-04 17:18:05,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:18:05,067 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:18:05,067 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:18:05,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-04 17:18:05,068 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:18:05,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:18:05,068 INFO L85 PathProgramCache]: Analyzing trace with hash 690740558, now seen corresponding path program 6 times [2024-06-04 17:18:05,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:18:05,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801516883] [2024-06-04 17:18:05,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:18:05,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:18:05,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:18:11,289 INFO 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:18:11,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:18:11,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801516883] [2024-06-04 17:18:11,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801516883] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:18:11,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:18:11,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:18:11,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911637387] [2024-06-04 17:18:11,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:18:11,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:18:11,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:18:11,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:18:11,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:18:11,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:18:11,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 128 transitions, 917 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:18:11,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:18:11,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:18:11,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:18:11,789 INFO L124 PetriNetUnfolderBase]: 299/572 cut-off events. [2024-06-04 17:18:11,789 INFO L125 PetriNetUnfolderBase]: For 18352/18354 co-relation queries the response was YES. [2024-06-04 17:18:11,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3001 conditions, 572 events. 299/572 cut-off events. For 18352/18354 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2636 event pairs, 46 based on Foata normal form. 1/572 useless extension candidates. Maximal degree in co-relation 2930. Up to 512 conditions per place. [2024-06-04 17:18:11,793 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 118 selfloop transitions, 20 changer transitions 0/141 dead transitions. [2024-06-04 17:18:11,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 141 transitions, 1249 flow [2024-06-04 17:18:11,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:18:11,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:18:11,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 126 transitions. [2024-06-04 17:18:11,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35795454545454547 [2024-06-04 17:18:11,797 INFO L175 Difference]: Start difference. First operand has 151 places, 128 transitions, 917 flow. Second operand 11 states and 126 transitions. [2024-06-04 17:18:11,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 141 transitions, 1249 flow [2024-06-04 17:18:11,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 141 transitions, 1198 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-06-04 17:18:11,831 INFO L231 Difference]: Finished difference. Result has 156 places, 130 transitions, 945 flow [2024-06-04 17:18:11,831 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=866, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=945, PETRI_PLACES=156, PETRI_TRANSITIONS=130} [2024-06-04 17:18:11,832 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 125 predicate places. [2024-06-04 17:18:11,832 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 130 transitions, 945 flow [2024-06-04 17:18:11,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:18:11,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:18:11,832 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:18:11,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-04 17:18:11,832 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:18:11,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:18:11,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1067330776, now seen corresponding path program 1 times [2024-06-04 17:18:11,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:18:11,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324502663] [2024-06-04 17:18:11,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:18:11,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:18:11,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:18:16,793 INFO 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:18:16,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:18:16,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324502663] [2024-06-04 17:18:16,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324502663] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:18:16,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:18:16,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:18:16,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466316482] [2024-06-04 17:18:16,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:18:16,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:18:16,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:18:16,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:18:16,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:18:16,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:18:16,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 130 transitions, 945 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:18:16,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:18:16,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:18:16,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:18:17,281 INFO L124 PetriNetUnfolderBase]: 303/581 cut-off events. [2024-06-04 17:18:17,282 INFO L125 PetriNetUnfolderBase]: For 20196/20196 co-relation queries the response was YES. [2024-06-04 17:18:17,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3079 conditions, 581 events. 303/581 cut-off events. For 20196/20196 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2701 event pairs, 24 based on Foata normal form. 2/582 useless extension candidates. Maximal degree in co-relation 3006. Up to 469 conditions per place. [2024-06-04 17:18:17,285 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 129 selfloop transitions, 18 changer transitions 0/150 dead transitions. [2024-06-04 17:18:17,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 150 transitions, 1297 flow [2024-06-04 17:18:17,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:18:17,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:18:17,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-04 17:18:17,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-04 17:18:17,286 INFO L175 Difference]: Start difference. First operand has 156 places, 130 transitions, 945 flow. Second operand 10 states and 120 transitions. [2024-06-04 17:18:17,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 150 transitions, 1297 flow [2024-06-04 17:18:17,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 150 transitions, 1234 flow, removed 13 selfloop flow, removed 9 redundant places. [2024-06-04 17:18:17,327 INFO L231 Difference]: Finished difference. Result has 157 places, 131 transitions, 932 flow [2024-06-04 17:18:17,327 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=932, PETRI_PLACES=157, PETRI_TRANSITIONS=131} [2024-06-04 17:18:17,328 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 126 predicate places. [2024-06-04 17:18:17,328 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 131 transitions, 932 flow [2024-06-04 17:18:17,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:18:17,328 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:18:17,328 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:18:17,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-04 17:18:17,328 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:18:17,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:18:17,329 INFO L85 PathProgramCache]: Analyzing trace with hash -477513990, now seen corresponding path program 2 times [2024-06-04 17:18:17,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:18:17,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815062987] [2024-06-04 17:18:17,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:18:17,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:18:17,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:18:22,514 INFO 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:18:22,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:18:22,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815062987] [2024-06-04 17:18:22,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815062987] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:18:22,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:18:22,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:18:22,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218362814] [2024-06-04 17:18:22,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:18:22,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:18:22,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:18:22,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:18:22,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:18:22,639 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:18:22,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 131 transitions, 932 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:18:22,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:18:22,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:18:22,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:18:22,961 INFO L124 PetriNetUnfolderBase]: 314/602 cut-off events. [2024-06-04 17:18:22,961 INFO L125 PetriNetUnfolderBase]: For 23373/23373 co-relation queries the response was YES. [2024-06-04 17:18:22,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3274 conditions, 602 events. 314/602 cut-off events. For 23373/23373 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2831 event pairs, 43 based on Foata normal form. 2/603 useless extension candidates. Maximal degree in co-relation 3200. Up to 494 conditions per place. [2024-06-04 17:18:22,966 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 123 selfloop transitions, 25 changer transitions 0/151 dead transitions. [2024-06-04 17:18:22,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 151 transitions, 1394 flow [2024-06-04 17:18:22,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:18:22,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:18:22,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-04 17:18:22,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-04 17:18:22,967 INFO L175 Difference]: Start difference. First operand has 157 places, 131 transitions, 932 flow. Second operand 10 states and 124 transitions. [2024-06-04 17:18:22,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 151 transitions, 1394 flow [2024-06-04 17:18:23,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 151 transitions, 1354 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-04 17:18:23,017 INFO L231 Difference]: Finished difference. Result has 159 places, 133 transitions, 968 flow [2024-06-04 17:18:23,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=968, PETRI_PLACES=159, PETRI_TRANSITIONS=133} [2024-06-04 17:18:23,018 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 128 predicate places. [2024-06-04 17:18:23,018 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 133 transitions, 968 flow [2024-06-04 17:18:23,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:18:23,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:18:23,018 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:18:23,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-04 17:18:23,018 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:18:23,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:18:23,019 INFO L85 PathProgramCache]: Analyzing trace with hash -846820690, now seen corresponding path program 3 times [2024-06-04 17:18:23,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:18:23,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500471896] [2024-06-04 17:18:23,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:18:23,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:18:23,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:18:28,076 INFO 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:18:28,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:18:28,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500471896] [2024-06-04 17:18:28,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500471896] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:18:28,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:18:28,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:18:28,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328856724] [2024-06-04 17:18:28,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:18:28,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:18:28,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:18:28,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:18:28,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:18:28,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:18:28,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 133 transitions, 968 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:18:28,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:18:28,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:18:28,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:18:28,576 INFO L124 PetriNetUnfolderBase]: 311/597 cut-off events. [2024-06-04 17:18:28,576 INFO L125 PetriNetUnfolderBase]: For 22047/22047 co-relation queries the response was YES. [2024-06-04 17:18:28,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3188 conditions, 597 events. 311/597 cut-off events. For 22047/22047 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2807 event pairs, 44 based on Foata normal form. 2/598 useless extension candidates. Maximal degree in co-relation 3113. Up to 508 conditions per place. [2024-06-04 17:18:28,580 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 121 selfloop transitions, 25 changer transitions 0/149 dead transitions. [2024-06-04 17:18:28,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 149 transitions, 1304 flow [2024-06-04 17:18:28,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:18:28,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:18:28,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2024-06-04 17:18:28,581 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.378125 [2024-06-04 17:18:28,581 INFO L175 Difference]: Start difference. First operand has 159 places, 133 transitions, 968 flow. Second operand 10 states and 121 transitions. [2024-06-04 17:18:28,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 149 transitions, 1304 flow [2024-06-04 17:18:28,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 149 transitions, 1257 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-04 17:18:28,632 INFO L231 Difference]: Finished difference. Result has 163 places, 133 transitions, 975 flow [2024-06-04 17:18:28,633 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=921, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=975, PETRI_PLACES=163, PETRI_TRANSITIONS=133} [2024-06-04 17:18:28,633 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 132 predicate places. [2024-06-04 17:18:28,633 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 133 transitions, 975 flow [2024-06-04 17:18:28,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:18:28,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:18:28,634 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:18:28,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-04 17:18:28,634 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:18:28,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:18:28,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1620077654, now seen corresponding path program 4 times [2024-06-04 17:18:28,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:18:28,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128088890] [2024-06-04 17:18:28,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:18:28,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:18:28,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:18:34,845 INFO 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:18:34,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:18:34,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128088890] [2024-06-04 17:18:34,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128088890] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:18:34,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:18:34,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:18:34,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180042025] [2024-06-04 17:18:34,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:18:34,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:18:34,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:18:34,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:18:34,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:18:34,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:18:35,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 133 transitions, 975 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:18:35,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:18:35,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:18:35,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:18:35,335 INFO L124 PetriNetUnfolderBase]: 315/605 cut-off events. [2024-06-04 17:18:35,335 INFO L125 PetriNetUnfolderBase]: For 22860/22860 co-relation queries the response was YES. [2024-06-04 17:18:35,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3250 conditions, 605 events. 315/605 cut-off events. For 22860/22860 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2848 event pairs, 40 based on Foata normal form. 2/606 useless extension candidates. Maximal degree in co-relation 3173. Up to 476 conditions per place. [2024-06-04 17:18:35,339 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 124 selfloop transitions, 25 changer transitions 0/152 dead transitions. [2024-06-04 17:18:35,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 152 transitions, 1333 flow [2024-06-04 17:18:35,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:18:35,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:18:35,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-04 17:18:35,340 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-04 17:18:35,340 INFO L175 Difference]: Start difference. First operand has 163 places, 133 transitions, 975 flow. Second operand 10 states and 125 transitions. [2024-06-04 17:18:35,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 152 transitions, 1333 flow [2024-06-04 17:18:35,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 152 transitions, 1280 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-04 17:18:35,387 INFO L231 Difference]: Finished difference. Result has 164 places, 134 transitions, 990 flow [2024-06-04 17:18:35,388 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=922, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=990, PETRI_PLACES=164, PETRI_TRANSITIONS=134} [2024-06-04 17:18:35,388 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 133 predicate places. [2024-06-04 17:18:35,388 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 134 transitions, 990 flow [2024-06-04 17:18:35,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:18:35,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:18:35,389 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:18:35,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-04 17:18:35,389 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:18:35,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:18:35,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1351070096, now seen corresponding path program 1 times [2024-06-04 17:18:35,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:18:35,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997769034] [2024-06-04 17:18:35,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:18:35,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:18:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:18:41,842 INFO 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:18:41,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:18:41,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997769034] [2024-06-04 17:18:41,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997769034] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:18:41,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:18:41,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:18:41,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844884646] [2024-06-04 17:18:41,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:18:41,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:18:41,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:18:41,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:18:41,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:18:42,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:18:42,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 134 transitions, 990 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:18:42,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:18:42,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:18:42,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:18:42,346 INFO L124 PetriNetUnfolderBase]: 318/612 cut-off events. [2024-06-04 17:18:42,346 INFO L125 PetriNetUnfolderBase]: For 22692/22692 co-relation queries the response was YES. [2024-06-04 17:18:42,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3338 conditions, 612 events. 318/612 cut-off events. For 22692/22692 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 2897 event pairs, 43 based on Foata normal form. 1/612 useless extension candidates. Maximal degree in co-relation 3260. Up to 521 conditions per place. [2024-06-04 17:18:42,350 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 121 selfloop transitions, 28 changer transitions 0/152 dead transitions. [2024-06-04 17:18:42,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 152 transitions, 1382 flow [2024-06-04 17:18:42,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:18:42,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:18:42,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 131 transitions. [2024-06-04 17:18:42,351 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3721590909090909 [2024-06-04 17:18:42,351 INFO L175 Difference]: Start difference. First operand has 164 places, 134 transitions, 990 flow. Second operand 11 states and 131 transitions. [2024-06-04 17:18:42,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 152 transitions, 1382 flow [2024-06-04 17:18:42,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 152 transitions, 1324 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-04 17:18:42,408 INFO L231 Difference]: Finished difference. Result has 167 places, 136 transitions, 1047 flow [2024-06-04 17:18:42,408 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=932, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1047, PETRI_PLACES=167, PETRI_TRANSITIONS=136} [2024-06-04 17:18:42,409 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 136 predicate places. [2024-06-04 17:18:42,409 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 136 transitions, 1047 flow [2024-06-04 17:18:42,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:18:42,409 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:18:42,409 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:18:42,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-04 17:18:42,409 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:18:42,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:18:42,409 INFO L85 PathProgramCache]: Analyzing trace with hash 860358468, now seen corresponding path program 5 times [2024-06-04 17:18:42,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:18:42,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696683475] [2024-06-04 17:18:42,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:18:42,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:18:42,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:18:47,492 INFO 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:18:47,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:18:47,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696683475] [2024-06-04 17:18:47,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696683475] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:18:47,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:18:47,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:18:47,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533939219] [2024-06-04 17:18:47,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:18:47,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:18:47,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:18:47,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:18:47,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:18:47,630 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:18:47,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 136 transitions, 1047 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:18:47,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:18:47,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:18:47,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:18:48,000 INFO L124 PetriNetUnfolderBase]: 328/632 cut-off events. [2024-06-04 17:18:48,000 INFO L125 PetriNetUnfolderBase]: For 24861/24861 co-relation queries the response was YES. [2024-06-04 17:18:48,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3442 conditions, 632 events. 328/632 cut-off events. For 24861/24861 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3031 event pairs, 45 based on Foata normal form. 2/633 useless extension candidates. Maximal degree in co-relation 3363. Up to 545 conditions per place. [2024-06-04 17:18:48,005 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 130 selfloop transitions, 23 changer transitions 0/156 dead transitions. [2024-06-04 17:18:48,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 156 transitions, 1449 flow [2024-06-04 17:18:48,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:18:48,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:18:48,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-04 17:18:48,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38125 [2024-06-04 17:18:48,006 INFO L175 Difference]: Start difference. First operand has 167 places, 136 transitions, 1047 flow. Second operand 10 states and 122 transitions. [2024-06-04 17:18:48,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 156 transitions, 1449 flow [2024-06-04 17:18:48,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 156 transitions, 1350 flow, removed 23 selfloop flow, removed 9 redundant places. [2024-06-04 17:18:48,064 INFO L231 Difference]: Finished difference. Result has 169 places, 142 transitions, 1067 flow [2024-06-04 17:18:48,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=948, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1067, PETRI_PLACES=169, PETRI_TRANSITIONS=142} [2024-06-04 17:18:48,065 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 138 predicate places. [2024-06-04 17:18:48,065 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 142 transitions, 1067 flow [2024-06-04 17:18:48,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:18:48,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:18:48,065 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:18:48,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-04 17:18:48,065 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:18:48,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:18:48,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1185615536, now seen corresponding path program 6 times [2024-06-04 17:18:48,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:18:48,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484838574] [2024-06-04 17:18:48,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:18:48,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:18:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:18:53,889 INFO 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:18:53,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:18:53,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484838574] [2024-06-04 17:18:53,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484838574] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:18:53,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:18:53,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:18:53,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143714316] [2024-06-04 17:18:53,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:18:53,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:18:53,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:18:53,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:18:53,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:18:54,135 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:18:54,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 142 transitions, 1067 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:18:54,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:18:54,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:18:54,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:18:54,410 INFO L124 PetriNetUnfolderBase]: 339/655 cut-off events. [2024-06-04 17:18:54,410 INFO L125 PetriNetUnfolderBase]: For 29199/29199 co-relation queries the response was YES. [2024-06-04 17:18:54,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3668 conditions, 655 events. 339/655 cut-off events. For 29199/29199 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3192 event pairs, 44 based on Foata normal form. 2/656 useless extension candidates. Maximal degree in co-relation 3587. Up to 543 conditions per place. [2024-06-04 17:18:54,415 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 132 selfloop transitions, 25 changer transitions 0/160 dead transitions. [2024-06-04 17:18:54,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 160 transitions, 1563 flow [2024-06-04 17:18:54,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:18:54,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:18:54,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-04 17:18:54,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-04 17:18:54,416 INFO L175 Difference]: Start difference. First operand has 169 places, 142 transitions, 1067 flow. Second operand 10 states and 124 transitions. [2024-06-04 17:18:54,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 160 transitions, 1563 flow [2024-06-04 17:18:54,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 160 transitions, 1509 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-06-04 17:18:54,483 INFO L231 Difference]: Finished difference. Result has 174 places, 144 transitions, 1101 flow [2024-06-04 17:18:54,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1013, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1101, PETRI_PLACES=174, PETRI_TRANSITIONS=144} [2024-06-04 17:18:54,483 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 143 predicate places. [2024-06-04 17:18:54,483 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 144 transitions, 1101 flow [2024-06-04 17:18:54,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:18:54,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:18:54,484 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:18:54,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-04 17:18:54,484 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:18:54,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:18:54,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1179181796, now seen corresponding path program 7 times [2024-06-04 17:18:54,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:18:54,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545407081] [2024-06-04 17:18:54,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:18:54,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:18:54,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:18:59,914 INFO 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:18:59,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:18:59,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545407081] [2024-06-04 17:18:59,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545407081] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:18:59,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:18:59,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:18:59,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246740323] [2024-06-04 17:18:59,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:18:59,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:18:59,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:18:59,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:18:59,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:19:00,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:19:00,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 144 transitions, 1101 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:19:00,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:19:00,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:19:00,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:19:00,309 INFO L124 PetriNetUnfolderBase]: 336/650 cut-off events. [2024-06-04 17:19:00,309 INFO L125 PetriNetUnfolderBase]: For 27177/27177 co-relation queries the response was YES. [2024-06-04 17:19:00,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3546 conditions, 650 events. 336/650 cut-off events. For 27177/27177 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3173 event pairs, 45 based on Foata normal form. 2/651 useless extension candidates. Maximal degree in co-relation 3464. Up to 561 conditions per place. [2024-06-04 17:19:00,313 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 131 selfloop transitions, 24 changer transitions 0/158 dead transitions. [2024-06-04 17:19:00,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 158 transitions, 1449 flow [2024-06-04 17:19:00,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:19:00,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:19:00,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2024-06-04 17:19:00,314 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.378125 [2024-06-04 17:19:00,314 INFO L175 Difference]: Start difference. First operand has 174 places, 144 transitions, 1101 flow. Second operand 10 states and 121 transitions. [2024-06-04 17:19:00,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 158 transitions, 1449 flow [2024-06-04 17:19:00,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 158 transitions, 1394 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-04 17:19:00,382 INFO L231 Difference]: Finished difference. Result has 178 places, 144 transitions, 1098 flow [2024-06-04 17:19:00,382 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1046, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1098, PETRI_PLACES=178, PETRI_TRANSITIONS=144} [2024-06-04 17:19:00,382 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 147 predicate places. [2024-06-04 17:19:00,383 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 144 transitions, 1098 flow [2024-06-04 17:19:00,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:19:00,383 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:19:00,383 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:19:00,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-04 17:19:00,383 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:19:00,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:19:00,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1351671686, now seen corresponding path program 8 times [2024-06-04 17:19:00,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:19:00,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859038090] [2024-06-04 17:19:00,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:19:00,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:19:00,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:19:05,471 INFO 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:19:05,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:19:05,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859038090] [2024-06-04 17:19:05,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859038090] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:19:05,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:19:05,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:19:05,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764308659] [2024-06-04 17:19:05,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:19:05,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:19:05,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:19:05,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:19:05,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:19:05,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:19:05,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 144 transitions, 1098 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:19:05,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:19:05,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:19:05,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:19:05,866 INFO L124 PetriNetUnfolderBase]: 340/658 cut-off events. [2024-06-04 17:19:05,866 INFO L125 PetriNetUnfolderBase]: For 27972/27972 co-relation queries the response was YES. [2024-06-04 17:19:05,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3601 conditions, 658 events. 340/658 cut-off events. For 27972/27972 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3217 event pairs, 47 based on Foata normal form. 2/659 useless extension candidates. Maximal degree in co-relation 3517. Up to 569 conditions per place. [2024-06-04 17:19:05,871 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 133 selfloop transitions, 24 changer transitions 0/160 dead transitions. [2024-06-04 17:19:05,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 160 transitions, 1480 flow [2024-06-04 17:19:05,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:19:05,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:19:05,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-04 17:19:05,872 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38125 [2024-06-04 17:19:05,872 INFO L175 Difference]: Start difference. First operand has 178 places, 144 transitions, 1098 flow. Second operand 10 states and 122 transitions. [2024-06-04 17:19:05,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 160 transitions, 1480 flow [2024-06-04 17:19:05,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 160 transitions, 1418 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-04 17:19:05,938 INFO L231 Difference]: Finished difference. Result has 179 places, 146 transitions, 1120 flow [2024-06-04 17:19:05,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1038, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1120, PETRI_PLACES=179, PETRI_TRANSITIONS=146} [2024-06-04 17:19:05,938 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 148 predicate places. [2024-06-04 17:19:05,938 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 146 transitions, 1120 flow [2024-06-04 17:19:05,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:19:05,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:19:05,939 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:19:05,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-04 17:19:05,939 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:19:05,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:19:05,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1351849316, now seen corresponding path program 9 times [2024-06-04 17:19:05,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:19:05,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775934908] [2024-06-04 17:19:05,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:19:05,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:19:05,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:19:11,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 17:19:11,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:19:11,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775934908] [2024-06-04 17:19:11,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775934908] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:19:11,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:19:11,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:19:11,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440829222] [2024-06-04 17:19:11,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:19:11,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:19:11,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:19:11,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:19:11,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:19:11,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:19:11,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 146 transitions, 1120 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:19:11,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:19:11,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:19:11,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:19:12,453 INFO L124 PetriNetUnfolderBase]: 344/666 cut-off events. [2024-06-04 17:19:12,453 INFO L125 PetriNetUnfolderBase]: For 29024/29024 co-relation queries the response was YES. [2024-06-04 17:19:12,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3665 conditions, 666 events. 344/666 cut-off events. For 29024/29024 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3277 event pairs, 47 based on Foata normal form. 2/667 useless extension candidates. Maximal degree in co-relation 3580. Up to 563 conditions per place. [2024-06-04 17:19:12,458 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 134 selfloop transitions, 25 changer transitions 0/162 dead transitions. [2024-06-04 17:19:12,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 162 transitions, 1498 flow [2024-06-04 17:19:12,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:19:12,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:19:12,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-04 17:19:12,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-04 17:19:12,459 INFO L175 Difference]: Start difference. First operand has 179 places, 146 transitions, 1120 flow. Second operand 10 states and 124 transitions. [2024-06-04 17:19:12,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 162 transitions, 1498 flow [2024-06-04 17:19:12,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 162 transitions, 1445 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-04 17:19:12,541 INFO L231 Difference]: Finished difference. Result has 183 places, 147 transitions, 1143 flow [2024-06-04 17:19:12,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1067, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1143, PETRI_PLACES=183, PETRI_TRANSITIONS=147} [2024-06-04 17:19:12,542 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 152 predicate places. [2024-06-04 17:19:12,542 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 147 transitions, 1143 flow [2024-06-04 17:19:12,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:19:12,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:19:12,542 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:19:12,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-04 17:19:12,542 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:19:12,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:19:12,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1356433286, now seen corresponding path program 10 times [2024-06-04 17:19:12,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:19:12,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130450878] [2024-06-04 17:19:12,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:19:12,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:19:12,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:19:18,121 INFO 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:19:18,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:19:18,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130450878] [2024-06-04 17:19:18,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130450878] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:19:18,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:19:18,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:19:18,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842075383] [2024-06-04 17:19:18,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:19:18,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:19:18,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:19:18,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:19:18,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:19:18,286 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:19:18,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 147 transitions, 1143 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:19:18,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:19:18,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:19:18,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:19:18,605 INFO L124 PetriNetUnfolderBase]: 348/673 cut-off events. [2024-06-04 17:19:18,606 INFO L125 PetriNetUnfolderBase]: For 30204/30206 co-relation queries the response was YES. [2024-06-04 17:19:18,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3728 conditions, 673 events. 348/673 cut-off events. For 30204/30206 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3326 event pairs, 47 based on Foata normal form. 2/674 useless extension candidates. Maximal degree in co-relation 3642. Up to 488 conditions per place. [2024-06-04 17:19:18,610 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 121 selfloop transitions, 39 changer transitions 0/163 dead transitions. [2024-06-04 17:19:18,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 163 transitions, 1521 flow [2024-06-04 17:19:18,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:19:18,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:19:18,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-04 17:19:18,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39375 [2024-06-04 17:19:18,611 INFO L175 Difference]: Start difference. First operand has 183 places, 147 transitions, 1143 flow. Second operand 10 states and 126 transitions. [2024-06-04 17:19:18,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 163 transitions, 1521 flow [2024-06-04 17:19:18,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 163 transitions, 1455 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-04 17:19:18,680 INFO L231 Difference]: Finished difference. Result has 185 places, 148 transitions, 1183 flow [2024-06-04 17:19:18,680 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1077, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1183, PETRI_PLACES=185, PETRI_TRANSITIONS=148} [2024-06-04 17:19:18,681 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 154 predicate places. [2024-06-04 17:19:18,681 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 148 transitions, 1183 flow [2024-06-04 17:19:18,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:19:18,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:19:18,681 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:19:18,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-04 17:19:18,681 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:19:18,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:19:18,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1178935532, now seen corresponding path program 1 times [2024-06-04 17:19:18,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:19:18,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817471586] [2024-06-04 17:19:18,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:19:18,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:19:18,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:19:25,155 INFO 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:19:25,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:19:25,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817471586] [2024-06-04 17:19:25,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817471586] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:19:25,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:19:25,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:19:25,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737589830] [2024-06-04 17:19:25,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:19:25,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:19:25,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:19:25,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:19:25,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:19:25,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:19:25,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 148 transitions, 1183 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:19:25,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:19:25,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:19:25,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:19:25,750 INFO L124 PetriNetUnfolderBase]: 368/718 cut-off events. [2024-06-04 17:19:25,750 INFO L125 PetriNetUnfolderBase]: For 48060/48060 co-relation queries the response was YES. [2024-06-04 17:19:25,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4002 conditions, 718 events. 368/718 cut-off events. For 48060/48060 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3623 event pairs, 53 based on Foata normal form. 12/729 useless extension candidates. Maximal degree in co-relation 3915. Up to 569 conditions per place. [2024-06-04 17:19:25,754 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 132 selfloop transitions, 24 changer transitions 10/169 dead transitions. [2024-06-04 17:19:25,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 169 transitions, 1661 flow [2024-06-04 17:19:25,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:19:25,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:19:25,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 137 transitions. [2024-06-04 17:19:25,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38920454545454547 [2024-06-04 17:19:25,755 INFO L175 Difference]: Start difference. First operand has 185 places, 148 transitions, 1183 flow. Second operand 11 states and 137 transitions. [2024-06-04 17:19:25,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 169 transitions, 1661 flow [2024-06-04 17:19:25,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 169 transitions, 1565 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-04 17:19:25,829 INFO L231 Difference]: Finished difference. Result has 188 places, 144 transitions, 1124 flow [2024-06-04 17:19:25,829 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1087, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1124, PETRI_PLACES=188, PETRI_TRANSITIONS=144} [2024-06-04 17:19:25,829 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 157 predicate places. [2024-06-04 17:19:25,829 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 144 transitions, 1124 flow [2024-06-04 17:19:25,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:19:25,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:19:25,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:19:25,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-04 17:19:25,830 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:19:25,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:19:25,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1178935842, now seen corresponding path program 2 times [2024-06-04 17:19:25,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:19:25,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397389332] [2024-06-04 17:19:25,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:19:25,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:19:25,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:19:31,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:19:31,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:19:31,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397389332] [2024-06-04 17:19:31,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397389332] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:19:31,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:19:31,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:19:31,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656507305] [2024-06-04 17:19:31,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:19:31,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:19:31,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:19:31,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:19:31,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:19:31,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:19:31,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 144 transitions, 1124 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:19:31,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:19:31,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:19:31,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:19:32,214 INFO L124 PetriNetUnfolderBase]: 353/700 cut-off events. [2024-06-04 17:19:32,214 INFO L125 PetriNetUnfolderBase]: For 31371/31373 co-relation queries the response was YES. [2024-06-04 17:19:32,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3896 conditions, 700 events. 353/700 cut-off events. For 31371/31373 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3576 event pairs, 55 based on Foata normal form. 1/700 useless extension candidates. Maximal degree in co-relation 3808. Up to 558 conditions per place. [2024-06-04 17:19:32,219 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 113 selfloop transitions, 43 changer transitions 1/160 dead transitions. [2024-06-04 17:19:32,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 160 transitions, 1546 flow [2024-06-04 17:19:32,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:19:32,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:19:32,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2024-06-04 17:19:32,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3806818181818182 [2024-06-04 17:19:32,220 INFO L175 Difference]: Start difference. First operand has 188 places, 144 transitions, 1124 flow. Second operand 11 states and 134 transitions. [2024-06-04 17:19:32,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 160 transitions, 1546 flow [2024-06-04 17:19:32,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 160 transitions, 1490 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-06-04 17:19:32,303 INFO L231 Difference]: Finished difference. Result has 190 places, 146 transitions, 1217 flow [2024-06-04 17:19:32,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1068, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1217, PETRI_PLACES=190, PETRI_TRANSITIONS=146} [2024-06-04 17:19:32,303 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 159 predicate places. [2024-06-04 17:19:32,303 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 146 transitions, 1217 flow [2024-06-04 17:19:32,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:19:32,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:19:32,304 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:19:32,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-04 17:19:32,304 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:19:32,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:19:32,304 INFO L85 PathProgramCache]: Analyzing trace with hash 281075062, now seen corresponding path program 11 times [2024-06-04 17:19:32,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:19:32,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229338768] [2024-06-04 17:19:32,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:19:32,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:19:32,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:19:37,900 INFO 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:19:37,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:19:37,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229338768] [2024-06-04 17:19:37,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229338768] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:19:37,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:19:37,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:19:37,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794873333] [2024-06-04 17:19:37,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:19:37,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:19:37,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:19:37,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:19:37,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:19:38,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:19:38,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 146 transitions, 1217 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:19:38,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:19:38,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:19:38,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:19:38,274 INFO L124 PetriNetUnfolderBase]: 360/715 cut-off events. [2024-06-04 17:19:38,274 INFO L125 PetriNetUnfolderBase]: For 34547/34549 co-relation queries the response was YES. [2024-06-04 17:19:38,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4043 conditions, 715 events. 360/715 cut-off events. For 34547/34549 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3700 event pairs, 50 based on Foata normal form. 4/718 useless extension candidates. Maximal degree in co-relation 3954. Up to 566 conditions per place. [2024-06-04 17:19:38,280 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 123 selfloop transitions, 38 changer transitions 0/164 dead transitions. [2024-06-04 17:19:38,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 164 transitions, 1674 flow [2024-06-04 17:19:38,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:19:38,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:19:38,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-04 17:19:38,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-04 17:19:38,281 INFO L175 Difference]: Start difference. First operand has 190 places, 146 transitions, 1217 flow. Second operand 10 states and 124 transitions. [2024-06-04 17:19:38,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 164 transitions, 1674 flow [2024-06-04 17:19:38,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 164 transitions, 1541 flow, removed 25 selfloop flow, removed 9 redundant places. [2024-06-04 17:19:38,371 INFO L231 Difference]: Finished difference. Result has 192 places, 150 transitions, 1232 flow [2024-06-04 17:19:38,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1084, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1232, PETRI_PLACES=192, PETRI_TRANSITIONS=150} [2024-06-04 17:19:38,371 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 161 predicate places. [2024-06-04 17:19:38,372 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 150 transitions, 1232 flow [2024-06-04 17:19:38,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:19:38,372 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:19:38,372 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:19:38,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-04 17:19:38,372 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:19:38,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:19:38,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1043314316, now seen corresponding path program 12 times [2024-06-04 17:19:38,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:19:38,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744123639] [2024-06-04 17:19:38,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:19:38,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:19:38,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:19:43,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:19:43,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:19:43,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744123639] [2024-06-04 17:19:43,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744123639] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:19:43,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:19:43,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:19:43,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27329946] [2024-06-04 17:19:43,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:19:43,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:19:43,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:19:43,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:19:43,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:19:43,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:19:43,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 150 transitions, 1232 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:19:43,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:19:43,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:19:43,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:19:44,407 INFO L124 PetriNetUnfolderBase]: 364/725 cut-off events. [2024-06-04 17:19:44,407 INFO L125 PetriNetUnfolderBase]: For 35622/35624 co-relation queries the response was YES. [2024-06-04 17:19:44,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4104 conditions, 725 events. 364/725 cut-off events. For 35622/35624 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3774 event pairs, 52 based on Foata normal form. 4/728 useless extension candidates. Maximal degree in co-relation 4013. Up to 574 conditions per place. [2024-06-04 17:19:44,413 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 123 selfloop transitions, 41 changer transitions 0/167 dead transitions. [2024-06-04 17:19:44,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 167 transitions, 1685 flow [2024-06-04 17:19:44,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:19:44,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:19:44,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-04 17:19:44,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.384375 [2024-06-04 17:19:44,414 INFO L175 Difference]: Start difference. First operand has 192 places, 150 transitions, 1232 flow. Second operand 10 states and 123 transitions. [2024-06-04 17:19:44,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 167 transitions, 1685 flow [2024-06-04 17:19:44,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 167 transitions, 1567 flow, removed 21 selfloop flow, removed 7 redundant places. [2024-06-04 17:19:44,504 INFO L231 Difference]: Finished difference. Result has 196 places, 154 transitions, 1280 flow [2024-06-04 17:19:44,504 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1118, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1280, PETRI_PLACES=196, PETRI_TRANSITIONS=154} [2024-06-04 17:19:44,505 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 165 predicate places. [2024-06-04 17:19:44,505 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 154 transitions, 1280 flow [2024-06-04 17:19:44,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:19:44,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:19:44,505 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:19:44,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-04 17:19:44,505 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:19:44,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:19:44,506 INFO L85 PathProgramCache]: Analyzing trace with hash 274641322, now seen corresponding path program 13 times [2024-06-04 17:19:44,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:19:44,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381628073] [2024-06-04 17:19:44,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:19:44,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:19:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:19:50,548 INFO 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:19:50,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:19:50,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381628073] [2024-06-04 17:19:50,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381628073] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:19:50,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:19:50,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:19:50,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187673269] [2024-06-04 17:19:50,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:19:50,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:19:50,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:19:50,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:19:50,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:19:50,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:19:50,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 154 transitions, 1280 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:19:50,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:19:50,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:19:50,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:19:50,925 INFO L124 PetriNetUnfolderBase]: 375/744 cut-off events. [2024-06-04 17:19:50,925 INFO L125 PetriNetUnfolderBase]: For 41061/41063 co-relation queries the response was YES. [2024-06-04 17:19:50,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4395 conditions, 744 events. 375/744 cut-off events. For 41061/41063 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 3865 event pairs, 53 based on Foata normal form. 4/747 useless extension candidates. Maximal degree in co-relation 4302. Up to 566 conditions per place. [2024-06-04 17:19:50,931 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 124 selfloop transitions, 44 changer transitions 0/171 dead transitions. [2024-06-04 17:19:50,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 171 transitions, 1860 flow [2024-06-04 17:19:50,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:19:50,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:19:50,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-04 17:19:50,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-04 17:19:50,932 INFO L175 Difference]: Start difference. First operand has 196 places, 154 transitions, 1280 flow. Second operand 10 states and 125 transitions. [2024-06-04 17:19:50,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 171 transitions, 1860 flow [2024-06-04 17:19:51,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 171 transitions, 1757 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-06-04 17:19:51,025 INFO L231 Difference]: Finished difference. Result has 201 places, 156 transitions, 1327 flow [2024-06-04 17:19:51,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1177, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1327, PETRI_PLACES=201, PETRI_TRANSITIONS=156} [2024-06-04 17:19:51,025 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 170 predicate places. [2024-06-04 17:19:51,025 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 156 transitions, 1327 flow [2024-06-04 17:19:51,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:19:51,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:19:51,026 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:19:51,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-04 17:19:51,026 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:19:51,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:19:51,026 INFO L85 PathProgramCache]: Analyzing trace with hash -357343720, now seen corresponding path program 14 times [2024-06-04 17:19:51,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:19:51,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196515035] [2024-06-04 17:19:51,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:19:51,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:19:51,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:19:56,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:19:56,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:19:56,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196515035] [2024-06-04 17:19:56,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196515035] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:19:56,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:19:56,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:19:56,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092524227] [2024-06-04 17:19:56,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:19:56,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:19:56,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:19:56,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:19:56,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:19:56,631 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:19:56,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 156 transitions, 1327 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:19:56,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:19:56,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:19:56,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:19:56,876 INFO L124 PetriNetUnfolderBase]: 372/737 cut-off events. [2024-06-04 17:19:56,876 INFO L125 PetriNetUnfolderBase]: For 37933/37935 co-relation queries the response was YES. [2024-06-04 17:19:56,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4219 conditions, 737 events. 372/737 cut-off events. For 37933/37935 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3833 event pairs, 54 based on Foata normal form. 4/740 useless extension candidates. Maximal degree in co-relation 4125. Up to 590 conditions per place. [2024-06-04 17:19:56,882 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 120 selfloop transitions, 46 changer transitions 0/169 dead transitions. [2024-06-04 17:19:56,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 169 transitions, 1717 flow [2024-06-04 17:19:56,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:19:56,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:19:56,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-04 17:19:56,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38125 [2024-06-04 17:19:56,883 INFO L175 Difference]: Start difference. First operand has 201 places, 156 transitions, 1327 flow. Second operand 10 states and 122 transitions. [2024-06-04 17:19:56,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 169 transitions, 1717 flow [2024-06-04 17:19:56,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 169 transitions, 1616 flow, removed 24 selfloop flow, removed 6 redundant places. [2024-06-04 17:19:56,975 INFO L231 Difference]: Finished difference. Result has 205 places, 156 transitions, 1322 flow [2024-06-04 17:19:56,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1226, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1322, PETRI_PLACES=205, PETRI_TRANSITIONS=156} [2024-06-04 17:19:56,975 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 174 predicate places. [2024-06-04 17:19:56,975 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 156 transitions, 1322 flow [2024-06-04 17:19:56,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:19:56,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:19:56,976 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:19:56,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-04 17:19:56,976 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:19:56,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:19:56,977 INFO L85 PathProgramCache]: Analyzing trace with hash 2038484714, now seen corresponding path program 15 times [2024-06-04 17:19:56,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:19:56,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084580126] [2024-06-04 17:19:56,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:19:56,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:19:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:20:02,285 INFO 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:20:02,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:20:02,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084580126] [2024-06-04 17:20:02,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084580126] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:20:02,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:20:02,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:20:02,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657773781] [2024-06-04 17:20:02,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:20:02,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:20:02,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:20:02,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:20:02,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:20:02,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:20:02,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 156 transitions, 1322 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:20:02,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:20:02,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:20:02,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:20:02,810 INFO L124 PetriNetUnfolderBase]: 386/765 cut-off events. [2024-06-04 17:20:02,810 INFO L125 PetriNetUnfolderBase]: For 43331/43333 co-relation queries the response was YES. [2024-06-04 17:20:02,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4558 conditions, 765 events. 386/765 cut-off events. For 43331/43333 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4039 event pairs, 53 based on Foata normal form. 4/768 useless extension candidates. Maximal degree in co-relation 4462. Up to 598 conditions per place. [2024-06-04 17:20:02,816 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 128 selfloop transitions, 45 changer transitions 0/176 dead transitions. [2024-06-04 17:20:02,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 176 transitions, 1949 flow [2024-06-04 17:20:02,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:20:02,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:20:02,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-04 17:20:02,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.396875 [2024-06-04 17:20:02,817 INFO L175 Difference]: Start difference. First operand has 205 places, 156 transitions, 1322 flow. Second operand 10 states and 127 transitions. [2024-06-04 17:20:02,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 176 transitions, 1949 flow [2024-06-04 17:20:02,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 176 transitions, 1830 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-04 17:20:02,919 INFO L231 Difference]: Finished difference. Result has 207 places, 162 transitions, 1428 flow [2024-06-04 17:20:02,920 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1209, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1428, PETRI_PLACES=207, PETRI_TRANSITIONS=162} [2024-06-04 17:20:02,920 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 176 predicate places. [2024-06-04 17:20:02,920 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 162 transitions, 1428 flow [2024-06-04 17:20:02,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:20:02,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:20:02,920 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:20:02,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-04 17:20:02,920 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:20:02,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:20:02,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1132032400, now seen corresponding path program 16 times [2024-06-04 17:20:02,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:20:02,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883004805] [2024-06-04 17:20:02,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:20:02,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:20:02,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:20:08,986 INFO 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:20:08,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:20:08,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883004805] [2024-06-04 17:20:08,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883004805] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:20:08,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:20:08,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:20:08,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453109341] [2024-06-04 17:20:08,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:20:08,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:20:08,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:20:08,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:20:08,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:20:09,126 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:20:09,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 162 transitions, 1428 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:20:09,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:20:09,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:20:09,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:20:09,475 INFO L124 PetriNetUnfolderBase]: 393/778 cut-off events. [2024-06-04 17:20:09,475 INFO L125 PetriNetUnfolderBase]: For 45194/45196 co-relation queries the response was YES. [2024-06-04 17:20:09,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4701 conditions, 778 events. 393/778 cut-off events. For 45194/45196 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4112 event pairs, 55 based on Foata normal form. 4/781 useless extension candidates. Maximal degree in co-relation 4603. Up to 627 conditions per place. [2024-06-04 17:20:09,481 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 130 selfloop transitions, 44 changer transitions 0/177 dead transitions. [2024-06-04 17:20:09,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 177 transitions, 1859 flow [2024-06-04 17:20:09,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:20:09,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:20:09,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-04 17:20:09,482 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-04 17:20:09,482 INFO L175 Difference]: Start difference. First operand has 207 places, 162 transitions, 1428 flow. Second operand 10 states and 125 transitions. [2024-06-04 17:20:09,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 177 transitions, 1859 flow [2024-06-04 17:20:09,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 177 transitions, 1781 flow, removed 28 selfloop flow, removed 3 redundant places. [2024-06-04 17:20:09,597 INFO L231 Difference]: Finished difference. Result has 214 places, 165 transitions, 1495 flow [2024-06-04 17:20:09,597 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1350, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1495, PETRI_PLACES=214, PETRI_TRANSITIONS=165} [2024-06-04 17:20:09,598 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 183 predicate places. [2024-06-04 17:20:09,598 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 165 transitions, 1495 flow [2024-06-04 17:20:09,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:20:09,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:20:09,598 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:20:09,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-04 17:20:09,598 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:20:09,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:20:09,599 INFO L85 PathProgramCache]: Analyzing trace with hash -2085602522, now seen corresponding path program 17 times [2024-06-04 17:20:09,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:20:09,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036362540] [2024-06-04 17:20:09,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:20:09,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:20:09,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:20:15,223 INFO 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:20:15,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:20:15,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036362540] [2024-06-04 17:20:15,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036362540] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:20:15,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:20:15,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:20:15,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311027598] [2024-06-04 17:20:15,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:20:15,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:20:15,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:20:15,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:20:15,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:20:15,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:20:15,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 165 transitions, 1495 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:20:15,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:20:15,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:20:15,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:20:15,828 INFO L124 PetriNetUnfolderBase]: 397/786 cut-off events. [2024-06-04 17:20:15,828 INFO L125 PetriNetUnfolderBase]: For 46220/46222 co-relation queries the response was YES. [2024-06-04 17:20:15,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4782 conditions, 786 events. 397/786 cut-off events. For 46220/46222 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4181 event pairs, 57 based on Foata normal form. 4/789 useless extension candidates. Maximal degree in co-relation 4682. Up to 635 conditions per place. [2024-06-04 17:20:15,835 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 132 selfloop transitions, 43 changer transitions 0/178 dead transitions. [2024-06-04 17:20:15,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 178 transitions, 1911 flow [2024-06-04 17:20:15,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:20:15,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:20:15,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-04 17:20:15,836 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39375 [2024-06-04 17:20:15,836 INFO L175 Difference]: Start difference. First operand has 214 places, 165 transitions, 1495 flow. Second operand 10 states and 126 transitions. [2024-06-04 17:20:15,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 178 transitions, 1911 flow [2024-06-04 17:20:15,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 178 transitions, 1784 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-06-04 17:20:15,948 INFO L231 Difference]: Finished difference. Result has 216 places, 166 transitions, 1494 flow [2024-06-04 17:20:15,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1368, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1494, PETRI_PLACES=216, PETRI_TRANSITIONS=166} [2024-06-04 17:20:15,949 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 185 predicate places. [2024-06-04 17:20:15,949 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 166 transitions, 1494 flow [2024-06-04 17:20:15,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:20:15,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:20:15,949 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:20:15,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-04 17:20:15,949 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:20:15,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:20:15,950 INFO L85 PathProgramCache]: Analyzing trace with hash 304968268, now seen corresponding path program 18 times [2024-06-04 17:20:15,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:20:15,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944712054] [2024-06-04 17:20:15,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:20:15,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:20:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:20:21,860 INFO 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:20:21,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:20:21,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944712054] [2024-06-04 17:20:21,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944712054] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:20:21,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:20:21,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:20:21,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670325559] [2024-06-04 17:20:21,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:20:21,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:20:21,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:20:21,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:20:21,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:20:21,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:20:21,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 166 transitions, 1494 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:20:21,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:20:21,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:20:21,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:20:22,275 INFO L124 PetriNetUnfolderBase]: 401/792 cut-off events. [2024-06-04 17:20:22,276 INFO L125 PetriNetUnfolderBase]: For 47611/47613 co-relation queries the response was YES. [2024-06-04 17:20:22,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4817 conditions, 792 events. 401/792 cut-off events. For 47611/47613 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4173 event pairs, 57 based on Foata normal form. 4/795 useless extension candidates. Maximal degree in co-relation 4717. Up to 623 conditions per place. [2024-06-04 17:20:22,283 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 132 selfloop transitions, 45 changer transitions 0/180 dead transitions. [2024-06-04 17:20:22,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 180 transitions, 1918 flow [2024-06-04 17:20:22,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:20:22,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:20:22,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-04 17:20:22,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.396875 [2024-06-04 17:20:22,284 INFO L175 Difference]: Start difference. First operand has 216 places, 166 transitions, 1494 flow. Second operand 10 states and 127 transitions. [2024-06-04 17:20:22,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 180 transitions, 1918 flow [2024-06-04 17:20:22,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 180 transitions, 1793 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-04 17:20:22,394 INFO L231 Difference]: Finished difference. Result has 219 places, 167 transitions, 1501 flow [2024-06-04 17:20:22,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1369, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1501, PETRI_PLACES=219, PETRI_TRANSITIONS=167} [2024-06-04 17:20:22,394 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 188 predicate places. [2024-06-04 17:20:22,394 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 167 transitions, 1501 flow [2024-06-04 17:20:22,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:20:22,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:20:22,395 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:20:22,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-04 17:20:22,395 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:20:22,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:20:22,395 INFO L85 PathProgramCache]: Analyzing trace with hash 2043130994, now seen corresponding path program 19 times [2024-06-04 17:20:22,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:20:22,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644192287] [2024-06-04 17:20:22,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:20:22,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:20:22,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:20:27,563 INFO 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:20:27,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:20:27,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644192287] [2024-06-04 17:20:27,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644192287] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:20:27,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:20:27,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:20:27,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218903904] [2024-06-04 17:20:27,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:20:27,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:20:27,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:20:27,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:20:27,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:20:27,699 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:20:27,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 167 transitions, 1501 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:20:27,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:20:27,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:20:27,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:20:27,901 INFO L124 PetriNetUnfolderBase]: 398/789 cut-off events. [2024-06-04 17:20:27,901 INFO L125 PetriNetUnfolderBase]: For 43760/43762 co-relation queries the response was YES. [2024-06-04 17:20:27,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4619 conditions, 789 events. 398/789 cut-off events. For 43760/43762 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4197 event pairs, 58 based on Foata normal form. 4/792 useless extension candidates. Maximal degree in co-relation 4518. Up to 638 conditions per place. [2024-06-04 17:20:27,907 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 130 selfloop transitions, 46 changer transitions 0/179 dead transitions. [2024-06-04 17:20:27,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 179 transitions, 1885 flow [2024-06-04 17:20:27,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:20:27,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:20:27,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2024-06-04 17:20:27,908 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41875 [2024-06-04 17:20:27,908 INFO L175 Difference]: Start difference. First operand has 219 places, 167 transitions, 1501 flow. Second operand 10 states and 134 transitions. [2024-06-04 17:20:27,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 179 transitions, 1885 flow [2024-06-04 17:20:28,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 179 transitions, 1743 flow, removed 27 selfloop flow, removed 8 redundant places. [2024-06-04 17:20:28,048 INFO L231 Difference]: Finished difference. Result has 221 places, 167 transitions, 1455 flow [2024-06-04 17:20:28,048 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1359, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1455, PETRI_PLACES=221, PETRI_TRANSITIONS=167} [2024-06-04 17:20:28,049 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 190 predicate places. [2024-06-04 17:20:28,049 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 167 transitions, 1455 flow [2024-06-04 17:20:28,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:20:28,049 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:20:28,049 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:20:28,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-04 17:20:28,049 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:20:28,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:20:28,050 INFO L85 PathProgramCache]: Analyzing trace with hash 134150518, now seen corresponding path program 20 times [2024-06-04 17:20:28,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:20:28,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752672169] [2024-06-04 17:20:28,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:20:28,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:20:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:20:32,940 INFO 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:20:32,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:20:32,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752672169] [2024-06-04 17:20:32,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752672169] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:20:32,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:20:32,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:20:32,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743043670] [2024-06-04 17:20:32,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:20:32,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:20:32,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:20:32,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:20:32,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:20:33,071 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:20:33,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 167 transitions, 1455 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:20:33,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:20:33,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:20:33,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:20:33,350 INFO L124 PetriNetUnfolderBase]: 395/784 cut-off events. [2024-06-04 17:20:33,350 INFO L125 PetriNetUnfolderBase]: For 39192/39194 co-relation queries the response was YES. [2024-06-04 17:20:33,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4345 conditions, 784 events. 395/784 cut-off events. For 39192/39194 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4191 event pairs, 53 based on Foata normal form. 4/787 useless extension candidates. Maximal degree in co-relation 4243. Up to 539 conditions per place. [2024-06-04 17:20:33,357 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 123 selfloop transitions, 55 changer transitions 0/181 dead transitions. [2024-06-04 17:20:33,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 181 transitions, 1847 flow [2024-06-04 17:20:33,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:20:33,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:20:33,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-04 17:20:33,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39375 [2024-06-04 17:20:33,359 INFO L175 Difference]: Start difference. First operand has 221 places, 167 transitions, 1455 flow. Second operand 10 states and 126 transitions. [2024-06-04 17:20:33,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 181 transitions, 1847 flow [2024-06-04 17:20:33,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 181 transitions, 1752 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-04 17:20:33,490 INFO L231 Difference]: Finished difference. Result has 222 places, 167 transitions, 1474 flow [2024-06-04 17:20:33,490 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1360, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1474, PETRI_PLACES=222, PETRI_TRANSITIONS=167} [2024-06-04 17:20:33,490 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 191 predicate places. [2024-06-04 17:20:33,491 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 167 transitions, 1474 flow [2024-06-04 17:20:33,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:20:33,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:20:33,491 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:20:33,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-04 17:20:33,491 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:20:33,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:20:33,491 INFO L85 PathProgramCache]: Analyzing trace with hash 311647962, now seen corresponding path program 3 times [2024-06-04 17:20:33,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:20:33,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851563180] [2024-06-04 17:20:33,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:20:33,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:20:33,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:20:39,135 INFO 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:20:39,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:20:39,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851563180] [2024-06-04 17:20:39,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851563180] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:20:39,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:20:39,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:20:39,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217803161] [2024-06-04 17:20:39,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:20:39,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:20:39,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:20:39,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:20:39,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:20:39,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:20:39,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 167 transitions, 1474 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:20:39,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:20:39,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:20:39,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:20:39,655 INFO L124 PetriNetUnfolderBase]: 398/793 cut-off events. [2024-06-04 17:20:39,655 INFO L125 PetriNetUnfolderBase]: For 38183/38185 co-relation queries the response was YES. [2024-06-04 17:20:39,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4469 conditions, 793 events. 398/793 cut-off events. For 38183/38185 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4271 event pairs, 57 based on Foata normal form. 3/795 useless extension candidates. Maximal degree in co-relation 4366. Up to 590 conditions per place. [2024-06-04 17:20:39,661 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 128 selfloop transitions, 52 changer transitions 1/184 dead transitions. [2024-06-04 17:20:39,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 184 transitions, 2004 flow [2024-06-04 17:20:39,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:20:39,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:20:39,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 139 transitions. [2024-06-04 17:20:39,662 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39488636363636365 [2024-06-04 17:20:39,662 INFO L175 Difference]: Start difference. First operand has 222 places, 167 transitions, 1474 flow. Second operand 11 states and 139 transitions. [2024-06-04 17:20:39,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 184 transitions, 2004 flow [2024-06-04 17:20:39,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 184 transitions, 1724 flow, removed 18 selfloop flow, removed 13 redundant places. [2024-06-04 17:20:39,791 INFO L231 Difference]: Finished difference. Result has 220 places, 169 transitions, 1365 flow [2024-06-04 17:20:39,791 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1194, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1365, PETRI_PLACES=220, PETRI_TRANSITIONS=169} [2024-06-04 17:20:39,792 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 189 predicate places. [2024-06-04 17:20:39,792 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 169 transitions, 1365 flow [2024-06-04 17:20:39,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:20:39,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:20:39,792 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:20:39,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-04 17:20:39,792 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:20:39,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:20:39,792 INFO L85 PathProgramCache]: Analyzing trace with hash 311648272, now seen corresponding path program 2 times [2024-06-04 17:20:39,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:20:39,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096466600] [2024-06-04 17:20:39,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:20:39,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:20:39,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:20:46,574 INFO 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:20:46,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:20:46,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096466600] [2024-06-04 17:20:46,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096466600] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:20:46,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:20:46,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:20:46,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082502155] [2024-06-04 17:20:46,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:20:46,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:20:46,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:20:46,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:20:46,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:20:46,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:20:46,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 169 transitions, 1365 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:20:46,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:20:46,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:20:46,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:20:47,200 INFO L124 PetriNetUnfolderBase]: 414/825 cut-off events. [2024-06-04 17:20:47,200 INFO L125 PetriNetUnfolderBase]: For 61163/61165 co-relation queries the response was YES. [2024-06-04 17:20:47,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4390 conditions, 825 events. 414/825 cut-off events. For 61163/61165 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4435 event pairs, 61 based on Foata normal form. 12/836 useless extension candidates. Maximal degree in co-relation 4290. Up to 591 conditions per place. [2024-06-04 17:20:47,206 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 131 selfloop transitions, 50 changer transitions 5/189 dead transitions. [2024-06-04 17:20:47,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 189 transitions, 1939 flow [2024-06-04 17:20:47,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:20:47,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:20:47,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 142 transitions. [2024-06-04 17:20:47,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4034090909090909 [2024-06-04 17:20:47,207 INFO L175 Difference]: Start difference. First operand has 220 places, 169 transitions, 1365 flow. Second operand 11 states and 142 transitions. [2024-06-04 17:20:47,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 189 transitions, 1939 flow [2024-06-04 17:20:47,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 189 transitions, 1750 flow, removed 29 selfloop flow, removed 10 redundant places. [2024-06-04 17:20:47,328 INFO L231 Difference]: Finished difference. Result has 221 places, 169 transitions, 1306 flow [2024-06-04 17:20:47,328 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1178, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1306, PETRI_PLACES=221, PETRI_TRANSITIONS=169} [2024-06-04 17:20:47,328 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 190 predicate places. [2024-06-04 17:20:47,329 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 169 transitions, 1306 flow [2024-06-04 17:20:47,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:20:47,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:20:47,329 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:20:47,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-04 17:20:47,329 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:20:47,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:20:47,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1049816380, now seen corresponding path program 4 times [2024-06-04 17:20:47,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:20:47,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278111071] [2024-06-04 17:20:47,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:20:47,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:20:47,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:20:53,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:20:53,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:20:53,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278111071] [2024-06-04 17:20:53,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278111071] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:20:53,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:20:53,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:20:53,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644257109] [2024-06-04 17:20:53,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:20:53,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:20:53,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:20:53,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:20:53,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:20:53,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:20:53,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 169 transitions, 1306 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:20:53,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:20:53,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:20:53,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:20:53,691 INFO L124 PetriNetUnfolderBase]: 411/822 cut-off events. [2024-06-04 17:20:53,691 INFO L125 PetriNetUnfolderBase]: For 40507/40509 co-relation queries the response was YES. [2024-06-04 17:20:53,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4294 conditions, 822 events. 411/822 cut-off events. For 40507/40509 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4447 event pairs, 61 based on Foata normal form. 3/824 useless extension candidates. Maximal degree in co-relation 4194. Up to 621 conditions per place. [2024-06-04 17:20:53,696 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 131 selfloop transitions, 52 changer transitions 0/186 dead transitions. [2024-06-04 17:20:53,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 186 transitions, 1848 flow [2024-06-04 17:20:53,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:20:53,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:20:53,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2024-06-04 17:20:53,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39204545454545453 [2024-06-04 17:20:53,697 INFO L175 Difference]: Start difference. First operand has 221 places, 169 transitions, 1306 flow. Second operand 11 states and 138 transitions. [2024-06-04 17:20:53,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 186 transitions, 1848 flow [2024-06-04 17:20:53,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 186 transitions, 1734 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-04 17:20:53,806 INFO L231 Difference]: Finished difference. Result has 223 places, 171 transitions, 1365 flow [2024-06-04 17:20:53,806 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1192, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1365, PETRI_PLACES=223, PETRI_TRANSITIONS=171} [2024-06-04 17:20:53,806 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 192 predicate places. [2024-06-04 17:20:53,807 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 171 transitions, 1365 flow [2024-06-04 17:20:53,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:20:53,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:20:53,807 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:20:53,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-04 17:20:53,807 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:20:53,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:20:53,808 INFO L85 PathProgramCache]: Analyzing trace with hash 281321326, now seen corresponding path program 3 times [2024-06-04 17:20:53,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:20:53,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870077435] [2024-06-04 17:20:53,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:20:53,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:20:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:21:00,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:21:00,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:21:00,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870077435] [2024-06-04 17:21:00,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870077435] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:21:00,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:21:00,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:21:00,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737696226] [2024-06-04 17:21:00,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:21:00,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:21:00,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:21:00,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:21:00,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:21:00,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:21:00,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 171 transitions, 1365 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:21:00,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:21:00,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:21:00,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:21:00,966 INFO L124 PetriNetUnfolderBase]: 427/858 cut-off events. [2024-06-04 17:21:00,966 INFO L125 PetriNetUnfolderBase]: For 65246/65248 co-relation queries the response was YES. [2024-06-04 17:21:00,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4556 conditions, 858 events. 427/858 cut-off events. For 65246/65248 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4701 event pairs, 65 based on Foata normal form. 12/869 useless extension candidates. Maximal degree in co-relation 4455. Up to 622 conditions per place. [2024-06-04 17:21:00,972 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 134 selfloop transitions, 50 changer transitions 4/191 dead transitions. [2024-06-04 17:21:00,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 191 transitions, 1953 flow [2024-06-04 17:21:00,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:21:00,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:21:00,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 141 transitions. [2024-06-04 17:21:00,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4005681818181818 [2024-06-04 17:21:00,973 INFO L175 Difference]: Start difference. First operand has 223 places, 171 transitions, 1365 flow. Second operand 11 states and 141 transitions. [2024-06-04 17:21:00,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 191 transitions, 1953 flow [2024-06-04 17:21:01,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 191 transitions, 1796 flow, removed 28 selfloop flow, removed 9 redundant places. [2024-06-04 17:21:01,094 INFO L231 Difference]: Finished difference. Result has 225 places, 171 transitions, 1338 flow [2024-06-04 17:21:01,094 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1208, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1338, PETRI_PLACES=225, PETRI_TRANSITIONS=171} [2024-06-04 17:21:01,094 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 194 predicate places. [2024-06-04 17:21:01,094 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 171 transitions, 1338 flow [2024-06-04 17:21:01,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:21:01,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:21:01,094 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:21:01,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-04 17:21:01,095 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:21:01,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:21:01,095 INFO L85 PathProgramCache]: Analyzing trace with hash -357097456, now seen corresponding path program 4 times [2024-06-04 17:21:01,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:21:01,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314365328] [2024-06-04 17:21:01,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:21:01,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:21:01,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:21:07,666 INFO 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:21:07,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:21:07,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314365328] [2024-06-04 17:21:07,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314365328] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:21:07,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:21:07,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:21:07,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331423837] [2024-06-04 17:21:07,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:21:07,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:21:07,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:21:07,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:21:07,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:21:07,813 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:21:07,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 171 transitions, 1338 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:21:07,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:21:07,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:21:07,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:21:08,211 INFO L124 PetriNetUnfolderBase]: 437/886 cut-off events. [2024-06-04 17:21:08,211 INFO L125 PetriNetUnfolderBase]: For 67741/67743 co-relation queries the response was YES. [2024-06-04 17:21:08,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4716 conditions, 886 events. 437/886 cut-off events. For 67741/67743 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4916 event pairs, 69 based on Foata normal form. 12/897 useless extension candidates. Maximal degree in co-relation 4614. Up to 648 conditions per place. [2024-06-04 17:21:08,217 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 128 selfloop transitions, 55 changer transitions 4/190 dead transitions. [2024-06-04 17:21:08,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 190 transitions, 1902 flow [2024-06-04 17:21:08,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:21:08,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:21:08,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 140 transitions. [2024-06-04 17:21:08,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3977272727272727 [2024-06-04 17:21:08,218 INFO L175 Difference]: Start difference. First operand has 225 places, 171 transitions, 1338 flow. Second operand 11 states and 140 transitions. [2024-06-04 17:21:08,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 190 transitions, 1902 flow [2024-06-04 17:21:08,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 190 transitions, 1786 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-04 17:21:08,336 INFO L231 Difference]: Finished difference. Result has 227 places, 171 transitions, 1364 flow [2024-06-04 17:21:08,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1222, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1364, PETRI_PLACES=227, PETRI_TRANSITIONS=171} [2024-06-04 17:21:08,336 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 196 predicate places. [2024-06-04 17:21:08,336 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 171 transitions, 1364 flow [2024-06-04 17:21:08,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:21:08,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:21:08,336 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:21:08,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-04 17:21:08,337 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:21:08,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:21:08,337 INFO L85 PathProgramCache]: Analyzing trace with hash 411397598, now seen corresponding path program 5 times [2024-06-04 17:21:08,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:21:08,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334601011] [2024-06-04 17:21:08,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:21:08,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:21:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:21:14,101 INFO 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:21:14,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:21:14,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334601011] [2024-06-04 17:21:14,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334601011] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:21:14,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:21:14,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:21:14,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114808850] [2024-06-04 17:21:14,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:21:14,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:21:14,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:21:14,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:21:14,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:21:14,231 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:21:14,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 171 transitions, 1364 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:21:14,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:21:14,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:21:14,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:21:14,577 INFO L124 PetriNetUnfolderBase]: 434/883 cut-off events. [2024-06-04 17:21:14,577 INFO L125 PetriNetUnfolderBase]: For 45765/45767 co-relation queries the response was YES. [2024-06-04 17:21:14,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4732 conditions, 883 events. 434/883 cut-off events. For 45765/45767 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4926 event pairs, 69 based on Foata normal form. 3/885 useless extension candidates. Maximal degree in co-relation 4629. Up to 678 conditions per place. [2024-06-04 17:21:14,585 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 128 selfloop transitions, 56 changer transitions 0/187 dead transitions. [2024-06-04 17:21:14,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 187 transitions, 1892 flow [2024-06-04 17:21:14,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:21:14,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:21:14,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2024-06-04 17:21:14,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2024-06-04 17:21:14,586 INFO L175 Difference]: Start difference. First operand has 227 places, 171 transitions, 1364 flow. Second operand 11 states and 136 transitions. [2024-06-04 17:21:14,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 187 transitions, 1892 flow [2024-06-04 17:21:14,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 187 transitions, 1764 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-04 17:21:14,732 INFO L231 Difference]: Finished difference. Result has 229 places, 173 transitions, 1421 flow [2024-06-04 17:21:14,732 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1236, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1421, PETRI_PLACES=229, PETRI_TRANSITIONS=173} [2024-06-04 17:21:14,732 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 198 predicate places. [2024-06-04 17:21:14,732 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 173 transitions, 1421 flow [2024-06-04 17:21:14,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:21:14,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:21:14,732 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:21:14,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-04 17:21:14,732 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:21:14,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:21:14,733 INFO L85 PathProgramCache]: Analyzing trace with hash 696497778, now seen corresponding path program 5 times [2024-06-04 17:21:14,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:21:14,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932735527] [2024-06-04 17:21:14,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:21:14,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:21:14,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:21:21,801 INFO 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:21:21,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:21:21,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932735527] [2024-06-04 17:21:21,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932735527] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:21:21,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:21:21,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:21:21,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375674313] [2024-06-04 17:21:21,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:21:21,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:21:21,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:21:21,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:21:21,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:21:21,984 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:21:21,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 173 transitions, 1421 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:21:21,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:21:21,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:21:21,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:21:22,398 INFO L124 PetriNetUnfolderBase]: 457/930 cut-off events. [2024-06-04 17:21:22,398 INFO L125 PetriNetUnfolderBase]: For 79668/79670 co-relation queries the response was YES. [2024-06-04 17:21:22,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5112 conditions, 930 events. 457/930 cut-off events. For 79668/79670 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 5253 event pairs, 74 based on Foata normal form. 13/942 useless extension candidates. Maximal degree in co-relation 5008. Up to 806 conditions per place. [2024-06-04 17:21:22,404 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 164 selfloop transitions, 16 changer transitions 9/192 dead transitions. [2024-06-04 17:21:22,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 192 transitions, 2007 flow [2024-06-04 17:21:22,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:21:22,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:21:22,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2024-06-04 17:21:22,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-04 17:21:22,405 INFO L175 Difference]: Start difference. First operand has 229 places, 173 transitions, 1421 flow. Second operand 11 states and 132 transitions. [2024-06-04 17:21:22,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 192 transitions, 2007 flow [2024-06-04 17:21:22,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 192 transitions, 1838 flow, removed 30 selfloop flow, removed 9 redundant places. [2024-06-04 17:21:22,558 INFO L231 Difference]: Finished difference. Result has 232 places, 171 transitions, 1314 flow [2024-06-04 17:21:22,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1252, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1314, PETRI_PLACES=232, PETRI_TRANSITIONS=171} [2024-06-04 17:21:22,558 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 201 predicate places. [2024-06-04 17:21:22,558 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 171 transitions, 1314 flow [2024-06-04 17:21:22,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:21:22,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:21:22,558 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:21:22,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-04 17:21:22,559 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:21:22,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:21:22,559 INFO L85 PathProgramCache]: Analyzing trace with hash 696497468, now seen corresponding path program 6 times [2024-06-04 17:21:22,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:21:22,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909327345] [2024-06-04 17:21:22,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:21:22,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:21:22,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:21:27,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:21:27,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:21:27,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909327345] [2024-06-04 17:21:27,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909327345] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:21:27,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:21:27,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:21:27,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213917507] [2024-06-04 17:21:27,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:21:27,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:21:27,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:21:27,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:21:27,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:21:27,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:21:27,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 171 transitions, 1314 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:21:27,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:21:27,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:21:27,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:21:28,215 INFO L124 PetriNetUnfolderBase]: 436/885 cut-off events. [2024-06-04 17:21:28,215 INFO L125 PetriNetUnfolderBase]: For 49840/49842 co-relation queries the response was YES. [2024-06-04 17:21:28,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4807 conditions, 885 events. 436/885 cut-off events. For 49840/49842 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4941 event pairs, 70 based on Foata normal form. 1/885 useless extension candidates. Maximal degree in co-relation 4701. Up to 814 conditions per place. [2024-06-04 17:21:28,222 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 164 selfloop transitions, 17 changer transitions 0/184 dead transitions. [2024-06-04 17:21:28,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 184 transitions, 1774 flow [2024-06-04 17:21:28,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:21:28,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:21:28,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2024-06-04 17:21:28,223 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3522727272727273 [2024-06-04 17:21:28,223 INFO L175 Difference]: Start difference. First operand has 232 places, 171 transitions, 1314 flow. Second operand 11 states and 124 transitions. [2024-06-04 17:21:28,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 184 transitions, 1774 flow [2024-06-04 17:21:28,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 184 transitions, 1701 flow, removed 18 selfloop flow, removed 12 redundant places. [2024-06-04 17:21:28,383 INFO L231 Difference]: Finished difference. Result has 231 places, 173 transitions, 1356 flow [2024-06-04 17:21:28,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1243, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1356, PETRI_PLACES=231, PETRI_TRANSITIONS=173} [2024-06-04 17:21:28,384 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 200 predicate places. [2024-06-04 17:21:28,384 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 173 transitions, 1356 flow [2024-06-04 17:21:28,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:21:28,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:21:28,384 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:21:28,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-04 17:21:28,384 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:21:28,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:21:28,385 INFO L85 PathProgramCache]: Analyzing trace with hash -131969134, now seen corresponding path program 7 times [2024-06-04 17:21:28,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:21:28,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119436532] [2024-06-04 17:21:28,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:21:28,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:21:28,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:21:35,233 INFO 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:21:35,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:21:35,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119436532] [2024-06-04 17:21:35,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119436532] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:21:35,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:21:35,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:21:35,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763828490] [2024-06-04 17:21:35,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:21:35,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:21:35,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:21:35,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:21:35,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:21:35,398 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:21:35,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 173 transitions, 1356 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:21:35,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:21:35,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:21:35,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:21:35,728 INFO L124 PetriNetUnfolderBase]: 434/882 cut-off events. [2024-06-04 17:21:35,728 INFO L125 PetriNetUnfolderBase]: For 46868/46870 co-relation queries the response was YES. [2024-06-04 17:21:35,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4647 conditions, 882 events. 434/882 cut-off events. For 46868/46870 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4921 event pairs, 70 based on Foata normal form. 1/882 useless extension candidates. Maximal degree in co-relation 4542. Up to 802 conditions per place. [2024-06-04 17:21:35,734 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 161 selfloop transitions, 23 changer transitions 0/187 dead transitions. [2024-06-04 17:21:35,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 187 transitions, 1826 flow [2024-06-04 17:21:35,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:21:35,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:21:35,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 134 transitions. [2024-06-04 17:21:35,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3489583333333333 [2024-06-04 17:21:35,735 INFO L175 Difference]: Start difference. First operand has 231 places, 173 transitions, 1356 flow. Second operand 12 states and 134 transitions. [2024-06-04 17:21:35,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 187 transitions, 1826 flow [2024-06-04 17:21:35,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 187 transitions, 1729 flow, removed 33 selfloop flow, removed 9 redundant places. [2024-06-04 17:21:35,877 INFO L231 Difference]: Finished difference. Result has 234 places, 175 transitions, 1391 flow [2024-06-04 17:21:35,877 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1259, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1391, PETRI_PLACES=234, PETRI_TRANSITIONS=175} [2024-06-04 17:21:35,878 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 203 predicate places. [2024-06-04 17:21:35,878 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 175 transitions, 1391 flow [2024-06-04 17:21:35,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:21:35,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:21:35,878 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:21:35,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-04 17:21:35,878 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:21:35,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:21:35,878 INFO L85 PathProgramCache]: Analyzing trace with hash -61878256, now seen corresponding path program 6 times [2024-06-04 17:21:35,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:21:35,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145027463] [2024-06-04 17:21:35,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:21:35,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:21:35,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:21:42,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:21:42,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:21:42,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145027463] [2024-06-04 17:21:42,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145027463] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:21:42,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:21:42,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:21:42,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223263075] [2024-06-04 17:21:42,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:21:42,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:21:42,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:21:42,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:21:42,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:21:42,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:21:42,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 175 transitions, 1391 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:21:42,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:21:42,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:21:42,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:21:43,294 INFO L124 PetriNetUnfolderBase]: 438/890 cut-off events. [2024-06-04 17:21:43,295 INFO L125 PetriNetUnfolderBase]: For 51409/51411 co-relation queries the response was YES. [2024-06-04 17:21:43,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4724 conditions, 890 events. 438/890 cut-off events. For 51409/51411 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 4966 event pairs, 72 based on Foata normal form. 2/891 useless extension candidates. Maximal degree in co-relation 4618. Up to 810 conditions per place. [2024-06-04 17:21:43,301 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 166 selfloop transitions, 20 changer transitions 0/189 dead transitions. [2024-06-04 17:21:43,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 189 transitions, 1827 flow [2024-06-04 17:21:43,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:21:43,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:21:43,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 135 transitions. [2024-06-04 17:21:43,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3515625 [2024-06-04 17:21:43,302 INFO L175 Difference]: Start difference. First operand has 234 places, 175 transitions, 1391 flow. Second operand 12 states and 135 transitions. [2024-06-04 17:21:43,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 189 transitions, 1827 flow [2024-06-04 17:21:43,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 189 transitions, 1715 flow, removed 36 selfloop flow, removed 10 redundant places. [2024-06-04 17:21:43,453 INFO L231 Difference]: Finished difference. Result has 236 places, 176 transitions, 1359 flow [2024-06-04 17:21:43,453 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1279, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1359, PETRI_PLACES=236, PETRI_TRANSITIONS=176} [2024-06-04 17:21:43,454 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 205 predicate places. [2024-06-04 17:21:43,454 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 176 transitions, 1359 flow [2024-06-04 17:21:43,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:21:43,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:21:43,454 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:21:43,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-04 17:21:43,454 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:21:43,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:21:43,454 INFO L85 PathProgramCache]: Analyzing trace with hash -61522066, now seen corresponding path program 7 times [2024-06-04 17:21:43,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:21:43,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509578435] [2024-06-04 17:21:43,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:21:43,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:21:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:21:50,338 INFO 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:21:50,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:21:50,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509578435] [2024-06-04 17:21:50,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509578435] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:21:50,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:21:50,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:21:50,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381389338] [2024-06-04 17:21:50,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:21:50,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:21:50,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:21:50,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:21:50,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:21:50,516 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:21:50,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 176 transitions, 1359 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:21:50,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:21:50,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:21:50,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:21:50,905 INFO L124 PetriNetUnfolderBase]: 435/885 cut-off events. [2024-06-04 17:21:50,905 INFO L125 PetriNetUnfolderBase]: For 44025/44027 co-relation queries the response was YES. [2024-06-04 17:21:50,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4445 conditions, 885 events. 435/885 cut-off events. For 44025/44027 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 4948 event pairs, 69 based on Foata normal form. 2/886 useless extension candidates. Maximal degree in co-relation 4338. Up to 785 conditions per place. [2024-06-04 17:21:50,912 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 166 selfloop transitions, 22 changer transitions 0/191 dead transitions. [2024-06-04 17:21:50,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 191 transitions, 1803 flow [2024-06-04 17:21:50,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:21:50,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:21:50,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 135 transitions. [2024-06-04 17:21:50,914 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3515625 [2024-06-04 17:21:50,914 INFO L175 Difference]: Start difference. First operand has 236 places, 176 transitions, 1359 flow. Second operand 12 states and 135 transitions. [2024-06-04 17:21:50,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 191 transitions, 1803 flow [2024-06-04 17:21:51,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 191 transitions, 1733 flow, removed 16 selfloop flow, removed 10 redundant places. [2024-06-04 17:21:51,069 INFO L231 Difference]: Finished difference. Result has 238 places, 177 transitions, 1375 flow [2024-06-04 17:21:51,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1289, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1375, PETRI_PLACES=238, PETRI_TRANSITIONS=177} [2024-06-04 17:21:51,069 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 207 predicate places. [2024-06-04 17:21:51,069 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 177 transitions, 1375 flow [2024-06-04 17:21:51,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:21:51,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:21:51,070 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:21:51,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-04 17:21:51,070 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:21:51,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:21:51,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1272483448, now seen corresponding path program 1 times [2024-06-04 17:21:51,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:21:51,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021374928] [2024-06-04 17:21:51,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:21:51,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:21:51,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:21:56,763 INFO 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:21:56,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:21:56,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021374928] [2024-06-04 17:21:56,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021374928] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:21:56,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:21:56,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:21:56,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083617475] [2024-06-04 17:21:56,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:21:56,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:21:56,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:21:56,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:21:56,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:21:56,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:21:56,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 177 transitions, 1375 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:21:56,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:21:56,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:21:56,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:21:57,310 INFO L124 PetriNetUnfolderBase]: 439/894 cut-off events. [2024-06-04 17:21:57,310 INFO L125 PetriNetUnfolderBase]: For 44591/44591 co-relation queries the response was YES. [2024-06-04 17:21:57,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4449 conditions, 894 events. 439/894 cut-off events. For 44591/44591 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 5015 event pairs, 50 based on Foata normal form. 2/895 useless extension candidates. Maximal degree in co-relation 4341. Up to 760 conditions per place. [2024-06-04 17:21:57,316 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 177 selfloop transitions, 19 changer transitions 0/199 dead transitions. [2024-06-04 17:21:57,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 199 transitions, 1831 flow [2024-06-04 17:21:57,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:21:57,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:21:57,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2024-06-04 17:21:57,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3693181818181818 [2024-06-04 17:21:57,317 INFO L175 Difference]: Start difference. First operand has 238 places, 177 transitions, 1375 flow. Second operand 11 states and 130 transitions. [2024-06-04 17:21:57,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 199 transitions, 1831 flow [2024-06-04 17:21:57,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 199 transitions, 1755 flow, removed 17 selfloop flow, removed 10 redundant places. [2024-06-04 17:21:57,447 INFO L231 Difference]: Finished difference. Result has 239 places, 178 transitions, 1353 flow [2024-06-04 17:21:57,447 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1299, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1353, PETRI_PLACES=239, PETRI_TRANSITIONS=178} [2024-06-04 17:21:57,447 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 208 predicate places. [2024-06-04 17:21:57,448 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 178 transitions, 1353 flow [2024-06-04 17:21:57,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:21:57,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:21:57,448 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:21:57,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-04 17:21:57,448 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:21:57,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:21:57,449 INFO L85 PathProgramCache]: Analyzing trace with hash 531957422, now seen corresponding path program 2 times [2024-06-04 17:21:57,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:21:57,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590945833] [2024-06-04 17:21:57,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:21:57,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:21:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:22:02,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:22:02,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:22:02,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590945833] [2024-06-04 17:22:02,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590945833] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:22:02,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:22:02,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:22:02,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978780216] [2024-06-04 17:22:02,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:22:02,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:22:02,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:22:02,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:22:02,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:22:02,891 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:22:02,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 178 transitions, 1353 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:22:02,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:22:02,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:22:02,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:22:03,228 INFO L124 PetriNetUnfolderBase]: 450/915 cut-off events. [2024-06-04 17:22:03,228 INFO L125 PetriNetUnfolderBase]: For 51632/51632 co-relation queries the response was YES. [2024-06-04 17:22:03,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4667 conditions, 915 events. 450/915 cut-off events. For 51632/51632 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5146 event pairs, 68 based on Foata normal form. 2/916 useless extension candidates. Maximal degree in co-relation 4558. Up to 772 conditions per place. [2024-06-04 17:22:03,235 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 170 selfloop transitions, 27 changer transitions 0/200 dead transitions. [2024-06-04 17:22:03,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 200 transitions, 1987 flow [2024-06-04 17:22:03,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:22:03,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:22:03,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2024-06-04 17:22:03,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2024-06-04 17:22:03,236 INFO L175 Difference]: Start difference. First operand has 239 places, 178 transitions, 1353 flow. Second operand 11 states and 136 transitions. [2024-06-04 17:22:03,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 200 transitions, 1987 flow [2024-06-04 17:22:03,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 200 transitions, 1943 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-04 17:22:03,400 INFO L231 Difference]: Finished difference. Result has 241 places, 180 transitions, 1393 flow [2024-06-04 17:22:03,400 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1309, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1393, PETRI_PLACES=241, PETRI_TRANSITIONS=180} [2024-06-04 17:22:03,400 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 210 predicate places. [2024-06-04 17:22:03,400 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 180 transitions, 1393 flow [2024-06-04 17:22:03,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:22:03,401 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:22:03,401 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:22:03,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-04 17:22:03,401 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:22:03,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:22:03,401 INFO L85 PathProgramCache]: Analyzing trace with hash 532101572, now seen corresponding path program 3 times [2024-06-04 17:22:03,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:22:03,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67162811] [2024-06-04 17:22:03,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:22:03,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:22:03,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:22:09,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:22:09,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:22:09,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67162811] [2024-06-04 17:22:09,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67162811] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:22:09,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:22:09,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:22:09,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978585582] [2024-06-04 17:22:09,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:22:09,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:22:09,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:22:09,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:22:09,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:22:09,436 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:22:09,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 180 transitions, 1393 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:22:09,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:22:09,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:22:09,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:22:09,799 INFO L124 PetriNetUnfolderBase]: 454/923 cut-off events. [2024-06-04 17:22:09,799 INFO L125 PetriNetUnfolderBase]: For 53414/53414 co-relation queries the response was YES. [2024-06-04 17:22:09,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4734 conditions, 923 events. 454/923 cut-off events. For 53414/53414 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 5198 event pairs, 70 based on Foata normal form. 2/924 useless extension candidates. Maximal degree in co-relation 4624. Up to 800 conditions per place. [2024-06-04 17:22:09,806 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 169 selfloop transitions, 28 changer transitions 0/200 dead transitions. [2024-06-04 17:22:09,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 200 transitions, 2017 flow [2024-06-04 17:22:09,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:22:09,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:22:09,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2024-06-04 17:22:09,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3806818181818182 [2024-06-04 17:22:09,808 INFO L175 Difference]: Start difference. First operand has 241 places, 180 transitions, 1393 flow. Second operand 11 states and 134 transitions. [2024-06-04 17:22:09,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 200 transitions, 2017 flow [2024-06-04 17:22:09,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 200 transitions, 1969 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-04 17:22:09,971 INFO L231 Difference]: Finished difference. Result has 245 places, 181 transitions, 1419 flow [2024-06-04 17:22:09,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1347, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1419, PETRI_PLACES=245, PETRI_TRANSITIONS=181} [2024-06-04 17:22:09,971 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 214 predicate places. [2024-06-04 17:22:09,971 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 181 transitions, 1419 flow [2024-06-04 17:22:09,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:22:09,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:22:09,971 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:22:09,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-04 17:22:09,972 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:22:09,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:22:09,972 INFO L85 PathProgramCache]: Analyzing trace with hash -476439344, now seen corresponding path program 4 times [2024-06-04 17:22:09,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:22:09,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727062894] [2024-06-04 17:22:09,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:22:09,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:22:10,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:22:15,171 INFO 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:22:15,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:22:15,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727062894] [2024-06-04 17:22:15,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727062894] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:22:15,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:22:15,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:22:15,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45377182] [2024-06-04 17:22:15,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:22:15,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:22:15,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:22:15,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:22:15,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:22:15,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:22:15,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 181 transitions, 1419 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:22:15,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:22:15,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:22:15,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:22:15,741 INFO L124 PetriNetUnfolderBase]: 458/931 cut-off events. [2024-06-04 17:22:15,742 INFO L125 PetriNetUnfolderBase]: For 54550/54550 co-relation queries the response was YES. [2024-06-04 17:22:15,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4807 conditions, 931 events. 458/931 cut-off events. For 54550/54550 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 5260 event pairs, 68 based on Foata normal form. 2/932 useless extension candidates. Maximal degree in co-relation 4695. Up to 752 conditions per place. [2024-06-04 17:22:15,749 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 172 selfloop transitions, 28 changer transitions 0/203 dead transitions. [2024-06-04 17:22:15,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 203 transitions, 2055 flow [2024-06-04 17:22:15,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:22:15,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:22:15,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2024-06-04 17:22:15,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39204545454545453 [2024-06-04 17:22:15,750 INFO L175 Difference]: Start difference. First operand has 245 places, 181 transitions, 1419 flow. Second operand 11 states and 138 transitions. [2024-06-04 17:22:15,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 203 transitions, 2055 flow [2024-06-04 17:22:15,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 203 transitions, 1990 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-04 17:22:15,946 INFO L231 Difference]: Finished difference. Result has 247 places, 182 transitions, 1430 flow [2024-06-04 17:22:15,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1354, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1430, PETRI_PLACES=247, PETRI_TRANSITIONS=182} [2024-06-04 17:22:15,946 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 216 predicate places. [2024-06-04 17:22:15,946 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 182 transitions, 1430 flow [2024-06-04 17:22:15,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:22:15,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:22:15,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:22:15,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-04 17:22:15,947 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:22:15,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:22:15,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1377828432, now seen corresponding path program 5 times [2024-06-04 17:22:15,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:22:15,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422130114] [2024-06-04 17:22:15,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:22:15,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:22:15,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:22:21,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:22:21,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:22:21,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422130114] [2024-06-04 17:22:21,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422130114] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:22:21,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:22:21,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:22:21,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887167074] [2024-06-04 17:22:21,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:22:21,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:22:21,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:22:21,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:22:21,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:22:21,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:22:21,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 182 transitions, 1430 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:22:21,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:22:21,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:22:21,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:22:21,774 INFO L124 PetriNetUnfolderBase]: 455/926 cut-off events. [2024-06-04 17:22:21,774 INFO L125 PetriNetUnfolderBase]: For 48558/48558 co-relation queries the response was YES. [2024-06-04 17:22:21,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4630 conditions, 926 events. 455/926 cut-off events. For 48558/48558 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 5237 event pairs, 73 based on Foata normal form. 2/927 useless extension candidates. Maximal degree in co-relation 4517. Up to 820 conditions per place. [2024-06-04 17:22:21,781 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 169 selfloop transitions, 27 changer transitions 0/199 dead transitions. [2024-06-04 17:22:21,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 199 transitions, 1868 flow [2024-06-04 17:22:21,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:22:21,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:22:21,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 131 transitions. [2024-06-04 17:22:21,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3721590909090909 [2024-06-04 17:22:21,782 INFO L175 Difference]: Start difference. First operand has 247 places, 182 transitions, 1430 flow. Second operand 11 states and 131 transitions. [2024-06-04 17:22:21,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 199 transitions, 1868 flow [2024-06-04 17:22:21,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 199 transitions, 1794 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-04 17:22:21,953 INFO L231 Difference]: Finished difference. Result has 249 places, 182 transitions, 1414 flow [2024-06-04 17:22:21,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1356, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1414, PETRI_PLACES=249, PETRI_TRANSITIONS=182} [2024-06-04 17:22:21,953 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 218 predicate places. [2024-06-04 17:22:21,953 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 182 transitions, 1414 flow [2024-06-04 17:22:21,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:22:21,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:22:21,954 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:22:21,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-04 17:22:21,954 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:22:21,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:22:21,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1377836368, now seen corresponding path program 1 times [2024-06-04 17:22:21,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:22:21,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719347329] [2024-06-04 17:22:21,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:22:21,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:22:21,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:22:27,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:22:27,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:22:27,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719347329] [2024-06-04 17:22:27,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719347329] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:22:27,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:22:27,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:22:27,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771176191] [2024-06-04 17:22:27,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:22:27,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:22:27,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:22:27,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:22:27,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:22:28,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:22:28,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 182 transitions, 1414 flow. Second operand has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:22:28,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:22:28,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:22:28,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:22:28,642 INFO L124 PetriNetUnfolderBase]: 467/954 cut-off events. [2024-06-04 17:22:28,643 INFO L125 PetriNetUnfolderBase]: For 72056/72056 co-relation queries the response was YES. [2024-06-04 17:22:28,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4791 conditions, 954 events. 467/954 cut-off events. For 72056/72056 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 5461 event pairs, 77 based on Foata normal form. 8/961 useless extension candidates. Maximal degree in co-relation 4677. Up to 819 conditions per place. [2024-06-04 17:22:28,650 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 166 selfloop transitions, 25 changer transitions 9/203 dead transitions. [2024-06-04 17:22:28,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 203 transitions, 1938 flow [2024-06-04 17:22:28,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:22:28,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:22:28,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 143 transitions. [2024-06-04 17:22:28,651 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3723958333333333 [2024-06-04 17:22:28,651 INFO L175 Difference]: Start difference. First operand has 249 places, 182 transitions, 1414 flow. Second operand 12 states and 143 transitions. [2024-06-04 17:22:28,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 203 transitions, 1938 flow [2024-06-04 17:22:28,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 203 transitions, 1882 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-04 17:22:28,871 INFO L231 Difference]: Finished difference. Result has 251 places, 179 transitions, 1395 flow [2024-06-04 17:22:28,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1358, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1395, PETRI_PLACES=251, PETRI_TRANSITIONS=179} [2024-06-04 17:22:28,871 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 220 predicate places. [2024-06-04 17:22:28,871 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 179 transitions, 1395 flow [2024-06-04 17:22:28,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:22:28,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:22:28,871 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:22:28,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-04 17:22:28,872 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:22:28,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:22:28,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1906131442, now seen corresponding path program 6 times [2024-06-04 17:22:28,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:22:28,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955567521] [2024-06-04 17:22:28,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:22:28,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:22:28,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:22:35,312 INFO 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:22:35,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:22:35,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955567521] [2024-06-04 17:22:35,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955567521] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:22:35,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:22:35,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:22:35,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531686660] [2024-06-04 17:22:35,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:22:35,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:22:35,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:22:35,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:22:35,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:22:35,465 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:22:35,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 179 transitions, 1395 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:22:35,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:22:35,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:22:35,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:22:35,828 INFO L124 PetriNetUnfolderBase]: 454/927 cut-off events. [2024-06-04 17:22:35,828 INFO L125 PetriNetUnfolderBase]: For 50431/50431 co-relation queries the response was YES. [2024-06-04 17:22:35,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4618 conditions, 927 events. 454/927 cut-off events. For 50431/50431 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 5239 event pairs, 73 based on Foata normal form. 2/928 useless extension candidates. Maximal degree in co-relation 4503. Up to 816 conditions per place. [2024-06-04 17:22:35,835 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 171 selfloop transitions, 22 changer transitions 2/198 dead transitions. [2024-06-04 17:22:35,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 198 transitions, 1888 flow [2024-06-04 17:22:35,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:22:35,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:22:35,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2024-06-04 17:22:35,836 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-04 17:22:35,836 INFO L175 Difference]: Start difference. First operand has 251 places, 179 transitions, 1395 flow. Second operand 11 states and 132 transitions. [2024-06-04 17:22:35,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 198 transitions, 1888 flow [2024-06-04 17:22:36,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 198 transitions, 1830 flow, removed 4 selfloop flow, removed 11 redundant places. [2024-06-04 17:22:36,042 INFO L231 Difference]: Finished difference. Result has 249 places, 180 transitions, 1412 flow [2024-06-04 17:22:36,042 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1337, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1412, PETRI_PLACES=249, PETRI_TRANSITIONS=180} [2024-06-04 17:22:36,042 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 218 predicate places. [2024-06-04 17:22:36,042 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 180 transitions, 1412 flow [2024-06-04 17:22:36,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:22:36,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:22:36,043 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:22:36,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-04 17:22:36,043 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:22:36,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:22:36,043 INFO L85 PathProgramCache]: Analyzing trace with hash 895803066, now seen corresponding path program 7 times [2024-06-04 17:22:36,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:22:36,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968819467] [2024-06-04 17:22:36,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:22:36,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:22:36,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:22:43,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:22:43,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:22:43,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968819467] [2024-06-04 17:22:43,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968819467] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:22:43,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:22:43,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:22:43,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747713145] [2024-06-04 17:22:43,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:22:43,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:22:43,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:22:43,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:22:43,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:22:43,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:22:43,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 180 transitions, 1412 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:22:43,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:22:43,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:22:43,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:22:43,977 INFO L124 PetriNetUnfolderBase]: 453/918 cut-off events. [2024-06-04 17:22:43,978 INFO L125 PetriNetUnfolderBase]: For 55575/55575 co-relation queries the response was YES. [2024-06-04 17:22:43,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4705 conditions, 918 events. 453/918 cut-off events. For 55575/55575 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5154 event pairs, 72 based on Foata normal form. 2/919 useless extension candidates. Maximal degree in co-relation 4590. Up to 773 conditions per place. [2024-06-04 17:22:43,985 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 173 selfloop transitions, 24 changer transitions 0/200 dead transitions. [2024-06-04 17:22:43,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 200 transitions, 2060 flow [2024-06-04 17:22:43,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:22:43,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:22:43,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2024-06-04 17:22:43,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835227272727273 [2024-06-04 17:22:43,987 INFO L175 Difference]: Start difference. First operand has 249 places, 180 transitions, 1412 flow. Second operand 11 states and 135 transitions. [2024-06-04 17:22:43,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 200 transitions, 2060 flow [2024-06-04 17:22:44,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 200 transitions, 1987 flow, removed 12 selfloop flow, removed 10 redundant places. [2024-06-04 17:22:44,192 INFO L231 Difference]: Finished difference. Result has 250 places, 182 transitions, 1429 flow [2024-06-04 17:22:44,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1339, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1429, PETRI_PLACES=250, PETRI_TRANSITIONS=182} [2024-06-04 17:22:44,192 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 219 predicate places. [2024-06-04 17:22:44,193 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 182 transitions, 1429 flow [2024-06-04 17:22:44,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:22:44,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:22:44,193 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:22:44,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-04 17:22:44,193 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:22:44,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:22:44,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1042345028, now seen corresponding path program 8 times [2024-06-04 17:22:44,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:22:44,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298873146] [2024-06-04 17:22:44,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:22:44,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:22:44,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:22:49,863 INFO 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:22:49,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:22:49,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298873146] [2024-06-04 17:22:49,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298873146] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:22:49,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:22:49,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:22:49,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684555105] [2024-06-04 17:22:49,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:22:49,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:22:49,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:22:49,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:22:49,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:22:50,104 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:22:50,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 182 transitions, 1429 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:22:50,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:22:50,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:22:50,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:22:50,552 INFO L124 PetriNetUnfolderBase]: 464/939 cut-off events. [2024-06-04 17:22:50,552 INFO L125 PetriNetUnfolderBase]: For 64382/64382 co-relation queries the response was YES. [2024-06-04 17:22:50,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4989 conditions, 939 events. 464/939 cut-off events. For 64382/64382 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 5297 event pairs, 77 based on Foata normal form. 2/940 useless extension candidates. Maximal degree in co-relation 4874. Up to 808 conditions per place. [2024-06-04 17:22:50,560 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 176 selfloop transitions, 23 changer transitions 0/202 dead transitions. [2024-06-04 17:22:50,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 202 transitions, 2087 flow [2024-06-04 17:22:50,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:22:50,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:22:50,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2024-06-04 17:22:50,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835227272727273 [2024-06-04 17:22:50,561 INFO L175 Difference]: Start difference. First operand has 250 places, 182 transitions, 1429 flow. Second operand 11 states and 135 transitions. [2024-06-04 17:22:50,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 202 transitions, 2087 flow [2024-06-04 17:22:50,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 202 transitions, 2038 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-04 17:22:50,769 INFO L231 Difference]: Finished difference. Result has 254 places, 184 transitions, 1472 flow [2024-06-04 17:22:50,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1380, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1472, PETRI_PLACES=254, PETRI_TRANSITIONS=184} [2024-06-04 17:22:50,769 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 223 predicate places. [2024-06-04 17:22:50,769 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 184 transitions, 1472 flow [2024-06-04 17:22:50,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:22:50,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:22:50,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:22:50,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-04 17:22:50,770 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:22:50,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:22:50,770 INFO L85 PathProgramCache]: Analyzing trace with hash 43029712, now seen corresponding path program 9 times [2024-06-04 17:22:50,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:22:50,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150609435] [2024-06-04 17:22:50,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:22:50,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:22:50,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:22:55,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:22:55,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:22:55,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150609435] [2024-06-04 17:22:55,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150609435] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:22:55,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:22:55,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:22:55,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742127701] [2024-06-04 17:22:55,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:22:55,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:22:55,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:22:55,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:22:55,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:22:55,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:22:55,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 184 transitions, 1472 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:22:55,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:22:55,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:22:55,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:22:56,225 INFO L124 PetriNetUnfolderBase]: 461/934 cut-off events. [2024-06-04 17:22:56,225 INFO L125 PetriNetUnfolderBase]: For 57991/57991 co-relation queries the response was YES. [2024-06-04 17:22:56,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4803 conditions, 934 events. 461/934 cut-off events. For 57991/57991 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 5253 event pairs, 78 based on Foata normal form. 2/935 useless extension candidates. Maximal degree in co-relation 4686. Up to 828 conditions per place. [2024-06-04 17:22:56,233 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 175 selfloop transitions, 22 changer transitions 0/200 dead transitions. [2024-06-04 17:22:56,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 200 transitions, 1908 flow [2024-06-04 17:22:56,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:22:56,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:22:56,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 131 transitions. [2024-06-04 17:22:56,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3721590909090909 [2024-06-04 17:22:56,234 INFO L175 Difference]: Start difference. First operand has 254 places, 184 transitions, 1472 flow. Second operand 11 states and 131 transitions. [2024-06-04 17:22:56,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 200 transitions, 1908 flow [2024-06-04 17:22:56,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 200 transitions, 1843 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-04 17:22:56,456 INFO L231 Difference]: Finished difference. Result has 258 places, 184 transitions, 1455 flow [2024-06-04 17:22:56,456 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1407, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1455, PETRI_PLACES=258, PETRI_TRANSITIONS=184} [2024-06-04 17:22:56,457 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 227 predicate places. [2024-06-04 17:22:56,457 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 184 transitions, 1455 flow [2024-06-04 17:22:56,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:22:56,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:22:56,457 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:22:56,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-04 17:22:56,457 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:22:56,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:22:56,458 INFO L85 PathProgramCache]: Analyzing trace with hash 2100070852, now seen corresponding path program 10 times [2024-06-04 17:22:56,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:22:56,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907548313] [2024-06-04 17:22:56,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:22:56,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:22:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:23:02,692 INFO 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:23:02,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:23:02,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907548313] [2024-06-04 17:23:02,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907548313] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:23:02,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:23:02,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:23:02,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450817761] [2024-06-04 17:23:02,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:23:02,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:23:02,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:23:02,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:23:02,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:23:02,872 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:23:02,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 184 transitions, 1455 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:23:02,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:23:02,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:23:02,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:23:03,174 INFO L124 PetriNetUnfolderBase]: 458/929 cut-off events. [2024-06-04 17:23:03,174 INFO L125 PetriNetUnfolderBase]: For 51046/51046 co-relation queries the response was YES. [2024-06-04 17:23:03,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4577 conditions, 929 events. 458/929 cut-off events. For 51046/51046 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 5256 event pairs, 77 based on Foata normal form. 2/930 useless extension candidates. Maximal degree in co-relation 4458. Up to 823 conditions per place. [2024-06-04 17:23:03,182 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 174 selfloop transitions, 23 changer transitions 0/200 dead transitions. [2024-06-04 17:23:03,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 200 transitions, 1891 flow [2024-06-04 17:23:03,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:23:03,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:23:03,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 131 transitions. [2024-06-04 17:23:03,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3721590909090909 [2024-06-04 17:23:03,183 INFO L175 Difference]: Start difference. First operand has 258 places, 184 transitions, 1455 flow. Second operand 11 states and 131 transitions. [2024-06-04 17:23:03,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 200 transitions, 1891 flow [2024-06-04 17:23:03,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 200 transitions, 1835 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-04 17:23:03,386 INFO L231 Difference]: Finished difference. Result has 259 places, 184 transitions, 1449 flow [2024-06-04 17:23:03,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1399, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1449, PETRI_PLACES=259, PETRI_TRANSITIONS=184} [2024-06-04 17:23:03,386 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 228 predicate places. [2024-06-04 17:23:03,386 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 184 transitions, 1449 flow [2024-06-04 17:23:03,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:23:03,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:23:03,386 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:23:03,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-04 17:23:03,386 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:23:03,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:23:03,387 INFO L85 PathProgramCache]: Analyzing trace with hash 900241958, now seen corresponding path program 11 times [2024-06-04 17:23:03,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:23:03,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903381656] [2024-06-04 17:23:03,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:23:03,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:23:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:23:10,228 INFO 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:23:10,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:23:10,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903381656] [2024-06-04 17:23:10,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903381656] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:23:10,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:23:10,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:23:10,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424063326] [2024-06-04 17:23:10,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:23:10,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:23:10,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:23:10,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:23:10,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:23:10,387 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:23:10,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 184 transitions, 1449 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:23:10,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:23:10,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:23:10,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:23:10,767 INFO L124 PetriNetUnfolderBase]: 462/937 cut-off events. [2024-06-04 17:23:10,767 INFO L125 PetriNetUnfolderBase]: For 52183/52183 co-relation queries the response was YES. [2024-06-04 17:23:10,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4630 conditions, 937 events. 462/937 cut-off events. For 52183/52183 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 5305 event pairs, 75 based on Foata normal form. 2/938 useless extension candidates. Maximal degree in co-relation 4510. Up to 729 conditions per place. [2024-06-04 17:23:10,775 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 173 selfloop transitions, 27 changer transitions 0/203 dead transitions. [2024-06-04 17:23:10,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 203 transitions, 1917 flow [2024-06-04 17:23:10,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:23:10,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:23:10,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2024-06-04 17:23:10,776 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835227272727273 [2024-06-04 17:23:10,776 INFO L175 Difference]: Start difference. First operand has 259 places, 184 transitions, 1449 flow. Second operand 11 states and 135 transitions. [2024-06-04 17:23:10,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 203 transitions, 1917 flow [2024-06-04 17:23:10,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 203 transitions, 1865 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-06-04 17:23:10,993 INFO L231 Difference]: Finished difference. Result has 260 places, 185 transitions, 1479 flow [2024-06-04 17:23:10,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1397, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1479, PETRI_PLACES=260, PETRI_TRANSITIONS=185} [2024-06-04 17:23:10,994 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 229 predicate places. [2024-06-04 17:23:10,994 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 185 transitions, 1479 flow [2024-06-04 17:23:10,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:23:10,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:23:10,994 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:23:10,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-04 17:23:10,994 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:23:10,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:23:10,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1788746650, now seen corresponding path program 2 times [2024-06-04 17:23:10,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:23:10,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103216400] [2024-06-04 17:23:10,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:23:10,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:23:11,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:23:17,322 INFO 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:23:17,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:23:17,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103216400] [2024-06-04 17:23:17,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103216400] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:23:17,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:23:17,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:23:17,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870529636] [2024-06-04 17:23:17,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:23:17,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:23:17,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:23:17,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:23:17,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:23:17,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:23:17,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 185 transitions, 1479 flow. Second operand has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:23:17,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:23:17,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:23:17,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:23:17,976 INFO L124 PetriNetUnfolderBase]: 474/968 cut-off events. [2024-06-04 17:23:17,976 INFO L125 PetriNetUnfolderBase]: For 76284/76286 co-relation queries the response was YES. [2024-06-04 17:23:17,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4858 conditions, 968 events. 474/968 cut-off events. For 76284/76286 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 5526 event pairs, 89 based on Foata normal form. 8/975 useless extension candidates. Maximal degree in co-relation 4737. Up to 797 conditions per place. [2024-06-04 17:23:17,983 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 154 selfloop transitions, 37 changer transitions 9/203 dead transitions. [2024-06-04 17:23:17,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 203 transitions, 1987 flow [2024-06-04 17:23:17,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:23:17,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:23:17,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 144 transitions. [2024-06-04 17:23:17,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-04 17:23:17,984 INFO L175 Difference]: Start difference. First operand has 260 places, 185 transitions, 1479 flow. Second operand 12 states and 144 transitions. [2024-06-04 17:23:17,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 203 transitions, 1987 flow [2024-06-04 17:23:18,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 203 transitions, 1915 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-04 17:23:18,203 INFO L231 Difference]: Finished difference. Result has 263 places, 182 transitions, 1469 flow [2024-06-04 17:23:18,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1407, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1469, PETRI_PLACES=263, PETRI_TRANSITIONS=182} [2024-06-04 17:23:18,203 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 232 predicate places. [2024-06-04 17:23:18,204 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 182 transitions, 1469 flow [2024-06-04 17:23:18,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:23:18,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:23:18,204 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:23:18,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-04 17:23:18,204 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:23:18,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:23:18,204 INFO L85 PathProgramCache]: Analyzing trace with hash 2107704788, now seen corresponding path program 3 times [2024-06-04 17:23:18,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:23:18,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076273669] [2024-06-04 17:23:18,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:23:18,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:23:18,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:23:23,660 INFO 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:23:23,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:23:23,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076273669] [2024-06-04 17:23:23,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076273669] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:23:23,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:23:23,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:23:23,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288927989] [2024-06-04 17:23:23,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:23:23,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:23:23,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:23:23,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:23:23,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:23:23,835 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:23:23,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 182 transitions, 1469 flow. Second operand has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:23:23,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:23:23,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:23:23,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:23:24,184 INFO L124 PetriNetUnfolderBase]: 465/951 cut-off events. [2024-06-04 17:23:24,184 INFO L125 PetriNetUnfolderBase]: For 68963/68965 co-relation queries the response was YES. [2024-06-04 17:23:24,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4748 conditions, 951 events. 465/951 cut-off events. For 68963/68965 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 5419 event pairs, 83 based on Foata normal form. 6/956 useless extension candidates. Maximal degree in co-relation 4626. Up to 787 conditions per place. [2024-06-04 17:23:24,191 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 152 selfloop transitions, 34 changer transitions 11/200 dead transitions. [2024-06-04 17:23:24,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 200 transitions, 1947 flow [2024-06-04 17:23:24,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:23:24,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:23:24,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 142 transitions. [2024-06-04 17:23:24,192 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3697916666666667 [2024-06-04 17:23:24,192 INFO L175 Difference]: Start difference. First operand has 263 places, 182 transitions, 1469 flow. Second operand 12 states and 142 transitions. [2024-06-04 17:23:24,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 200 transitions, 1947 flow [2024-06-04 17:23:24,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 200 transitions, 1863 flow, removed 5 selfloop flow, removed 11 redundant places. [2024-06-04 17:23:24,417 INFO L231 Difference]: Finished difference. Result has 261 places, 178 transitions, 1430 flow [2024-06-04 17:23:24,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1387, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1430, PETRI_PLACES=261, PETRI_TRANSITIONS=178} [2024-06-04 17:23:24,417 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 230 predicate places. [2024-06-04 17:23:24,417 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 178 transitions, 1430 flow [2024-06-04 17:23:24,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:23:24,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:23:24,417 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:23:24,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-04 17:23:24,418 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:23:24,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:23:24,418 INFO L85 PathProgramCache]: Analyzing trace with hash 869589110, now seen corresponding path program 12 times [2024-06-04 17:23:24,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:23:24,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205523825] [2024-06-04 17:23:24,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:23:24,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:23:24,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:23:29,959 INFO 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:23:29,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:23:29,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205523825] [2024-06-04 17:23:29,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205523825] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:23:29,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:23:29,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:23:29,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707003660] [2024-06-04 17:23:29,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:23:29,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:23:29,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:23:29,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:23:29,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:23:30,094 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:23:30,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 178 transitions, 1430 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:23:30,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:23:30,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:23:30,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:23:30,436 INFO L124 PetriNetUnfolderBase]: 466/944 cut-off events. [2024-06-04 17:23:30,436 INFO L125 PetriNetUnfolderBase]: For 61720/61722 co-relation queries the response was YES. [2024-06-04 17:23:30,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4899 conditions, 944 events. 466/944 cut-off events. For 61720/61722 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 5319 event pairs, 85 based on Foata normal form. 4/947 useless extension candidates. Maximal degree in co-relation 4778. Up to 738 conditions per place. [2024-06-04 17:23:30,445 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 149 selfloop transitions, 46 changer transitions 2/200 dead transitions. [2024-06-04 17:23:30,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 200 transitions, 2154 flow [2024-06-04 17:23:30,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:23:30,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:23:30,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 143 transitions. [2024-06-04 17:23:30,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-04 17:23:30,448 INFO L175 Difference]: Start difference. First operand has 261 places, 178 transitions, 1430 flow. Second operand 11 states and 143 transitions. [2024-06-04 17:23:30,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 200 transitions, 2154 flow [2024-06-04 17:23:30,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 200 transitions, 2044 flow, removed 21 selfloop flow, removed 12 redundant places. [2024-06-04 17:23:30,678 INFO L231 Difference]: Finished difference. Result has 255 places, 183 transitions, 1533 flow [2024-06-04 17:23:30,678 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1336, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1533, PETRI_PLACES=255, PETRI_TRANSITIONS=183} [2024-06-04 17:23:30,678 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 224 predicate places. [2024-06-04 17:23:30,678 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 183 transitions, 1533 flow [2024-06-04 17:23:30,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:23:30,679 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:23:30,679 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:23:30,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-04 17:23:30,679 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:23:30,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:23:30,679 INFO L85 PathProgramCache]: Analyzing trace with hash 869594690, now seen corresponding path program 13 times [2024-06-04 17:23:30,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:23:30,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25031122] [2024-06-04 17:23:30,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:23:30,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:23:30,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:23:36,818 INFO 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:23:36,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:23:36,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25031122] [2024-06-04 17:23:36,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25031122] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:23:36,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:23:36,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:23:36,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914039909] [2024-06-04 17:23:36,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:23:36,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:23:36,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:23:36,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:23:36,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:23:36,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:23:36,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 183 transitions, 1533 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:23:36,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:23:36,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:23:36,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:23:37,284 INFO L124 PetriNetUnfolderBase]: 459/935 cut-off events. [2024-06-04 17:23:37,284 INFO L125 PetriNetUnfolderBase]: For 49722/49724 co-relation queries the response was YES. [2024-06-04 17:23:37,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4615 conditions, 935 events. 459/935 cut-off events. For 49722/49724 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5323 event pairs, 86 based on Foata normal form. 4/938 useless extension candidates. Maximal degree in co-relation 4496. Up to 746 conditions per place. [2024-06-04 17:23:37,293 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 148 selfloop transitions, 45 changer transitions 0/196 dead transitions. [2024-06-04 17:23:37,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 196 transitions, 1953 flow [2024-06-04 17:23:37,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:23:37,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:23:37,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2024-06-04 17:23:37,295 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39204545454545453 [2024-06-04 17:23:37,295 INFO L175 Difference]: Start difference. First operand has 255 places, 183 transitions, 1533 flow. Second operand 11 states and 138 transitions. [2024-06-04 17:23:37,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 196 transitions, 1953 flow [2024-06-04 17:23:37,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 196 transitions, 1847 flow, removed 34 selfloop flow, removed 4 redundant places. [2024-06-04 17:23:37,490 INFO L231 Difference]: Finished difference. Result has 262 places, 183 transitions, 1521 flow [2024-06-04 17:23:37,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1427, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1521, PETRI_PLACES=262, PETRI_TRANSITIONS=183} [2024-06-04 17:23:37,491 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 231 predicate places. [2024-06-04 17:23:37,491 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 183 transitions, 1521 flow [2024-06-04 17:23:37,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:23:37,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:23:37,491 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:23:37,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-04 17:23:37,491 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:23:37,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:23:37,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1231482442, now seen corresponding path program 14 times [2024-06-04 17:23:37,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:23:37,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812695233] [2024-06-04 17:23:37,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:23:37,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:23:37,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:23:43,816 INFO 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:23:43,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:23:43,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812695233] [2024-06-04 17:23:43,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812695233] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:23:43,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:23:43,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:23:43,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255751529] [2024-06-04 17:23:43,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:23:43,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:23:43,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:23:43,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:23:43,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:23:43,974 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:23:43,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 183 transitions, 1521 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:23:43,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:23:43,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:23:43,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:23:44,455 INFO L124 PetriNetUnfolderBase]: 470/957 cut-off events. [2024-06-04 17:23:44,455 INFO L125 PetriNetUnfolderBase]: For 58386/58390 co-relation queries the response was YES. [2024-06-04 17:23:44,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4938 conditions, 957 events. 470/957 cut-off events. For 58386/58390 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5464 event pairs, 92 based on Foata normal form. 2/957 useless extension candidates. Maximal degree in co-relation 4817. Up to 694 conditions per place. [2024-06-04 17:23:44,463 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 137 selfloop transitions, 60 changer transitions 3/203 dead transitions. [2024-06-04 17:23:44,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 203 transitions, 2213 flow [2024-06-04 17:23:44,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:23:44,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:23:44,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 143 transitions. [2024-06-04 17:23:44,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-04 17:23:44,466 INFO L175 Difference]: Start difference. First operand has 262 places, 183 transitions, 1521 flow. Second operand 11 states and 143 transitions. [2024-06-04 17:23:44,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 203 transitions, 2213 flow [2024-06-04 17:23:44,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 203 transitions, 2114 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-04 17:23:44,703 INFO L231 Difference]: Finished difference. Result has 263 places, 185 transitions, 1602 flow [2024-06-04 17:23:44,703 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1428, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1602, PETRI_PLACES=263, PETRI_TRANSITIONS=185} [2024-06-04 17:23:44,703 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 232 predicate places. [2024-06-04 17:23:44,703 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 185 transitions, 1602 flow [2024-06-04 17:23:44,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:23:44,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:23:44,704 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:23:44,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-04 17:23:44,704 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:23:44,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:23:44,704 INFO L85 PathProgramCache]: Analyzing trace with hash 11309226, now seen corresponding path program 15 times [2024-06-04 17:23:44,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:23:44,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222536768] [2024-06-04 17:23:44,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:23:44,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:23:44,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:23:50,474 INFO 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:23:50,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:23:50,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222536768] [2024-06-04 17:23:50,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222536768] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:23:50,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:23:50,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:23:50,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142001510] [2024-06-04 17:23:50,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:23:50,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:23:50,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:23:50,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:23:50,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:23:50,631 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:23:50,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 185 transitions, 1602 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:23:50,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:23:50,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:23:50,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:23:51,064 INFO L124 PetriNetUnfolderBase]: 441/889 cut-off events. [2024-06-04 17:23:51,064 INFO L125 PetriNetUnfolderBase]: For 58227/58229 co-relation queries the response was YES. [2024-06-04 17:23:51,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4653 conditions, 889 events. 441/889 cut-off events. For 58227/58229 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 4986 event pairs, 77 based on Foata normal form. 4/892 useless extension candidates. Maximal degree in co-relation 4531. Up to 683 conditions per place. [2024-06-04 17:23:51,072 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 148 selfloop transitions, 50 changer transitions 0/201 dead transitions. [2024-06-04 17:23:51,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 201 transitions, 2242 flow [2024-06-04 17:23:51,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:23:51,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:23:51,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2024-06-04 17:23:51,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39204545454545453 [2024-06-04 17:23:51,073 INFO L175 Difference]: Start difference. First operand has 263 places, 185 transitions, 1602 flow. Second operand 11 states and 138 transitions. [2024-06-04 17:23:51,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 201 transitions, 2242 flow [2024-06-04 17:23:51,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 201 transitions, 2084 flow, removed 42 selfloop flow, removed 6 redundant places. [2024-06-04 17:23:51,266 INFO L231 Difference]: Finished difference. Result has 268 places, 186 transitions, 1574 flow [2024-06-04 17:23:51,266 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1454, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1574, PETRI_PLACES=268, PETRI_TRANSITIONS=186} [2024-06-04 17:23:51,266 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 237 predicate places. [2024-06-04 17:23:51,266 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 186 transitions, 1574 flow [2024-06-04 17:23:51,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:23:51,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:23:51,267 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:23:51,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-04 17:23:51,267 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:23:51,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:23:51,267 INFO L85 PathProgramCache]: Analyzing trace with hash 11516616, now seen corresponding path program 16 times [2024-06-04 17:23:51,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:23:51,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6217323] [2024-06-04 17:23:51,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:23:51,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:23:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:23:57,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:23:57,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:23:57,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6217323] [2024-06-04 17:23:57,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6217323] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:23:57,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:23:57,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:23:57,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056800954] [2024-06-04 17:23:57,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:23:57,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:23:57,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:23:57,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:23:57,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:23:57,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:23:57,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 186 transitions, 1574 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:23:57,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:23:57,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:23:57,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:23:57,523 INFO L124 PetriNetUnfolderBase]: 438/888 cut-off events. [2024-06-04 17:23:57,523 INFO L125 PetriNetUnfolderBase]: For 50052/50054 co-relation queries the response was YES. [2024-06-04 17:23:57,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4355 conditions, 888 events. 438/888 cut-off events. For 50052/50054 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 4999 event pairs, 80 based on Foata normal form. 4/891 useless extension candidates. Maximal degree in co-relation 4232. Up to 695 conditions per place. [2024-06-04 17:23:57,531 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 147 selfloop transitions, 49 changer transitions 0/199 dead transitions. [2024-06-04 17:23:57,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 199 transitions, 2000 flow [2024-06-04 17:23:57,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:23:57,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:23:57,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2024-06-04 17:23:57,532 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835227272727273 [2024-06-04 17:23:57,532 INFO L175 Difference]: Start difference. First operand has 268 places, 186 transitions, 1574 flow. Second operand 11 states and 135 transitions. [2024-06-04 17:23:57,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 199 transitions, 2000 flow [2024-06-04 17:23:57,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 199 transitions, 1875 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-06-04 17:23:57,697 INFO L231 Difference]: Finished difference. Result has 270 places, 186 transitions, 1551 flow [2024-06-04 17:23:57,698 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1449, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1551, PETRI_PLACES=270, PETRI_TRANSITIONS=186} [2024-06-04 17:23:57,698 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 239 predicate places. [2024-06-04 17:23:57,698 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 186 transitions, 1551 flow [2024-06-04 17:23:57,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:23:57,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:23:57,698 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:23:57,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-04 17:23:57,698 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:23:57,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:23:57,699 INFO L85 PathProgramCache]: Analyzing trace with hash -70546216, now seen corresponding path program 17 times [2024-06-04 17:23:57,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:23:57,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837240835] [2024-06-04 17:23:57,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:23:57,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:23:57,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:24:03,176 INFO 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:24:03,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:24:03,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837240835] [2024-06-04 17:24:03,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837240835] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:24:03,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:24:03,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:24:03,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447464129] [2024-06-04 17:24:03,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:24:03,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:24:03,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:24:03,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:24:03,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:24:03,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:24:03,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 186 transitions, 1551 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:24:03,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:24:03,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:24:03,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:24:03,614 INFO L124 PetriNetUnfolderBase]: 450/914 cut-off events. [2024-06-04 17:24:03,614 INFO L125 PetriNetUnfolderBase]: For 59861/59863 co-relation queries the response was YES. [2024-06-04 17:24:03,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4682 conditions, 914 events. 450/914 cut-off events. For 59861/59863 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 5190 event pairs, 81 based on Foata normal form. 4/917 useless extension candidates. Maximal degree in co-relation 4558. Up to 701 conditions per place. [2024-06-04 17:24:03,622 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 151 selfloop transitions, 50 changer transitions 0/204 dead transitions. [2024-06-04 17:24:03,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 204 transitions, 2237 flow [2024-06-04 17:24:03,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:24:03,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:24:03,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 137 transitions. [2024-06-04 17:24:03,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38920454545454547 [2024-06-04 17:24:03,626 INFO L175 Difference]: Start difference. First operand has 270 places, 186 transitions, 1551 flow. Second operand 11 states and 137 transitions. [2024-06-04 17:24:03,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 204 transitions, 2237 flow [2024-06-04 17:24:03,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 204 transitions, 2134 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-04 17:24:03,818 INFO L231 Difference]: Finished difference. Result has 271 places, 189 transitions, 1616 flow [2024-06-04 17:24:03,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1450, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1616, PETRI_PLACES=271, PETRI_TRANSITIONS=189} [2024-06-04 17:24:03,818 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 240 predicate places. [2024-06-04 17:24:03,818 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 189 transitions, 1616 flow [2024-06-04 17:24:03,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:24:03,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:24:03,819 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:24:03,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-04 17:24:03,819 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:24:03,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:24:03,819 INFO L85 PathProgramCache]: Analyzing trace with hash -136300374, now seen corresponding path program 18 times [2024-06-04 17:24:03,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:24:03,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626108341] [2024-06-04 17:24:03,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:24:03,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:24:03,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:24:09,763 INFO 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:24:09,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:24:09,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626108341] [2024-06-04 17:24:09,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626108341] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:24:09,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:24:09,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:24:09,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152135506] [2024-06-04 17:24:09,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:24:09,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:24:09,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:24:09,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:24:09,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:24:09,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:24:09,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 189 transitions, 1616 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:24:09,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:24:09,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:24:09,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:24:10,287 INFO L124 PetriNetUnfolderBase]: 454/922 cut-off events. [2024-06-04 17:24:10,287 INFO L125 PetriNetUnfolderBase]: For 61530/61532 co-relation queries the response was YES. [2024-06-04 17:24:10,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4777 conditions, 922 events. 454/922 cut-off events. For 61530/61532 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 5254 event pairs, 79 based on Foata normal form. 4/925 useless extension candidates. Maximal degree in co-relation 4652. Up to 538 conditions per place. [2024-06-04 17:24:10,295 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 146 selfloop transitions, 58 changer transitions 0/207 dead transitions. [2024-06-04 17:24:10,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 207 transitions, 2280 flow [2024-06-04 17:24:10,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:24:10,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:24:10,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 140 transitions. [2024-06-04 17:24:10,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3977272727272727 [2024-06-04 17:24:10,297 INFO L175 Difference]: Start difference. First operand has 271 places, 189 transitions, 1616 flow. Second operand 11 states and 140 transitions. [2024-06-04 17:24:10,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 207 transitions, 2280 flow [2024-06-04 17:24:10,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 207 transitions, 2170 flow, removed 19 selfloop flow, removed 6 redundant places. [2024-06-04 17:24:10,504 INFO L231 Difference]: Finished difference. Result has 276 places, 190 transitions, 1654 flow [2024-06-04 17:24:10,504 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1506, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1654, PETRI_PLACES=276, PETRI_TRANSITIONS=190} [2024-06-04 17:24:10,504 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 245 predicate places. [2024-06-04 17:24:10,505 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 190 transitions, 1654 flow [2024-06-04 17:24:10,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:24:10,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:24:10,505 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:24:10,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-04 17:24:10,505 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:24:10,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:24:10,506 INFO L85 PathProgramCache]: Analyzing trace with hash 864082580, now seen corresponding path program 19 times [2024-06-04 17:24:10,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:24:10,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775190745] [2024-06-04 17:24:10,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:24:10,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:24:10,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:24:16,007 INFO 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:24:16,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:24:16,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775190745] [2024-06-04 17:24:16,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775190745] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:24:16,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:24:16,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:24:16,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813193901] [2024-06-04 17:24:16,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:24:16,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:24:16,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:24:16,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:24:16,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:24:16,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:24:16,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 190 transitions, 1654 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:24:16,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:24:16,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:24:16,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:24:16,497 INFO L124 PetriNetUnfolderBase]: 465/943 cut-off events. [2024-06-04 17:24:16,497 INFO L125 PetriNetUnfolderBase]: For 71989/71991 co-relation queries the response was YES. [2024-06-04 17:24:16,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5174 conditions, 943 events. 465/943 cut-off events. For 71989/71991 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 5408 event pairs, 84 based on Foata normal form. 4/946 useless extension candidates. Maximal degree in co-relation 5048. Up to 692 conditions per place. [2024-06-04 17:24:16,507 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 156 selfloop transitions, 49 changer transitions 0/208 dead transitions. [2024-06-04 17:24:16,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 208 transitions, 2352 flow [2024-06-04 17:24:16,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:24:16,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:24:16,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 142 transitions. [2024-06-04 17:24:16,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4034090909090909 [2024-06-04 17:24:16,508 INFO L175 Difference]: Start difference. First operand has 276 places, 190 transitions, 1654 flow. Second operand 11 states and 142 transitions. [2024-06-04 17:24:16,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 208 transitions, 2352 flow [2024-06-04 17:24:16,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 208 transitions, 2179 flow, removed 25 selfloop flow, removed 11 redundant places. [2024-06-04 17:24:16,736 INFO L231 Difference]: Finished difference. Result has 276 places, 192 transitions, 1645 flow [2024-06-04 17:24:16,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1499, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1645, PETRI_PLACES=276, PETRI_TRANSITIONS=192} [2024-06-04 17:24:16,736 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 245 predicate places. [2024-06-04 17:24:16,736 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 192 transitions, 1645 flow [2024-06-04 17:24:16,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:24:16,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:24:16,737 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:24:16,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-04 17:24:16,737 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:24:16,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:24:16,737 INFO L85 PathProgramCache]: Analyzing trace with hash -70540636, now seen corresponding path program 20 times [2024-06-04 17:24:16,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:24:16,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957007816] [2024-06-04 17:24:16,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:24:16,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:24:16,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:24:22,861 INFO 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:24:22,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:24:22,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957007816] [2024-06-04 17:24:22,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957007816] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:24:22,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:24:22,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:24:22,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425445324] [2024-06-04 17:24:22,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:24:22,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:24:22,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:24:22,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:24:22,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:24:23,034 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:24:23,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 192 transitions, 1645 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:24:23,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:24:23,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:24:23,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:24:23,328 INFO L124 PetriNetUnfolderBase]: 462/936 cut-off events. [2024-06-04 17:24:23,329 INFO L125 PetriNetUnfolderBase]: For 63667/63669 co-relation queries the response was YES. [2024-06-04 17:24:23,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4769 conditions, 936 events. 462/936 cut-off events. For 63667/63669 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 5349 event pairs, 87 based on Foata normal form. 4/939 useless extension candidates. Maximal degree in co-relation 4645. Up to 742 conditions per place. [2024-06-04 17:24:23,338 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 153 selfloop transitions, 49 changer transitions 0/205 dead transitions. [2024-06-04 17:24:23,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 205 transitions, 2083 flow [2024-06-04 17:24:23,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:24:23,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:24:23,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2024-06-04 17:24:23,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3806818181818182 [2024-06-04 17:24:23,339 INFO L175 Difference]: Start difference. First operand has 276 places, 192 transitions, 1645 flow. Second operand 11 states and 134 transitions. [2024-06-04 17:24:23,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 205 transitions, 2083 flow [2024-06-04 17:24:23,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 205 transitions, 1989 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-04 17:24:23,546 INFO L231 Difference]: Finished difference. Result has 280 places, 192 transitions, 1653 flow [2024-06-04 17:24:23,547 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1551, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1653, PETRI_PLACES=280, PETRI_TRANSITIONS=192} [2024-06-04 17:24:23,547 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 249 predicate places. [2024-06-04 17:24:23,547 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 192 transitions, 1653 flow [2024-06-04 17:24:23,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:24:23,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:24:23,547 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:24:23,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-04 17:24:23,548 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:24:23,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:24:23,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1063735910, now seen corresponding path program 21 times [2024-06-04 17:24:23,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:24:23,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750279527] [2024-06-04 17:24:23,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:24:23,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:24:23,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:24:28,944 INFO 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:24:28,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:24:28,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750279527] [2024-06-04 17:24:28,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750279527] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:24:28,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:24:28,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:24:28,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253851265] [2024-06-04 17:24:28,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:24:28,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:24:28,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:24:28,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:24:28,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:24:29,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:24:29,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 192 transitions, 1653 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:24:29,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:24:29,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:24:29,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:24:29,368 INFO L124 PetriNetUnfolderBase]: 467/949 cut-off events. [2024-06-04 17:24:29,368 INFO L125 PetriNetUnfolderBase]: For 64653/64655 co-relation queries the response was YES. [2024-06-04 17:24:29,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4855 conditions, 949 events. 467/949 cut-off events. For 64653/64655 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5468 event pairs, 89 based on Foata normal form. 4/952 useless extension candidates. Maximal degree in co-relation 4729. Up to 752 conditions per place. [2024-06-04 17:24:29,377 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 156 selfloop transitions, 48 changer transitions 0/207 dead transitions. [2024-06-04 17:24:29,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 207 transitions, 2127 flow [2024-06-04 17:24:29,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:24:29,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:24:29,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 137 transitions. [2024-06-04 17:24:29,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38920454545454547 [2024-06-04 17:24:29,378 INFO L175 Difference]: Start difference. First operand has 280 places, 192 transitions, 1653 flow. Second operand 11 states and 137 transitions. [2024-06-04 17:24:29,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 207 transitions, 2127 flow [2024-06-04 17:24:29,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 207 transitions, 2024 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-04 17:24:29,604 INFO L231 Difference]: Finished difference. Result has 281 places, 194 transitions, 1684 flow [2024-06-04 17:24:29,604 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1552, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1684, PETRI_PLACES=281, PETRI_TRANSITIONS=194} [2024-06-04 17:24:29,604 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 250 predicate places. [2024-06-04 17:24:29,604 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 194 transitions, 1684 flow [2024-06-04 17:24:29,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:24:29,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:24:29,605 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:24:29,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-04 17:24:29,605 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:24:29,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:24:29,605 INFO L85 PathProgramCache]: Analyzing trace with hash -35228468, now seen corresponding path program 22 times [2024-06-04 17:24:29,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:24:29,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987133957] [2024-06-04 17:24:29,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:24:29,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:24:29,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:24:34,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:24:34,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:24:34,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987133957] [2024-06-04 17:24:34,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987133957] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:24:34,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:24:34,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:24:34,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142058034] [2024-06-04 17:24:34,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:24:34,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:24:34,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:24:34,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:24:34,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:24:34,772 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:24:34,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 194 transitions, 1684 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:24:34,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:24:34,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:24:34,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:24:35,161 INFO L124 PetriNetUnfolderBase]: 471/959 cut-off events. [2024-06-04 17:24:35,161 INFO L125 PetriNetUnfolderBase]: For 66180/66182 co-relation queries the response was YES. [2024-06-04 17:24:35,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4924 conditions, 959 events. 471/959 cut-off events. For 66180/66182 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 5532 event pairs, 87 based on Foata normal form. 4/962 useless extension candidates. Maximal degree in co-relation 4797. Up to 737 conditions per place. [2024-06-04 17:24:35,171 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 157 selfloop transitions, 50 changer transitions 0/210 dead transitions. [2024-06-04 17:24:35,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 210 transitions, 2351 flow [2024-06-04 17:24:35,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:24:35,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:24:35,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 140 transitions. [2024-06-04 17:24:35,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3977272727272727 [2024-06-04 17:24:35,173 INFO L175 Difference]: Start difference. First operand has 281 places, 194 transitions, 1684 flow. Second operand 11 states and 140 transitions. [2024-06-04 17:24:35,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 210 transitions, 2351 flow [2024-06-04 17:24:35,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 210 transitions, 2250 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-04 17:24:35,399 INFO L231 Difference]: Finished difference. Result has 285 places, 195 transitions, 1708 flow [2024-06-04 17:24:35,399 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1583, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1708, PETRI_PLACES=285, PETRI_TRANSITIONS=195} [2024-06-04 17:24:35,399 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 254 predicate places. [2024-06-04 17:24:35,399 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 195 transitions, 1708 flow [2024-06-04 17:24:35,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:24:35,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:24:35,399 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:24:35,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-06-04 17:24:35,400 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:24:35,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:24:35,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1457504874, now seen corresponding path program 23 times [2024-06-04 17:24:35,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:24:35,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551673357] [2024-06-04 17:24:35,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:24:35,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:24:35,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:24:40,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:24:40,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:24:40,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551673357] [2024-06-04 17:24:40,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551673357] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:24:40,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:24:40,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:24:40,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28902987] [2024-06-04 17:24:40,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:24:40,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:24:40,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:24:40,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:24:40,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:24:41,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:24:41,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 195 transitions, 1708 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:24:41,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:24:41,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:24:41,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:24:41,341 INFO L124 PetriNetUnfolderBase]: 475/967 cut-off events. [2024-06-04 17:24:41,341 INFO L125 PetriNetUnfolderBase]: For 67691/67693 co-relation queries the response was YES. [2024-06-04 17:24:41,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4983 conditions, 967 events. 475/967 cut-off events. For 67691/67693 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 5611 event pairs, 85 based on Foata normal form. 4/970 useless extension candidates. Maximal degree in co-relation 4855. Up to 701 conditions per place. [2024-06-04 17:24:41,351 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 156 selfloop transitions, 53 changer transitions 0/212 dead transitions. [2024-06-04 17:24:41,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 212 transitions, 2383 flow [2024-06-04 17:24:41,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:24:41,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:24:41,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2024-06-04 17:24:41,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39204545454545453 [2024-06-04 17:24:41,353 INFO L175 Difference]: Start difference. First operand has 285 places, 195 transitions, 1708 flow. Second operand 11 states and 138 transitions. [2024-06-04 17:24:41,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 212 transitions, 2383 flow [2024-06-04 17:24:41,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 212 transitions, 2230 flow, removed 9 selfloop flow, removed 10 redundant places. [2024-06-04 17:24:41,633 INFO L231 Difference]: Finished difference. Result has 286 places, 196 transitions, 1686 flow [2024-06-04 17:24:41,633 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1555, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1686, PETRI_PLACES=286, PETRI_TRANSITIONS=196} [2024-06-04 17:24:41,633 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 255 predicate places. [2024-06-04 17:24:41,634 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 196 transitions, 1686 flow [2024-06-04 17:24:41,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:24:41,634 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:24:41,634 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:24:41,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-06-04 17:24:41,634 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:24:41,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:24:41,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1664308044, now seen corresponding path program 24 times [2024-06-04 17:24:41,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:24:41,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971392813] [2024-06-04 17:24:41,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:24:41,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:24:41,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:24:47,464 INFO 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:24:47,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:24:47,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971392813] [2024-06-04 17:24:47,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971392813] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:24:47,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:24:47,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:24:47,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198063925] [2024-06-04 17:24:47,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:24:47,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:24:47,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:24:47,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:24:47,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:24:47,639 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:24:47,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 196 transitions, 1686 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:24:47,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:24:47,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:24:47,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:24:48,043 INFO L124 PetriNetUnfolderBase]: 480/978 cut-off events. [2024-06-04 17:24:48,043 INFO L125 PetriNetUnfolderBase]: For 69140/69142 co-relation queries the response was YES. [2024-06-04 17:24:48,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4979 conditions, 978 events. 480/978 cut-off events. For 69140/69142 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 5708 event pairs, 89 based on Foata normal form. 4/981 useless extension candidates. Maximal degree in co-relation 4851. Up to 778 conditions per place. [2024-06-04 17:24:48,052 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 158 selfloop transitions, 51 changer transitions 0/212 dead transitions. [2024-06-04 17:24:48,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 212 transitions, 2187 flow [2024-06-04 17:24:48,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:24:48,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:24:48,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2024-06-04 17:24:48,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2024-06-04 17:24:48,054 INFO L175 Difference]: Start difference. First operand has 286 places, 196 transitions, 1686 flow. Second operand 11 states and 136 transitions. [2024-06-04 17:24:48,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 212 transitions, 2187 flow [2024-06-04 17:24:48,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 212 transitions, 1960 flow, removed 13 selfloop flow, removed 11 redundant places. [2024-06-04 17:24:48,298 INFO L231 Difference]: Finished difference. Result has 287 places, 199 transitions, 1625 flow [2024-06-04 17:24:48,298 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1471, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1625, PETRI_PLACES=287, PETRI_TRANSITIONS=199} [2024-06-04 17:24:48,299 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 256 predicate places. [2024-06-04 17:24:48,299 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 199 transitions, 1625 flow [2024-06-04 17:24:48,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:24:48,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:24:48,299 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:24:48,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-06-04 17:24:48,299 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:24:48,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:24:48,300 INFO L85 PathProgramCache]: Analyzing trace with hash -27871238, now seen corresponding path program 25 times [2024-06-04 17:24:48,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:24:48,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150493937] [2024-06-04 17:24:48,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:24:48,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:24:48,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:24:54,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:24:54,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:24:54,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150493937] [2024-06-04 17:24:54,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150493937] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:24:54,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:24:54,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:24:54,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497012822] [2024-06-04 17:24:54,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:24:54,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:24:54,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:24:54,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:24:54,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:24:54,371 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:24:54,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 199 transitions, 1625 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:24:54,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:24:54,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:24:54,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:24:54,768 INFO L124 PetriNetUnfolderBase]: 477/973 cut-off events. [2024-06-04 17:24:54,768 INFO L125 PetriNetUnfolderBase]: For 60179/60181 co-relation queries the response was YES. [2024-06-04 17:24:54,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4524 conditions, 973 events. 477/973 cut-off events. For 60179/60181 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 5663 event pairs, 88 based on Foata normal form. 4/976 useless extension candidates. Maximal degree in co-relation 4396. Up to 773 conditions per place. [2024-06-04 17:24:54,777 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 158 selfloop transitions, 51 changer transitions 0/212 dead transitions. [2024-06-04 17:24:54,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 212 transitions, 2077 flow [2024-06-04 17:24:54,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:24:54,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:24:54,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 137 transitions. [2024-06-04 17:24:54,779 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38920454545454547 [2024-06-04 17:24:54,779 INFO L175 Difference]: Start difference. First operand has 287 places, 199 transitions, 1625 flow. Second operand 11 states and 137 transitions. [2024-06-04 17:24:54,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 212 transitions, 2077 flow [2024-06-04 17:24:55,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 212 transitions, 1945 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-04 17:24:55,013 INFO L231 Difference]: Finished difference. Result has 290 places, 199 transitions, 1599 flow [2024-06-04 17:24:55,013 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1493, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1599, PETRI_PLACES=290, PETRI_TRANSITIONS=199} [2024-06-04 17:24:55,014 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 259 predicate places. [2024-06-04 17:24:55,014 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 199 transitions, 1599 flow [2024-06-04 17:24:55,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:24:55,014 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:24:55,014 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:24:55,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-06-04 17:24:55,014 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:24:55,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:24:55,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1656956394, now seen corresponding path program 26 times [2024-06-04 17:24:55,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:24:55,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187971042] [2024-06-04 17:24:55,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:24:55,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:24:55,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:25:00,816 INFO 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:25:00,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:25:00,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187971042] [2024-06-04 17:25:00,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187971042] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:25:00,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:25:00,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:25:00,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017220958] [2024-06-04 17:25:00,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:25:00,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:25:00,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:25:00,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:25:00,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:25:00,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:25:00,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 199 transitions, 1599 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:25:00,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:25:00,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:25:00,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:25:01,285 INFO L124 PetriNetUnfolderBase]: 481/981 cut-off events. [2024-06-04 17:25:01,285 INFO L125 PetriNetUnfolderBase]: For 61148/61150 co-relation queries the response was YES. [2024-06-04 17:25:01,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4531 conditions, 981 events. 481/981 cut-off events. For 61148/61150 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5733 event pairs, 90 based on Foata normal form. 4/984 useless extension candidates. Maximal degree in co-relation 4402. Up to 781 conditions per place. [2024-06-04 17:25:01,292 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 160 selfloop transitions, 50 changer transitions 0/213 dead transitions. [2024-06-04 17:25:01,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 213 transitions, 2072 flow [2024-06-04 17:25:01,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:25:01,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:25:01,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2024-06-04 17:25:01,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2024-06-04 17:25:01,294 INFO L175 Difference]: Start difference. First operand has 290 places, 199 transitions, 1599 flow. Second operand 11 states and 136 transitions. [2024-06-04 17:25:01,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 213 transitions, 2072 flow [2024-06-04 17:25:01,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 213 transitions, 1959 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-04 17:25:01,526 INFO L231 Difference]: Finished difference. Result has 291 places, 200 transitions, 1611 flow [2024-06-04 17:25:01,526 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1486, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1611, PETRI_PLACES=291, PETRI_TRANSITIONS=200} [2024-06-04 17:25:01,526 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 260 predicate places. [2024-06-04 17:25:01,526 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 200 transitions, 1611 flow [2024-06-04 17:25:01,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:25:01,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:25:01,526 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:25:01,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-06-04 17:25:01,526 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:25:01,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:25:01,527 INFO L85 PathProgramCache]: Analyzing trace with hash 123393194, now seen corresponding path program 27 times [2024-06-04 17:25:01,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:25:01,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604473976] [2024-06-04 17:25:01,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:25:01,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:25:01,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:25:06,697 INFO 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:25:06,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:25:06,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604473976] [2024-06-04 17:25:06,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604473976] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:25:06,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:25:06,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:25:06,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776377212] [2024-06-04 17:25:06,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:25:06,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:25:06,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:25:06,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:25:06,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:25:06,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:25:06,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 200 transitions, 1611 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:25:06,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:25:06,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:25:06,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:25:07,171 INFO L124 PetriNetUnfolderBase]: 485/989 cut-off events. [2024-06-04 17:25:07,171 INFO L125 PetriNetUnfolderBase]: For 62579/62581 co-relation queries the response was YES. [2024-06-04 17:25:07,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4590 conditions, 989 events. 485/989 cut-off events. For 62579/62581 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 5786 event pairs, 88 based on Foata normal form. 4/992 useless extension candidates. Maximal degree in co-relation 4460. Up to 769 conditions per place. [2024-06-04 17:25:07,181 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 160 selfloop transitions, 52 changer transitions 0/215 dead transitions. [2024-06-04 17:25:07,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 215 transitions, 2092 flow [2024-06-04 17:25:07,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:25:07,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:25:07,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2024-06-04 17:25:07,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39204545454545453 [2024-06-04 17:25:07,182 INFO L175 Difference]: Start difference. First operand has 291 places, 200 transitions, 1611 flow. Second operand 11 states and 138 transitions. [2024-06-04 17:25:07,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 215 transitions, 2092 flow [2024-06-04 17:25:07,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 215 transitions, 1987 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-04 17:25:07,433 INFO L231 Difference]: Finished difference. Result has 295 places, 201 transitions, 1637 flow [2024-06-04 17:25:07,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1506, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1637, PETRI_PLACES=295, PETRI_TRANSITIONS=201} [2024-06-04 17:25:07,434 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 264 predicate places. [2024-06-04 17:25:07,434 INFO L495 AbstractCegarLoop]: Abstraction has has 295 places, 201 transitions, 1637 flow [2024-06-04 17:25:07,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:25:07,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:25:07,434 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:25:07,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-06-04 17:25:07,434 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:25:07,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:25:07,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1807454822, now seen corresponding path program 28 times [2024-06-04 17:25:07,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:25:07,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381951493] [2024-06-04 17:25:07,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:25:07,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:25:07,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:25:12,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:25:12,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:25:12,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381951493] [2024-06-04 17:25:12,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381951493] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:25:12,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:25:12,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:25:12,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134733593] [2024-06-04 17:25:12,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:25:12,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:25:12,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:25:12,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:25:12,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:25:13,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:25:13,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 201 transitions, 1637 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:25:13,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:25:13,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:25:13,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:25:13,405 INFO L124 PetriNetUnfolderBase]: 490/1002 cut-off events. [2024-06-04 17:25:13,405 INFO L125 PetriNetUnfolderBase]: For 63944/63946 co-relation queries the response was YES. [2024-06-04 17:25:13,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4671 conditions, 1002 events. 490/1002 cut-off events. For 63944/63946 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 5913 event pairs, 92 based on Foata normal form. 4/1005 useless extension candidates. Maximal degree in co-relation 4540. Up to 799 conditions per place. [2024-06-04 17:25:13,415 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 156 selfloop transitions, 57 changer transitions 0/216 dead transitions. [2024-06-04 17:25:13,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 216 transitions, 2130 flow [2024-06-04 17:25:13,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:25:13,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:25:13,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2024-06-04 17:25:13,416 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3778409090909091 [2024-06-04 17:25:13,416 INFO L175 Difference]: Start difference. First operand has 295 places, 201 transitions, 1637 flow. Second operand 11 states and 133 transitions. [2024-06-04 17:25:13,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 216 transitions, 2130 flow [2024-06-04 17:25:13,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 216 transitions, 2008 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-04 17:25:13,665 INFO L231 Difference]: Finished difference. Result has 297 places, 203 transitions, 1668 flow [2024-06-04 17:25:13,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1517, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1668, PETRI_PLACES=297, PETRI_TRANSITIONS=203} [2024-06-04 17:25:13,665 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 266 predicate places. [2024-06-04 17:25:13,665 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 203 transitions, 1668 flow [2024-06-04 17:25:13,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:25:13,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:25:13,666 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:25:13,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-06-04 17:25:13,666 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:25:13,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:25:13,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1807247432, now seen corresponding path program 29 times [2024-06-04 17:25:13,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:25:13,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056523975] [2024-06-04 17:25:13,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:25:13,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:25:13,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:25:18,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:25:18,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:25:18,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056523975] [2024-06-04 17:25:18,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056523975] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:25:18,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:25:18,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:25:18,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24420825] [2024-06-04 17:25:18,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:25:18,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:25:18,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:25:18,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:25:18,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:25:18,874 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:25:18,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 203 transitions, 1668 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:25:18,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:25:18,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:25:18,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:25:19,229 INFO L124 PetriNetUnfolderBase]: 494/1010 cut-off events. [2024-06-04 17:25:19,229 INFO L125 PetriNetUnfolderBase]: For 65289/65291 co-relation queries the response was YES. [2024-06-04 17:25:19,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4722 conditions, 1010 events. 494/1010 cut-off events. For 65289/65291 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 5995 event pairs, 90 based on Foata normal form. 4/1013 useless extension candidates. Maximal degree in co-relation 4590. Up to 784 conditions per place. [2024-06-04 17:25:19,239 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 157 selfloop transitions, 59 changer transitions 0/219 dead transitions. [2024-06-04 17:25:19,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 219 transitions, 2371 flow [2024-06-04 17:25:19,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:25:19,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:25:19,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2024-06-04 17:25:19,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2024-06-04 17:25:19,241 INFO L175 Difference]: Start difference. First operand has 297 places, 203 transitions, 1668 flow. Second operand 11 states and 136 transitions. [2024-06-04 17:25:19,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 219 transitions, 2371 flow [2024-06-04 17:25:19,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 219 transitions, 2208 flow, removed 13 selfloop flow, removed 10 redundant places. [2024-06-04 17:25:19,474 INFO L231 Difference]: Finished difference. Result has 298 places, 204 transitions, 1652 flow [2024-06-04 17:25:19,474 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1505, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1652, PETRI_PLACES=298, PETRI_TRANSITIONS=204} [2024-06-04 17:25:19,474 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 267 predicate places. [2024-06-04 17:25:19,474 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 204 transitions, 1652 flow [2024-06-04 17:25:19,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:25:19,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:25:19,475 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:25:19,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-06-04 17:25:19,475 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:25:19,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:25:19,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1814604662, now seen corresponding path program 30 times [2024-06-04 17:25:19,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:25:19,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142723978] [2024-06-04 17:25:19,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:25:19,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:25:19,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:25:24,852 INFO 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:25:24,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:25:24,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142723978] [2024-06-04 17:25:24,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142723978] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:25:24,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:25:24,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:25:24,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502416313] [2024-06-04 17:25:24,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:25:24,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:25:24,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:25:24,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:25:24,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:25:25,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:25:25,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 204 transitions, 1652 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:25:25,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:25:25,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:25:25,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:25:25,397 INFO L124 PetriNetUnfolderBase]: 491/1005 cut-off events. [2024-06-04 17:25:25,397 INFO L125 PetriNetUnfolderBase]: For 55332/55334 co-relation queries the response was YES. [2024-06-04 17:25:25,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4416 conditions, 1005 events. 491/1005 cut-off events. For 55332/55334 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 5951 event pairs, 91 based on Foata normal form. 4/1008 useless extension candidates. Maximal degree in co-relation 4286. Up to 802 conditions per place. [2024-06-04 17:25:25,406 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 157 selfloop transitions, 57 changer transitions 0/217 dead transitions. [2024-06-04 17:25:25,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 217 transitions, 2114 flow [2024-06-04 17:25:25,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:25:25,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:25:25,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2024-06-04 17:25:25,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835227272727273 [2024-06-04 17:25:25,408 INFO L175 Difference]: Start difference. First operand has 298 places, 204 transitions, 1652 flow. Second operand 11 states and 135 transitions. [2024-06-04 17:25:25,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 217 transitions, 2114 flow [2024-06-04 17:25:25,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 217 transitions, 1911 flow, removed 21 selfloop flow, removed 10 redundant places. [2024-06-04 17:25:25,611 INFO L231 Difference]: Finished difference. Result has 299 places, 204 transitions, 1567 flow [2024-06-04 17:25:25,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1449, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1567, PETRI_PLACES=299, PETRI_TRANSITIONS=204} [2024-06-04 17:25:25,611 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 268 predicate places. [2024-06-04 17:25:25,611 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 204 transitions, 1567 flow [2024-06-04 17:25:25,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:25:25,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:25:25,611 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:25:25,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-06-04 17:25:25,612 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:25:25,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:25:25,612 INFO L85 PathProgramCache]: Analyzing trace with hash -54353602, now seen corresponding path program 4 times [2024-06-04 17:25:25,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:25:25,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2160980] [2024-06-04 17:25:25,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:25:25,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:25:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:25:30,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:25:30,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:25:30,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2160980] [2024-06-04 17:25:30,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2160980] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:25:30,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:25:30,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:25:30,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899320998] [2024-06-04 17:25:30,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:25:30,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:25:30,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:25:30,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:25:30,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:25:30,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:25:30,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 204 transitions, 1567 flow. Second operand has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:25:30,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:25:30,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:25:30,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:25:31,268 INFO L124 PetriNetUnfolderBase]: 521/1074 cut-off events. [2024-06-04 17:25:31,268 INFO L125 PetriNetUnfolderBase]: For 118459/118463 co-relation queries the response was YES. [2024-06-04 17:25:31,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5477 conditions, 1074 events. 521/1074 cut-off events. For 118459/118463 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 6382 event pairs, 108 based on Foata normal form. 6/1078 useless extension candidates. Maximal degree in co-relation 5347. Up to 750 conditions per place. [2024-06-04 17:25:31,284 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 144 selfloop transitions, 71 changer transitions 6/224 dead transitions. [2024-06-04 17:25:31,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 224 transitions, 2357 flow [2024-06-04 17:25:31,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:25:31,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:25:31,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 153 transitions. [2024-06-04 17:25:31,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3984375 [2024-06-04 17:25:31,285 INFO L175 Difference]: Start difference. First operand has 299 places, 204 transitions, 1567 flow. Second operand 12 states and 153 transitions. [2024-06-04 17:25:31,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 224 transitions, 2357 flow [2024-06-04 17:25:31,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 224 transitions, 2144 flow, removed 3 selfloop flow, removed 13 redundant places. [2024-06-04 17:25:31,695 INFO L231 Difference]: Finished difference. Result has 298 places, 202 transitions, 1489 flow [2024-06-04 17:25:31,695 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1354, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1489, PETRI_PLACES=298, PETRI_TRANSITIONS=202} [2024-06-04 17:25:31,695 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 267 predicate places. [2024-06-04 17:25:31,695 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 202 transitions, 1489 flow [2024-06-04 17:25:31,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:25:31,696 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:25:31,696 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:25:31,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-06-04 17:25:31,696 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:25:31,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:25:31,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1664584750, now seen corresponding path program 5 times [2024-06-04 17:25:31,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:25:31,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920216252] [2024-06-04 17:25:31,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:25:31,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:25:31,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:25:36,722 INFO 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:25:36,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:25:36,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920216252] [2024-06-04 17:25:36,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920216252] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:25:36,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:25:36,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:25:36,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051015416] [2024-06-04 17:25:36,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:25:36,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:25:36,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:25:36,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:25:36,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:25:36,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:25:36,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 202 transitions, 1489 flow. Second operand has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:25:36,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:25:36,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:25:36,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:25:37,419 INFO L124 PetriNetUnfolderBase]: 537/1110 cut-off events. [2024-06-04 17:25:37,419 INFO L125 PetriNetUnfolderBase]: For 164190/164194 co-relation queries the response was YES. [2024-06-04 17:25:37,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6456 conditions, 1110 events. 537/1110 cut-off events. For 164190/164194 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 6655 event pairs, 120 based on Foata normal form. 6/1114 useless extension candidates. Maximal degree in co-relation 6327. Up to 786 conditions per place. [2024-06-04 17:25:37,429 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 149 selfloop transitions, 64 changer transitions 6/222 dead transitions. [2024-06-04 17:25:37,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 222 transitions, 2277 flow [2024-06-04 17:25:37,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:25:37,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:25:37,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 154 transitions. [2024-06-04 17:25:37,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4010416666666667 [2024-06-04 17:25:37,429 INFO L175 Difference]: Start difference. First operand has 298 places, 202 transitions, 1489 flow. Second operand 12 states and 154 transitions. [2024-06-04 17:25:37,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 222 transitions, 2277 flow [2024-06-04 17:25:38,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 222 transitions, 2129 flow, removed 4 selfloop flow, removed 11 redundant places. [2024-06-04 17:25:38,041 INFO L231 Difference]: Finished difference. Result has 297 places, 200 transitions, 1466 flow [2024-06-04 17:25:38,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1345, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1466, PETRI_PLACES=297, PETRI_TRANSITIONS=200} [2024-06-04 17:25:38,041 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 266 predicate places. [2024-06-04 17:25:38,041 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 200 transitions, 1466 flow [2024-06-04 17:25:38,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:25:38,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:25:38,041 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:25:38,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2024-06-04 17:25:38,041 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:25:38,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:25:38,042 INFO L85 PathProgramCache]: Analyzing trace with hash 131017830, now seen corresponding path program 6 times [2024-06-04 17:25:38,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:25:38,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038420136] [2024-06-04 17:25:38,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:25:38,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:25:38,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:25:44,142 INFO 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:25:44,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:25:44,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038420136] [2024-06-04 17:25:44,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038420136] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:25:44,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:25:44,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:25:44,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916636614] [2024-06-04 17:25:44,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:25:44,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:25:44,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:25:44,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:25:44,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:25:44,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:25:44,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 200 transitions, 1466 flow. Second operand has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:25:44,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:25:44,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:25:44,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:25:44,731 INFO L124 PetriNetUnfolderBase]: 513/1054 cut-off events. [2024-06-04 17:25:44,731 INFO L125 PetriNetUnfolderBase]: For 131643/131647 co-relation queries the response was YES. [2024-06-04 17:25:44,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5333 conditions, 1054 events. 513/1054 cut-off events. For 131643/131647 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 6259 event pairs, 110 based on Foata normal form. 8/1060 useless extension candidates. Maximal degree in co-relation 5205. Up to 786 conditions per place. [2024-06-04 17:25:44,741 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 141 selfloop transitions, 61 changer transitions 11/216 dead transitions. [2024-06-04 17:25:44,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 216 transitions, 1984 flow [2024-06-04 17:25:44,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:25:44,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:25:44,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 149 transitions. [2024-06-04 17:25:44,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3880208333333333 [2024-06-04 17:25:44,741 INFO L175 Difference]: Start difference. First operand has 297 places, 200 transitions, 1466 flow. Second operand 12 states and 149 transitions. [2024-06-04 17:25:44,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 216 transitions, 1984 flow [2024-06-04 17:25:45,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 216 transitions, 1854 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-06-04 17:25:45,078 INFO L231 Difference]: Finished difference. Result has 296 places, 196 transitions, 1436 flow [2024-06-04 17:25:45,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1336, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1436, PETRI_PLACES=296, PETRI_TRANSITIONS=196} [2024-06-04 17:25:45,079 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 265 predicate places. [2024-06-04 17:25:45,079 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 196 transitions, 1436 flow [2024-06-04 17:25:45,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:25:45,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:25:45,079 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:25:45,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2024-06-04 17:25:45,079 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:25:45,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:25:45,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1814872068, now seen corresponding path program 7 times [2024-06-04 17:25:45,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:25:45,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506466445] [2024-06-04 17:25:45,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:25:45,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:25:45,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:25:50,746 INFO 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:25:50,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:25:50,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506466445] [2024-06-04 17:25:50,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506466445] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:25:50,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:25:50,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:25:50,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168938497] [2024-06-04 17:25:50,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:25:50,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:25:50,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:25:50,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:25:50,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:25:50,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:25:50,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 196 transitions, 1436 flow. Second operand has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:25:50,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:25:50,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:25:50,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:25:51,352 INFO L124 PetriNetUnfolderBase]: 485/1000 cut-off events. [2024-06-04 17:25:51,352 INFO L125 PetriNetUnfolderBase]: For 87228/87232 co-relation queries the response was YES. [2024-06-04 17:25:51,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4178 conditions, 1000 events. 485/1000 cut-off events. For 87228/87232 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 5895 event pairs, 100 based on Foata normal form. 8/1006 useless extension candidates. Maximal degree in co-relation 4051. Up to 730 conditions per place. [2024-06-04 17:25:51,361 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 131 selfloop transitions, 67 changer transitions 11/212 dead transitions. [2024-06-04 17:25:51,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 212 transitions, 1946 flow [2024-06-04 17:25:51,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:25:51,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:25:51,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 148 transitions. [2024-06-04 17:25:51,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2024-06-04 17:25:51,362 INFO L175 Difference]: Start difference. First operand has 296 places, 196 transitions, 1436 flow. Second operand 12 states and 148 transitions. [2024-06-04 17:25:51,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 212 transitions, 1946 flow [2024-06-04 17:25:51,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 212 transitions, 1802 flow, removed 11 selfloop flow, removed 11 redundant places. [2024-06-04 17:25:51,630 INFO L231 Difference]: Finished difference. Result has 291 places, 192 transitions, 1412 flow [2024-06-04 17:25:51,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1300, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1412, PETRI_PLACES=291, PETRI_TRANSITIONS=192} [2024-06-04 17:25:51,631 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 260 predicate places. [2024-06-04 17:25:51,631 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 192 transitions, 1412 flow [2024-06-04 17:25:51,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:25:51,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:25:51,631 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:25:51,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2024-06-04 17:25:51,631 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:25:51,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:25:51,632 INFO L85 PathProgramCache]: Analyzing trace with hash -27594532, now seen corresponding path program 8 times [2024-06-04 17:25:51,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:25:51,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901929021] [2024-06-04 17:25:51,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:25:51,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:25:51,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:25:56,504 INFO 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:25:56,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:25:56,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901929021] [2024-06-04 17:25:56,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901929021] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:25:56,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:25:56,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:25:56,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388594906] [2024-06-04 17:25:56,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:25:56,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:25:56,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:25:56,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:25:56,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:25:56,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:25:56,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 192 transitions, 1412 flow. Second operand has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:25:56,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:25:56,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:25:56,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:25:57,045 INFO L124 PetriNetUnfolderBase]: 497/1030 cut-off events. [2024-06-04 17:25:57,045 INFO L125 PetriNetUnfolderBase]: For 112257/112261 co-relation queries the response was YES. [2024-06-04 17:25:57,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5108 conditions, 1030 events. 497/1030 cut-off events. For 112257/112261 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 6067 event pairs, 108 based on Foata normal form. 6/1034 useless extension candidates. Maximal degree in co-relation 4983. Up to 710 conditions per place. [2024-06-04 17:25:57,053 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 143 selfloop transitions, 60 changer transitions 6/212 dead transitions. [2024-06-04 17:25:57,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 212 transitions, 2160 flow [2024-06-04 17:25:57,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:25:57,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:25:57,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 155 transitions. [2024-06-04 17:25:57,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4036458333333333 [2024-06-04 17:25:57,054 INFO L175 Difference]: Start difference. First operand has 291 places, 192 transitions, 1412 flow. Second operand 12 states and 155 transitions. [2024-06-04 17:25:57,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 212 transitions, 2160 flow [2024-06-04 17:25:57,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 212 transitions, 1994 flow, removed 16 selfloop flow, removed 11 redundant places. [2024-06-04 17:25:57,410 INFO L231 Difference]: Finished difference. Result has 286 places, 190 transitions, 1377 flow [2024-06-04 17:25:57,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1264, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1377, PETRI_PLACES=286, PETRI_TRANSITIONS=190} [2024-06-04 17:25:57,411 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 255 predicate places. [2024-06-04 17:25:57,411 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 190 transitions, 1377 flow [2024-06-04 17:25:57,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:25:57,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:25:57,411 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:25:57,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2024-06-04 17:25:57,411 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:25:57,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:25:57,412 INFO L85 PathProgramCache]: Analyzing trace with hash 2063042746, now seen corresponding path program 9 times [2024-06-04 17:25:57,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:25:57,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188551663] [2024-06-04 17:25:57,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:25:57,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:25:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:26:03,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:26:03,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:26:03,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188551663] [2024-06-04 17:26:03,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188551663] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:26:03,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:26:03,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:26:03,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936694890] [2024-06-04 17:26:03,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:26:03,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:26:03,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:26:03,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:26:03,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:26:03,998 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:26:03,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 190 transitions, 1377 flow. Second operand has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:26:03,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:26:03,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:26:03,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:26:04,381 INFO L124 PetriNetUnfolderBase]: 513/1061 cut-off events. [2024-06-04 17:26:04,381 INFO L125 PetriNetUnfolderBase]: For 147572/147574 co-relation queries the response was YES. [2024-06-04 17:26:04,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5991 conditions, 1061 events. 513/1061 cut-off events. For 147572/147574 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 6274 event pairs, 114 based on Foata normal form. 6/1066 useless extension candidates. Maximal degree in co-relation 5868. Up to 908 conditions per place. [2024-06-04 17:26:04,390 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 186 selfloop transitions, 15 changer transitions 6/210 dead transitions. [2024-06-04 17:26:04,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 210 transitions, 2105 flow [2024-06-04 17:26:04,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:26:04,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:26:04,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 140 transitions. [2024-06-04 17:26:04,393 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3645833333333333 [2024-06-04 17:26:04,393 INFO L175 Difference]: Start difference. First operand has 286 places, 190 transitions, 1377 flow. Second operand 12 states and 140 transitions. [2024-06-04 17:26:04,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 210 transitions, 2105 flow [2024-06-04 17:26:04,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 210 transitions, 1979 flow, removed 4 selfloop flow, removed 11 redundant places. [2024-06-04 17:26:04,938 INFO L231 Difference]: Finished difference. Result has 285 places, 188 transitions, 1278 flow [2024-06-04 17:26:04,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1255, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1278, PETRI_PLACES=285, PETRI_TRANSITIONS=188} [2024-06-04 17:26:04,938 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 254 predicate places. [2024-06-04 17:26:04,938 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 188 transitions, 1278 flow [2024-06-04 17:26:04,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:26:04,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:26:04,939 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:26:04,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2024-06-04 17:26:04,939 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:26:04,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:26:04,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1071153156, now seen corresponding path program 10 times [2024-06-04 17:26:04,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:26:04,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648196654] [2024-06-04 17:26:04,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:26:04,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:26:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:26:10,716 INFO 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:26:10,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:26:10,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648196654] [2024-06-04 17:26:10,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648196654] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:26:10,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:26:10,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:26:10,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743520197] [2024-06-04 17:26:10,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:26:10,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:26:10,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:26:10,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:26:10,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:26:10,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:26:10,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 188 transitions, 1278 flow. Second operand has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:26:10,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:26:10,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:26:10,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:26:11,371 INFO L124 PetriNetUnfolderBase]: 489/1010 cut-off events. [2024-06-04 17:26:11,371 INFO L125 PetriNetUnfolderBase]: For 117580/117584 co-relation queries the response was YES. [2024-06-04 17:26:11,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4875 conditions, 1010 events. 489/1010 cut-off events. For 117580/117584 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 5954 event pairs, 110 based on Foata normal form. 8/1016 useless extension candidates. Maximal degree in co-relation 4753. Up to 746 conditions per place. [2024-06-04 17:26:11,380 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 133 selfloop transitions, 57 changer transitions 11/204 dead transitions. [2024-06-04 17:26:11,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 204 transitions, 1756 flow [2024-06-04 17:26:11,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:26:11,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:26:11,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 150 transitions. [2024-06-04 17:26:11,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-04 17:26:11,381 INFO L175 Difference]: Start difference. First operand has 285 places, 188 transitions, 1278 flow. Second operand 12 states and 150 transitions. [2024-06-04 17:26:11,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 204 transitions, 1756 flow [2024-06-04 17:26:11,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 204 transitions, 1724 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-06-04 17:26:11,665 INFO L231 Difference]: Finished difference. Result has 284 places, 184 transitions, 1338 flow [2024-06-04 17:26:11,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1246, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1338, PETRI_PLACES=284, PETRI_TRANSITIONS=184} [2024-06-04 17:26:11,665 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 253 predicate places. [2024-06-04 17:26:11,665 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 184 transitions, 1338 flow [2024-06-04 17:26:11,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:26:11,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:26:11,665 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:26:11,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2024-06-04 17:26:11,665 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:26:11,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:26:11,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1918234620, now seen corresponding path program 11 times [2024-06-04 17:26:11,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:26:11,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064071485] [2024-06-04 17:26:11,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:26:11,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:26:11,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:26:17,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:26:17,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:26:17,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064071485] [2024-06-04 17:26:17,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064071485] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:26:17,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:26:17,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:26:17,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365240736] [2024-06-04 17:26:17,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:26:17,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:26:17,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:26:17,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:26:17,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:26:17,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:26:17,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 184 transitions, 1338 flow. Second operand has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:26:17,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:26:17,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:26:17,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:26:18,367 INFO L124 PetriNetUnfolderBase]: 483/1001 cut-off events. [2024-06-04 17:26:18,367 INFO L125 PetriNetUnfolderBase]: For 115331/115333 co-relation queries the response was YES. [2024-06-04 17:26:18,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4911 conditions, 1001 events. 483/1001 cut-off events. For 115331/115333 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5872 event pairs, 108 based on Foata normal form. 8/1008 useless extension candidates. Maximal degree in co-relation 4790. Up to 889 conditions per place. [2024-06-04 17:26:18,376 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 171 selfloop transitions, 18 changer transitions 9/201 dead transitions. [2024-06-04 17:26:18,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 201 transitions, 1812 flow [2024-06-04 17:26:18,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-04 17:26:18,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-04 17:26:18,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 148 transitions. [2024-06-04 17:26:18,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3557692307692308 [2024-06-04 17:26:18,377 INFO L175 Difference]: Start difference. First operand has 284 places, 184 transitions, 1338 flow. Second operand 13 states and 148 transitions. [2024-06-04 17:26:18,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 201 transitions, 1812 flow [2024-06-04 17:26:18,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 201 transitions, 1676 flow, removed 11 selfloop flow, removed 11 redundant places. [2024-06-04 17:26:18,689 INFO L231 Difference]: Finished difference. Result has 280 places, 181 transitions, 1231 flow [2024-06-04 17:26:18,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1210, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1231, PETRI_PLACES=280, PETRI_TRANSITIONS=181} [2024-06-04 17:26:18,689 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 249 predicate places. [2024-06-04 17:26:18,689 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 181 transitions, 1231 flow [2024-06-04 17:26:18,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:26:18,689 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:26:18,689 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:26:18,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2024-06-04 17:26:18,689 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:26:18,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:26:18,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1918225320, now seen corresponding path program 12 times [2024-06-04 17:26:18,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:26:18,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841130885] [2024-06-04 17:26:18,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:26:18,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:26:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:26:24,642 INFO 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:26:24,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:26:24,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841130885] [2024-06-04 17:26:24,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841130885] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:26:24,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:26:24,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:26:24,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341812387] [2024-06-04 17:26:24,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:26:24,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:26:24,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:26:24,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:26:24,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:26:24,812 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:26:24,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 181 transitions, 1231 flow. Second operand has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:26:24,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:26:24,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:26:24,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:26:25,171 INFO L124 PetriNetUnfolderBase]: 474/988 cut-off events. [2024-06-04 17:26:25,171 INFO L125 PetriNetUnfolderBase]: For 100443/100445 co-relation queries the response was YES. [2024-06-04 17:26:25,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4677 conditions, 988 events. 474/988 cut-off events. For 100443/100445 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 5792 event pairs, 104 based on Foata normal form. 6/993 useless extension candidates. Maximal degree in co-relation 4558. Up to 879 conditions per place. [2024-06-04 17:26:25,180 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 169 selfloop transitions, 16 changer transitions 10/198 dead transitions. [2024-06-04 17:26:25,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 198 transitions, 1683 flow [2024-06-04 17:26:25,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-04 17:26:25,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-04 17:26:25,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 146 transitions. [2024-06-04 17:26:25,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35096153846153844 [2024-06-04 17:26:25,181 INFO L175 Difference]: Start difference. First operand has 280 places, 181 transitions, 1231 flow. Second operand 13 states and 146 transitions. [2024-06-04 17:26:25,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 198 transitions, 1683 flow [2024-06-04 17:26:25,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 198 transitions, 1639 flow, removed 1 selfloop flow, removed 13 redundant places. [2024-06-04 17:26:25,460 INFO L231 Difference]: Finished difference. Result has 278 places, 178 transitions, 1207 flow [2024-06-04 17:26:25,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1187, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1207, PETRI_PLACES=278, PETRI_TRANSITIONS=178} [2024-06-04 17:26:25,461 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 247 predicate places. [2024-06-04 17:26:25,461 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 178 transitions, 1207 flow [2024-06-04 17:26:25,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:26:25,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:26:25,461 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:26:25,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2024-06-04 17:26:25,461 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:26:25,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:26:25,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1907183430, now seen corresponding path program 13 times [2024-06-04 17:26:25,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:26:25,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102139999] [2024-06-04 17:26:25,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:26:25,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:26:25,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:26:31,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:26:31,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:26:31,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102139999] [2024-06-04 17:26:31,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102139999] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:26:31,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:26:31,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:26:31,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082065189] [2024-06-04 17:26:31,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:26:31,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:26:31,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:26:31,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:26:31,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:26:31,567 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:26:31,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 178 transitions, 1207 flow. Second operand has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:26:31,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:26:31,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:26:31,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:26:31,932 INFO L124 PetriNetUnfolderBase]: 460/958 cut-off events. [2024-06-04 17:26:31,933 INFO L125 PetriNetUnfolderBase]: For 90815/90817 co-relation queries the response was YES. [2024-06-04 17:26:31,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4334 conditions, 958 events. 460/958 cut-off events. For 90815/90817 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 5519 event pairs, 99 based on Foata normal form. 6/963 useless extension candidates. Maximal degree in co-relation 4216. Up to 798 conditions per place. [2024-06-04 17:26:31,940 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 172 selfloop transitions, 14 changer transitions 10/199 dead transitions. [2024-06-04 17:26:31,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 199 transitions, 1871 flow [2024-06-04 17:26:31,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-04 17:26:31,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-04 17:26:31,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 149 transitions. [2024-06-04 17:26:31,941 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3581730769230769 [2024-06-04 17:26:31,941 INFO L175 Difference]: Start difference. First operand has 278 places, 178 transitions, 1207 flow. Second operand 13 states and 149 transitions. [2024-06-04 17:26:31,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 199 transitions, 1871 flow [2024-06-04 17:26:32,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 199 transitions, 1823 flow, removed 8 selfloop flow, removed 12 redundant places. [2024-06-04 17:26:32,167 INFO L231 Difference]: Finished difference. Result has 274 places, 174 transitions, 1177 flow [2024-06-04 17:26:32,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1167, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1177, PETRI_PLACES=274, PETRI_TRANSITIONS=174} [2024-06-04 17:26:32,168 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 243 predicate places. [2024-06-04 17:26:32,168 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 174 transitions, 1177 flow [2024-06-04 17:26:32,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:26:32,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:26:32,168 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:26:32,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2024-06-04 17:26:32,168 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:26:32,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:26:32,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1338569852, now seen corresponding path program 14 times [2024-06-04 17:26:32,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:26:32,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240268495] [2024-06-04 17:26:32,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:26:32,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:26:32,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:26:37,518 INFO 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:26:37,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:26:37,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240268495] [2024-06-04 17:26:37,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240268495] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:26:37,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:26:37,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:26:37,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394475623] [2024-06-04 17:26:37,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:26:37,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:26:37,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:26:37,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:26:37,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:26:37,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:26:37,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 174 transitions, 1177 flow. Second operand has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:26:37,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:26:37,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:26:37,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:26:38,081 INFO L124 PetriNetUnfolderBase]: 431/895 cut-off events. [2024-06-04 17:26:38,081 INFO L125 PetriNetUnfolderBase]: For 61707/61709 co-relation queries the response was YES. [2024-06-04 17:26:38,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3310 conditions, 895 events. 431/895 cut-off events. For 61707/61709 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 5126 event pairs, 91 based on Foata normal form. 8/902 useless extension candidates. Maximal degree in co-relation 3194. Up to 798 conditions per place. [2024-06-04 17:26:38,088 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 162 selfloop transitions, 9 changer transitions 15/189 dead transitions. [2024-06-04 17:26:38,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 189 transitions, 1589 flow [2024-06-04 17:26:38,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:26:38,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:26:38,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 133 transitions. [2024-06-04 17:26:38,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3463541666666667 [2024-06-04 17:26:38,092 INFO L175 Difference]: Start difference. First operand has 274 places, 174 transitions, 1177 flow. Second operand 12 states and 133 transitions. [2024-06-04 17:26:38,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 189 transitions, 1589 flow [2024-06-04 17:26:38,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 189 transitions, 1549 flow, removed 7 selfloop flow, removed 13 redundant places. [2024-06-04 17:26:38,202 INFO L231 Difference]: Finished difference. Result has 268 places, 167 transitions, 1099 flow [2024-06-04 17:26:38,202 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1139, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1099, PETRI_PLACES=268, PETRI_TRANSITIONS=167} [2024-06-04 17:26:38,202 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 237 predicate places. [2024-06-04 17:26:38,203 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 167 transitions, 1099 flow [2024-06-04 17:26:38,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:26:38,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:26:38,203 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:26:38,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2024-06-04 17:26:38,203 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:26:38,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:26:38,204 INFO L85 PathProgramCache]: Analyzing trace with hash -792280329, now seen corresponding path program 1 times [2024-06-04 17:26:38,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:26:38,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865226790] [2024-06-04 17:26:38,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:26:38,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:26:38,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:26:44,089 INFO 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:26:44,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:26:44,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865226790] [2024-06-04 17:26:44,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865226790] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:26:44,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:26:44,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:26:44,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256354902] [2024-06-04 17:26:44,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:26:44,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:26:44,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:26:44,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:26:44,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:26:44,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:26:44,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 167 transitions, 1099 flow. Second operand has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:26:44,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:26:44,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:26:44,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:26:44,666 INFO L124 PetriNetUnfolderBase]: 419/870 cut-off events. [2024-06-04 17:26:44,666 INFO L125 PetriNetUnfolderBase]: For 50698/50698 co-relation queries the response was YES. [2024-06-04 17:26:44,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3146 conditions, 870 events. 419/870 cut-off events. For 50698/50698 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4919 event pairs, 75 based on Foata normal form. 6/875 useless extension candidates. Maximal degree in co-relation 3033. Up to 720 conditions per place. [2024-06-04 17:26:44,673 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 153 selfloop transitions, 11 changer transitions 25/192 dead transitions. [2024-06-04 17:26:44,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 192 transitions, 1543 flow [2024-06-04 17:26:44,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:26:44,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:26:44,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 141 transitions. [2024-06-04 17:26:44,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3671875 [2024-06-04 17:26:44,674 INFO L175 Difference]: Start difference. First operand has 268 places, 167 transitions, 1099 flow. Second operand 12 states and 141 transitions. [2024-06-04 17:26:44,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 192 transitions, 1543 flow [2024-06-04 17:26:44,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 192 transitions, 1487 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-04 17:26:44,798 INFO L231 Difference]: Finished difference. Result has 259 places, 159 transitions, 1026 flow [2024-06-04 17:26:44,798 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1045, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1026, PETRI_PLACES=259, PETRI_TRANSITIONS=159} [2024-06-04 17:26:44,798 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 228 predicate places. [2024-06-04 17:26:44,798 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 159 transitions, 1026 flow [2024-06-04 17:26:44,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:26:44,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:26:44,799 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:26:44,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2024-06-04 17:26:44,799 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:26:44,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:26:44,799 INFO L85 PathProgramCache]: Analyzing trace with hash -689188207, now seen corresponding path program 2 times [2024-06-04 17:26:44,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:26:44,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580456817] [2024-06-04 17:26:44,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:26:44,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:26:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:26:50,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:26:50,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:26:50,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580456817] [2024-06-04 17:26:50,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580456817] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:26:50,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:26:50,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:26:50,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738870718] [2024-06-04 17:26:50,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:26:50,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:26:50,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:26:50,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:26:50,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:26:51,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:26:51,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 159 transitions, 1026 flow. Second operand has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:26:51,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:26:51,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:26:51,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:26:51,627 INFO L124 PetriNetUnfolderBase]: 385/810 cut-off events. [2024-06-04 17:26:51,627 INFO L125 PetriNetUnfolderBase]: For 48918/48918 co-relation queries the response was YES. [2024-06-04 17:26:51,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2895 conditions, 810 events. 385/810 cut-off events. For 48918/48918 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4564 event pairs, 69 based on Foata normal form. 6/815 useless extension candidates. Maximal degree in co-relation 2785. Up to 650 conditions per place. [2024-06-04 17:26:51,633 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 144 selfloop transitions, 19 changer transitions 13/179 dead transitions. [2024-06-04 17:26:51,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 179 transitions, 1428 flow [2024-06-04 17:26:51,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:26:51,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:26:51,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 140 transitions. [2024-06-04 17:26:51,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3645833333333333 [2024-06-04 17:26:51,634 INFO L175 Difference]: Start difference. First operand has 259 places, 159 transitions, 1026 flow. Second operand 12 states and 140 transitions. [2024-06-04 17:26:51,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 179 transitions, 1428 flow [2024-06-04 17:26:51,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 179 transitions, 1394 flow, removed 6 selfloop flow, removed 11 redundant places. [2024-06-04 17:26:51,722 INFO L231 Difference]: Finished difference. Result has 249 places, 154 transitions, 1005 flow [2024-06-04 17:26:51,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=992, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1005, PETRI_PLACES=249, PETRI_TRANSITIONS=154} [2024-06-04 17:26:51,723 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 218 predicate places. [2024-06-04 17:26:51,723 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 154 transitions, 1005 flow [2024-06-04 17:26:51,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:26:51,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:26:51,723 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:26:51,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2024-06-04 17:26:51,723 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:26:51,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:26:51,724 INFO L85 PathProgramCache]: Analyzing trace with hash 841286391, now seen corresponding path program 3 times [2024-06-04 17:26:51,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:26:51,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305266605] [2024-06-04 17:26:51,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:26:51,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:26:51,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:26:57,800 INFO 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:26:57,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:26:57,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305266605] [2024-06-04 17:26:57,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305266605] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:26:57,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:26:57,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:26:57,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794873151] [2024-06-04 17:26:57,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:26:57,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:26:57,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:26:57,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:26:57,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:26:58,030 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:26:58,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 154 transitions, 1005 flow. Second operand has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:26:58,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:26:58,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:26:58,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:26:58,357 INFO L124 PetriNetUnfolderBase]: 369/782 cut-off events. [2024-06-04 17:26:58,357 INFO L125 PetriNetUnfolderBase]: For 43586/43586 co-relation queries the response was YES. [2024-06-04 17:26:58,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2800 conditions, 782 events. 369/782 cut-off events. For 43586/43586 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4369 event pairs, 69 based on Foata normal form. 6/787 useless extension candidates. Maximal degree in co-relation 2695. Up to 646 conditions per place. [2024-06-04 17:26:58,362 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 142 selfloop transitions, 19 changer transitions 9/173 dead transitions. [2024-06-04 17:26:58,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 173 transitions, 1393 flow [2024-06-04 17:26:58,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:26:58,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:26:58,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 137 transitions. [2024-06-04 17:26:58,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3567708333333333 [2024-06-04 17:26:58,363 INFO L175 Difference]: Start difference. First operand has 249 places, 154 transitions, 1005 flow. Second operand 12 states and 137 transitions. [2024-06-04 17:26:58,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 173 transitions, 1393 flow [2024-06-04 17:26:58,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 173 transitions, 1347 flow, removed 4 selfloop flow, removed 12 redundant places. [2024-06-04 17:26:58,427 INFO L231 Difference]: Finished difference. Result has 243 places, 151 transitions, 986 flow [2024-06-04 17:26:58,427 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=959, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=986, PETRI_PLACES=243, PETRI_TRANSITIONS=151} [2024-06-04 17:26:58,427 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 212 predicate places. [2024-06-04 17:26:58,427 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 151 transitions, 986 flow [2024-06-04 17:26:58,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:26:58,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:26:58,427 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:26:58,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2024-06-04 17:26:58,428 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:26:58,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:26:58,428 INFO L85 PathProgramCache]: Analyzing trace with hash -800010727, now seen corresponding path program 4 times [2024-06-04 17:26:58,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:26:58,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916148717] [2024-06-04 17:26:58,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:26:58,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:26:58,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:27:03,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:27:03,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:27:03,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916148717] [2024-06-04 17:27:03,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916148717] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:27:03,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:27:03,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:27:03,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353817909] [2024-06-04 17:27:03,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:27:03,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:27:03,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:27:03,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:27:03,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:27:04,123 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:27:04,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 151 transitions, 986 flow. Second operand has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:27:04,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:27:04,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:27:04,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:27:04,466 INFO L124 PetriNetUnfolderBase]: 359/764 cut-off events. [2024-06-04 17:27:04,466 INFO L125 PetriNetUnfolderBase]: For 40576/40576 co-relation queries the response was YES. [2024-06-04 17:27:04,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2729 conditions, 764 events. 359/764 cut-off events. For 40576/40576 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4262 event pairs, 54 based on Foata normal form. 6/769 useless extension candidates. Maximal degree in co-relation 2627. Up to 610 conditions per place. [2024-06-04 17:27:04,471 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 140 selfloop transitions, 13 changer transitions 16/172 dead transitions. [2024-06-04 17:27:04,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 172 transitions, 1376 flow [2024-06-04 17:27:04,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:27:04,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:27:04,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 140 transitions. [2024-06-04 17:27:04,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3645833333333333 [2024-06-04 17:27:04,472 INFO L175 Difference]: Start difference. First operand has 243 places, 151 transitions, 986 flow. Second operand 12 states and 140 transitions. [2024-06-04 17:27:04,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 172 transitions, 1376 flow [2024-06-04 17:27:04,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 172 transitions, 1332 flow, removed 3 selfloop flow, removed 12 redundant places. [2024-06-04 17:27:04,541 INFO L231 Difference]: Finished difference. Result has 239 places, 145 transitions, 939 flow [2024-06-04 17:27:04,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=942, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=939, PETRI_PLACES=239, PETRI_TRANSITIONS=145} [2024-06-04 17:27:04,541 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 208 predicate places. [2024-06-04 17:27:04,541 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 145 transitions, 939 flow [2024-06-04 17:27:04,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:27:04,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:27:04,541 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:27:04,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2024-06-04 17:27:04,541 INFO L420 AbstractCegarLoop]: === Iteration 132 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:27:04,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:27:04,542 INFO L85 PathProgramCache]: Analyzing trace with hash 847715481, now seen corresponding path program 5 times [2024-06-04 17:27:04,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:27:04,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115216806] [2024-06-04 17:27:04,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:27:04,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:27:04,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:27:10,554 INFO 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:27:10,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:27:10,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115216806] [2024-06-04 17:27:10,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115216806] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:27:10,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:27:10,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:27:10,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058558671] [2024-06-04 17:27:10,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:27:10,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:27:10,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:27:10,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:27:10,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:27:10,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:27:10,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 145 transitions, 939 flow. Second operand has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:27:10,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:27:10,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:27:10,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:27:11,008 INFO L124 PetriNetUnfolderBase]: 339/728 cut-off events. [2024-06-04 17:27:11,008 INFO L125 PetriNetUnfolderBase]: For 38626/38626 co-relation queries the response was YES. [2024-06-04 17:27:11,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2603 conditions, 728 events. 339/728 cut-off events. For 38626/38626 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4007 event pairs, 63 based on Foata normal form. 6/733 useless extension candidates. Maximal degree in co-relation 2503. Up to 606 conditions per place. [2024-06-04 17:27:11,014 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 128 selfloop transitions, 6 changer transitions 26/163 dead transitions. [2024-06-04 17:27:11,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 163 transitions, 1305 flow [2024-06-04 17:27:11,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:27:11,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:27:11,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 133 transitions. [2024-06-04 17:27:11,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3463541666666667 [2024-06-04 17:27:11,015 INFO L175 Difference]: Start difference. First operand has 239 places, 145 transitions, 939 flow. Second operand 12 states and 133 transitions. [2024-06-04 17:27:11,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 163 transitions, 1305 flow [2024-06-04 17:27:11,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 163 transitions, 1269 flow, removed 5 selfloop flow, removed 12 redundant places. [2024-06-04 17:27:11,088 INFO L231 Difference]: Finished difference. Result has 231 places, 133 transitions, 841 flow [2024-06-04 17:27:11,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=903, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=841, PETRI_PLACES=231, PETRI_TRANSITIONS=133} [2024-06-04 17:27:11,088 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 200 predicate places. [2024-06-04 17:27:11,088 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 133 transitions, 841 flow [2024-06-04 17:27:11,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:27:11,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:27:11,089 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:27:11,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2024-06-04 17:27:11,089 INFO L420 AbstractCegarLoop]: === Iteration 133 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:27:11,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:27:11,089 INFO L85 PathProgramCache]: Analyzing trace with hash 147065877, now seen corresponding path program 6 times [2024-06-04 17:27:11,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:27:11,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925215362] [2024-06-04 17:27:11,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:27:11,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:27:11,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:27:16,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:27:16,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:27:16,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925215362] [2024-06-04 17:27:16,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925215362] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:27:16,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:27:16,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:27:16,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957485609] [2024-06-04 17:27:16,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:27:16,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:27:16,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:27:16,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:27:16,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:27:17,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:27:17,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 133 transitions, 841 flow. Second operand has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:27:17,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:27:17,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:27:17,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:27:17,367 INFO L124 PetriNetUnfolderBase]: 318/671 cut-off events. [2024-06-04 17:27:17,368 INFO L125 PetriNetUnfolderBase]: For 34843/34847 co-relation queries the response was YES. [2024-06-04 17:27:17,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2375 conditions, 671 events. 318/671 cut-off events. For 34843/34847 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3617 event pairs, 61 based on Foata normal form. 10/680 useless extension candidates. Maximal degree in co-relation 2292. Up to 559 conditions per place. [2024-06-04 17:27:17,372 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 117 selfloop transitions, 15 changer transitions 14/149 dead transitions. [2024-06-04 17:27:17,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 149 transitions, 1169 flow [2024-06-04 17:27:17,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:27:17,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:27:17,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 135 transitions. [2024-06-04 17:27:17,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3515625 [2024-06-04 17:27:17,373 INFO L175 Difference]: Start difference. First operand has 231 places, 133 transitions, 841 flow. Second operand 12 states and 135 transitions. [2024-06-04 17:27:17,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 149 transitions, 1169 flow [2024-06-04 17:27:17,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 149 transitions, 1138 flow, removed 7 selfloop flow, removed 13 redundant places. [2024-06-04 17:27:17,432 INFO L231 Difference]: Finished difference. Result has 214 places, 128 transitions, 818 flow [2024-06-04 17:27:17,432 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=810, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=818, PETRI_PLACES=214, PETRI_TRANSITIONS=128} [2024-06-04 17:27:17,432 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 183 predicate places. [2024-06-04 17:27:17,433 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 128 transitions, 818 flow [2024-06-04 17:27:17,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:27:17,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:27:17,433 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:27:17,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2024-06-04 17:27:17,433 INFO L420 AbstractCegarLoop]: === Iteration 134 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:27:17,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:27:17,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1205700327, now seen corresponding path program 7 times [2024-06-04 17:27:17,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:27:17,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391787879] [2024-06-04 17:27:17,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:27:17,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:27:17,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:27:23,471 INFO 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:27:23,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:27:23,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391787879] [2024-06-04 17:27:23,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391787879] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:27:23,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:27:23,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:27:23,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488061694] [2024-06-04 17:27:23,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:27:23,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:27:23,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:27:23,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:27:23,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:27:23,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 17:27:23,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 128 transitions, 818 flow. Second operand has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:27:23,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:27:23,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 17:27:23,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:27:24,127 INFO L124 PetriNetUnfolderBase]: 306/645 cut-off events. [2024-06-04 17:27:24,127 INFO L125 PetriNetUnfolderBase]: For 29574/29574 co-relation queries the response was YES. [2024-06-04 17:27:24,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2277 conditions, 645 events. 306/645 cut-off events. For 29574/29574 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3435 event pairs, 59 based on Foata normal form. 6/650 useless extension candidates. Maximal degree in co-relation 2201. Up to 541 conditions per place. [2024-06-04 17:27:24,131 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 115 selfloop transitions, 13 changer transitions 13/144 dead transitions. [2024-06-04 17:27:24,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 144 transitions, 1136 flow [2024-06-04 17:27:24,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:27:24,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:27:24,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 123 transitions. [2024-06-04 17:27:24,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3203125 [2024-06-04 17:27:24,132 INFO L175 Difference]: Start difference. First operand has 214 places, 128 transitions, 818 flow. Second operand 12 states and 123 transitions. [2024-06-04 17:27:24,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 144 transitions, 1136 flow [2024-06-04 17:27:24,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 144 transitions, 1087 flow, removed 3 selfloop flow, removed 13 redundant places. [2024-06-04 17:27:24,182 INFO L231 Difference]: Finished difference. Result has 206 places, 124 transitions, 780 flow [2024-06-04 17:27:24,182 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=780, PETRI_PLACES=206, PETRI_TRANSITIONS=124} [2024-06-04 17:27:24,182 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 175 predicate places. [2024-06-04 17:27:24,182 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 124 transitions, 780 flow [2024-06-04 17:27:24,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:27:24,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:27:24,182 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:27:24,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2024-06-04 17:27:24,183 INFO L420 AbstractCegarLoop]: === Iteration 135 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:27:24,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:27:24,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1722366997, now seen corresponding path program 8 times [2024-06-04 17:27:24,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:27:24,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384214307] [2024-06-04 17:27:24,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:27:24,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:27:24,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:27:31,564 INFO 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:27:31,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:27:31,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384214307] [2024-06-04 17:27:31,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384214307] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:27:31,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:27:31,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 17:27:31,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419856819] [2024-06-04 17:27:31,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:27:31,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 17:27:31,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:27:31,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 17:27:31,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-06-04 17:27:31,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:27:31,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 124 transitions, 780 flow. Second operand has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:27:31,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:27:31,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:27:31,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:27:32,034 INFO L124 PetriNetUnfolderBase]: 295/624 cut-off events. [2024-06-04 17:27:32,035 INFO L125 PetriNetUnfolderBase]: For 27934/27938 co-relation queries the response was YES. [2024-06-04 17:27:32,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2191 conditions, 624 events. 295/624 cut-off events. For 27934/27938 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3295 event pairs, 57 based on Foata normal form. 10/633 useless extension candidates. Maximal degree in co-relation 2117. Up to 523 conditions per place. [2024-06-04 17:27:32,039 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 112 selfloop transitions, 12 changer transitions 13/140 dead transitions. [2024-06-04 17:27:32,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 140 transitions, 1090 flow [2024-06-04 17:27:32,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:27:32,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:27:32,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 133 transitions. [2024-06-04 17:27:32,040 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3463541666666667 [2024-06-04 17:27:32,040 INFO L175 Difference]: Start difference. First operand has 206 places, 124 transitions, 780 flow. Second operand 12 states and 133 transitions. [2024-06-04 17:27:32,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 140 transitions, 1090 flow [2024-06-04 17:27:32,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 140 transitions, 1058 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-04 17:27:32,087 INFO L231 Difference]: Finished difference. Result has 201 places, 120 transitions, 756 flow [2024-06-04 17:27:32,087 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=756, PETRI_PLACES=201, PETRI_TRANSITIONS=120} [2024-06-04 17:27:32,087 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 170 predicate places. [2024-06-04 17:27:32,088 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 120 transitions, 756 flow [2024-06-04 17:27:32,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:27:32,088 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:27:32,088 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:27:32,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2024-06-04 17:27:32,088 INFO L420 AbstractCegarLoop]: === Iteration 136 === 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:27:32,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:27:32,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1210168977, now seen corresponding path program 9 times [2024-06-04 17:27:32,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:27:32,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223049294] [2024-06-04 17:27:32,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:27:32,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:27:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15