./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi003_tso.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/rfi003_tso.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/rfi003_tso.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/rfi003_tso.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-04 16:00:36,196 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-04 16:00:36,258 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-04 16:00:36,262 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-04 16:00:36,263 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-04 16:00:36,284 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-04 16:00:36,285 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-04 16:00:36,285 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-04 16:00:36,286 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-04 16:00:36,289 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-04 16:00:36,289 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-04 16:00:36,289 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-04 16:00:36,290 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-04 16:00:36,291 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-04 16:00:36,292 INFO L153 SettingsManager]: * Use SBE=true [2024-06-04 16:00:36,292 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-04 16:00:36,292 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-04 16:00:36,292 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-04 16:00:36,292 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-04 16:00:36,293 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-04 16:00:36,293 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-04 16:00:36,293 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-04 16:00:36,293 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-04 16:00:36,294 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-04 16:00:36,294 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-04 16:00:36,294 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-04 16:00:36,294 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-04 16:00:36,294 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-04 16:00:36,295 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-04 16:00:36,295 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-04 16:00:36,296 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-04 16:00:36,296 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-04 16:00:36,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 16:00:36,296 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-04 16:00:36,296 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-04 16:00:36,297 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-04 16:00:36,297 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-04 16:00:36,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-04 16:00:36,297 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-04 16:00:36,297 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-04 16:00:36,297 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-04 16:00:36,298 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-04 16:00:36,298 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-04 16:00:36,298 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-04 16:00:36,536 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-04 16:00:36,556 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-04 16:00:36,558 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-04 16:00:36,558 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-04 16:00:36,559 INFO L274 PluginConnector]: CDTParser initialized [2024-06-04 16:00:36,560 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi003_tso.i [2024-06-04 16:00:37,568 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-04 16:00:37,777 INFO L384 CDTParser]: Found 1 translation units. [2024-06-04 16:00:37,778 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_tso.i [2024-06-04 16:00:37,791 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4b9e11cb/4b5e3fc5bfb04ce6ad395765492f97b4/FLAGd4b780bb0 [2024-06-04 16:00:37,802 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4b9e11cb/4b5e3fc5bfb04ce6ad395765492f97b4 [2024-06-04 16:00:37,804 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-04 16:00:37,816 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-04 16:00:37,817 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/rfi003_tso.yml/witness.yml [2024-06-04 16:00:37,959 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-04 16:00:37,960 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-04 16:00:37,961 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-04 16:00:37,961 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-04 16:00:37,965 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-04 16:00:37,966 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 04:00:37" (1/2) ... [2024-06-04 16:00:37,967 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@126f166e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:00:37, skipping insertion in model container [2024-06-04 16:00:37,968 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 04:00:37" (1/2) ... [2024-06-04 16:00:37,970 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@44549f13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:00:37, skipping insertion in model container [2024-06-04 16:00:37,970 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:00:37" (2/2) ... [2024-06-04 16:00:37,970 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@126f166e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:00:37, skipping insertion in model container [2024-06-04 16:00:37,970 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:00:37" (2/2) ... [2024-06-04 16:00:37,971 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-04 16:00:38,025 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-04 16:00:38,026 INFO L97 edCorrectnessWitness]: Location invariant before [L838-L838] ((((((((((((((((! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 127) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 127) && __unbuffered_p1_EBX <= 127) && x <= 1) && y <= 127) && y$mem_tmp <= 127) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (x == 0 || x == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= y && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 127) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 127) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-04 16:00:38,027 INFO L97 edCorrectnessWitness]: Location invariant before [L839-L839] ((((((((((((((((! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 127) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 127) && __unbuffered_p1_EBX <= 127) && x <= 1) && y <= 127) && y$mem_tmp <= 127) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (x == 0 || x == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= y && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 127) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 127) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-04 16:00:38,027 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-04 16:00:38,027 INFO L106 edCorrectnessWitness]: ghost_update [L836-L836] multithreaded = 1; [2024-06-04 16:00:38,067 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-04 16:00:38,427 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 16:00:38,436 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-04 16:00:38,635 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 16:00:38,677 INFO L206 MainTranslator]: Completed translation [2024-06-04 16:00:38,678 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:00:38 WrapperNode [2024-06-04 16:00:38,678 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-04 16:00:38,679 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-04 16:00:38,679 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-04 16:00:38,679 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-04 16:00:38,684 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:00:38" (1/1) ... [2024-06-04 16:00:38,709 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:00:38" (1/1) ... [2024-06-04 16:00:38,760 INFO L138 Inliner]: procedures = 174, calls = 40, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 177 [2024-06-04 16:00:38,761 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-04 16:00:38,762 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-04 16:00:38,762 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-04 16:00:38,762 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-04 16:00:38,770 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:00:38" (1/1) ... [2024-06-04 16:00:38,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:00:38" (1/1) ... [2024-06-04 16:00:38,793 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:00:38" (1/1) ... [2024-06-04 16:00:38,833 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-04 16:00:38,834 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:00:38" (1/1) ... [2024-06-04 16:00:38,834 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:00:38" (1/1) ... [2024-06-04 16:00:38,860 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:00:38" (1/1) ... [2024-06-04 16:00:38,868 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:00:38" (1/1) ... [2024-06-04 16:00:38,874 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:00:38" (1/1) ... [2024-06-04 16:00:38,885 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:00:38" (1/1) ... [2024-06-04 16:00:38,899 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-04 16:00:38,900 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-04 16:00:38,900 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-04 16:00:38,900 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-04 16:00:38,901 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:00:38" (1/1) ... [2024-06-04 16:00:38,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 16:00:38,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 16:00:38,955 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-04 16:00:39,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-04 16:00:39,020 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-04 16:00:39,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-04 16:00:39,028 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-04 16:00:39,028 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-04 16:00:39,029 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-04 16:00:39,029 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-04 16:00:39,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-04 16:00:39,029 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-04 16:00:39,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-04 16:00:39,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-04 16:00:39,031 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-04 16:00:39,120 INFO L244 CfgBuilder]: Building ICFG [2024-06-04 16:00:39,121 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-04 16:00:39,771 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-04 16:00:39,772 INFO L293 CfgBuilder]: Performing block encoding [2024-06-04 16:00:39,945 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-04 16:00:39,946 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-04 16:00:39,947 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 04:00:39 BoogieIcfgContainer [2024-06-04 16:00:39,948 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-04 16:00:39,950 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-04 16:00:39,950 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-04 16:00:39,953 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-04 16:00:39,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 04:00:37" (1/4) ... [2024-06-04 16:00:39,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@570b4ca0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 04:00:39, skipping insertion in model container [2024-06-04 16:00:39,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:00:37" (2/4) ... [2024-06-04 16:00:39,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@570b4ca0 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 04:00:39, skipping insertion in model container [2024-06-04 16:00:39,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:00:38" (3/4) ... [2024-06-04 16:00:39,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@570b4ca0 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 04:00:39, skipping insertion in model container [2024-06-04 16:00:39,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 04:00:39" (4/4) ... [2024-06-04 16:00:39,960 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi003_tso.i [2024-06-04 16:00:39,973 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-04 16:00:39,974 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-04 16:00:39,974 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-04 16:00:40,032 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-04 16:00:40,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 33 transitions, 74 flow [2024-06-04 16:00:40,101 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2024-06-04 16:00:40,101 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 16:00:40,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 31 events. 0/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-04 16:00:40,103 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 33 transitions, 74 flow [2024-06-04 16:00:40,105 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 25 transitions, 56 flow [2024-06-04 16:00:40,116 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 16:00:40,123 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;@7a9c611, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 16:00:40,123 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-04 16:00:40,131 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 16:00:40,131 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-04 16:00:40,131 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 16:00:40,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:40,132 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-04 16:00:40,132 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:40,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:40,137 INFO L85 PathProgramCache]: Analyzing trace with hash -175134480, now seen corresponding path program 1 times [2024-06-04 16:00:40,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:40,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398646905] [2024-06-04 16:00:40,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:40,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:40,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:43,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:43,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:43,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398646905] [2024-06-04 16:00:43,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398646905] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:43,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:43,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-04 16:00:43,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658256578] [2024-06-04 16:00:43,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:43,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-04 16:00:43,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:43,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-04 16:00:43,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-04 16:00:43,156 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-04 16:00:43,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:43,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:43,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-04 16:00:43,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:43,390 INFO L124 PetriNetUnfolderBase]: 216/392 cut-off events. [2024-06-04 16:00:43,391 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-04 16:00:43,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 795 conditions, 392 events. 216/392 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1458 event pairs, 133 based on Foata normal form. 1/387 useless extension candidates. Maximal degree in co-relation 781. Up to 378 conditions per place. [2024-06-04 16:00:43,395 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 25 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2024-06-04 16:00:43,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 31 transitions, 127 flow [2024-06-04 16:00:43,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-04 16:00:43,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-04 16:00:43,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2024-06-04 16:00:43,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2024-06-04 16:00:43,406 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 56 flow. Second operand 3 states and 51 transitions. [2024-06-04 16:00:43,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 31 transitions, 127 flow [2024-06-04 16:00:43,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 31 transitions, 124 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-04 16:00:43,410 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 75 flow [2024-06-04 16:00:43,412 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2024-06-04 16:00:43,414 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2024-06-04 16:00:43,415 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 75 flow [2024-06-04 16:00:43,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:43,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:43,415 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:00:43,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-04 16:00:43,416 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:43,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:43,416 INFO L85 PathProgramCache]: Analyzing trace with hash -800495793, now seen corresponding path program 1 times [2024-06-04 16:00:43,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:43,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884996835] [2024-06-04 16:00:43,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:43,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:43,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:45,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:45,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:45,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884996835] [2024-06-04 16:00:45,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884996835] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:45,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:45,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 16:00:45,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237660385] [2024-06-04 16:00:45,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:45,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 16:00:45,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:45,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 16:00:45,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-04 16:00:45,245 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-04 16:00:45,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:45,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:45,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-04 16:00:45,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:45,408 INFO L124 PetriNetUnfolderBase]: 207/377 cut-off events. [2024-06-04 16:00:45,408 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2024-06-04 16:00:45,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 859 conditions, 377 events. 207/377 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1414 event pairs, 76 based on Foata normal form. 6/383 useless extension candidates. Maximal degree in co-relation 844. Up to 336 conditions per place. [2024-06-04 16:00:45,411 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 31 selfloop transitions, 5 changer transitions 0/39 dead transitions. [2024-06-04 16:00:45,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 39 transitions, 177 flow [2024-06-04 16:00:45,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 16:00:45,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 16:00:45,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2024-06-04 16:00:45,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-04 16:00:45,415 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 75 flow. Second operand 4 states and 66 transitions. [2024-06-04 16:00:45,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 39 transitions, 177 flow [2024-06-04 16:00:45,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 39 transitions, 174 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-04 16:00:45,418 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 99 flow [2024-06-04 16:00:45,418 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=99, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2024-06-04 16:00:45,420 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2024-06-04 16:00:45,420 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 99 flow [2024-06-04 16:00:45,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:45,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:45,420 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:00:45,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-04 16:00:45,420 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:45,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:45,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1926644317, now seen corresponding path program 1 times [2024-06-04 16:00:45,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:45,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516484289] [2024-06-04 16:00:45,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:45,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:45,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:49,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:49,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:49,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516484289] [2024-06-04 16:00:49,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516484289] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:49,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:49,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 16:00:49,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595971045] [2024-06-04 16:00:49,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:49,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 16:00:49,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:49,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 16:00:49,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-04 16:00:49,112 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:00:49,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 99 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:49,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:49,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:00:49,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:49,402 INFO L124 PetriNetUnfolderBase]: 243/433 cut-off events. [2024-06-04 16:00:49,402 INFO L125 PetriNetUnfolderBase]: For 223/223 co-relation queries the response was YES. [2024-06-04 16:00:49,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1092 conditions, 433 events. 243/433 cut-off events. For 223/223 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1576 event pairs, 144 based on Foata normal form. 1/434 useless extension candidates. Maximal degree in co-relation 1075. Up to 421 conditions per place. [2024-06-04 16:00:49,406 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 28 selfloop transitions, 6 changer transitions 0/36 dead transitions. [2024-06-04 16:00:49,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 36 transitions, 185 flow [2024-06-04 16:00:49,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:00:49,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:00:49,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2024-06-04 16:00:49,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3515151515151515 [2024-06-04 16:00:49,408 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 99 flow. Second operand 5 states and 58 transitions. [2024-06-04 16:00:49,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 36 transitions, 185 flow [2024-06-04 16:00:49,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 36 transitions, 176 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-04 16:00:49,411 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 117 flow [2024-06-04 16:00:49,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=34, 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=117, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2024-06-04 16:00:49,412 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2024-06-04 16:00:49,412 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 117 flow [2024-06-04 16:00:49,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:49,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:49,413 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:00:49,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-04 16:00:49,414 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:49,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:49,414 INFO L85 PathProgramCache]: Analyzing trace with hash 881829901, now seen corresponding path program 1 times [2024-06-04 16:00:49,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:49,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825278814] [2024-06-04 16:00:49,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:49,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:49,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:52,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:52,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:52,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825278814] [2024-06-04 16:00:52,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825278814] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:52,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:52,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 16:00:52,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796211275] [2024-06-04 16:00:52,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:52,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 16:00:52,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:52,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 16:00:52,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 16:00:52,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:00:52,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 117 flow. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:52,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:52,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:00:52,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:52,877 INFO L124 PetriNetUnfolderBase]: 239/425 cut-off events. [2024-06-04 16:00:52,877 INFO L125 PetriNetUnfolderBase]: For 374/374 co-relation queries the response was YES. [2024-06-04 16:00:52,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1142 conditions, 425 events. 239/425 cut-off events. For 374/374 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1475 event pairs, 41 based on Foata normal form. 4/429 useless extension candidates. Maximal degree in co-relation 1123. Up to 362 conditions per place. [2024-06-04 16:00:52,879 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 38 selfloop transitions, 8 changer transitions 0/48 dead transitions. [2024-06-04 16:00:52,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 48 transitions, 247 flow [2024-06-04 16:00:52,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 16:00:52,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 16:00:52,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2024-06-04 16:00:52,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41414141414141414 [2024-06-04 16:00:52,881 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 117 flow. Second operand 6 states and 82 transitions. [2024-06-04 16:00:52,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 48 transitions, 247 flow [2024-06-04 16:00:52,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 48 transitions, 236 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-04 16:00:52,883 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 131 flow [2024-06-04 16:00:52,883 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=131, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2024-06-04 16:00:52,883 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 10 predicate places. [2024-06-04 16:00:52,884 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 131 flow [2024-06-04 16:00:52,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:52,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:52,884 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:00:52,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-04 16:00:52,884 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 16:00:52,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:52,885 INFO L85 PathProgramCache]: Analyzing trace with hash 427699862, now seen corresponding path program 1 times [2024-06-04 16:00:52,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:52,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283254157] [2024-06-04 16:00:52,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:52,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:52,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:00:56,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:00:56,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:00:56,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283254157] [2024-06-04 16:00:56,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283254157] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:00:56,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:00:56,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 16:00:56,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277581237] [2024-06-04 16:00:56,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:00:56,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 16:00:56,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:00:56,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 16:00:56,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-04 16:00:56,120 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:00:56,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 131 flow. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:56,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:00:56,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:00:56,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:00:56,408 INFO L124 PetriNetUnfolderBase]: 237/422 cut-off events. [2024-06-04 16:00:56,408 INFO L125 PetriNetUnfolderBase]: For 600/600 co-relation queries the response was YES. [2024-06-04 16:00:56,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1231 conditions, 422 events. 237/422 cut-off events. For 600/600 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1485 event pairs, 103 based on Foata normal form. 1/423 useless extension candidates. Maximal degree in co-relation 1211. Up to 407 conditions per place. [2024-06-04 16:00:56,411 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 30 selfloop transitions, 8 changer transitions 0/40 dead transitions. [2024-06-04 16:00:56,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 40 transitions, 229 flow [2024-06-04 16:00:56,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 16:00:56,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 16:00:56,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2024-06-04 16:00:56,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3282828282828283 [2024-06-04 16:00:56,412 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 131 flow. Second operand 6 states and 65 transitions. [2024-06-04 16:00:56,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 40 transitions, 229 flow [2024-06-04 16:00:56,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 40 transitions, 213 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-04 16:00:56,415 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 148 flow [2024-06-04 16:00:56,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=148, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2024-06-04 16:00:56,416 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 13 predicate places. [2024-06-04 16:00:56,416 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 148 flow [2024-06-04 16:00:56,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:00:56,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:00:56,416 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:00:56,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-04 16:00:56,417 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:00:56,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:00:56,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1889463618, now seen corresponding path program 1 times [2024-06-04 16:00:56,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:00:56,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331892247] [2024-06-04 16:00:56,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:00:56,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:00:56,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:01:00,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:01:00,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:01:00,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331892247] [2024-06-04 16:01:00,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331892247] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:01:00,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:01:00,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 16:01:00,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581252105] [2024-06-04 16:01:00,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:01:00,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 16:01:00,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:01:00,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 16:01:00,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-04 16:01:00,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:01:00,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 148 flow. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:00,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:01:00,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:01:00,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:01:00,567 INFO L124 PetriNetUnfolderBase]: 243/432 cut-off events. [2024-06-04 16:01:00,568 INFO L125 PetriNetUnfolderBase]: For 830/830 co-relation queries the response was YES. [2024-06-04 16:01:00,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1331 conditions, 432 events. 243/432 cut-off events. For 830/830 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1534 event pairs, 82 based on Foata normal form. 2/434 useless extension candidates. Maximal degree in co-relation 1309. Up to 385 conditions per place. [2024-06-04 16:01:00,570 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 37 selfloop transitions, 11 changer transitions 0/50 dead transitions. [2024-06-04 16:01:00,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 50 transitions, 298 flow [2024-06-04 16:01:00,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 16:01:00,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 16:01:00,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2024-06-04 16:01:00,571 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3686868686868687 [2024-06-04 16:01:00,572 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 148 flow. Second operand 6 states and 73 transitions. [2024-06-04 16:01:00,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 50 transitions, 298 flow [2024-06-04 16:01:00,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 50 transitions, 281 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-04 16:01:00,574 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 178 flow [2024-06-04 16:01:00,574 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=178, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2024-06-04 16:01:00,575 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 15 predicate places. [2024-06-04 16:01:00,575 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 178 flow [2024-06-04 16:01:00,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:00,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:01:00,575 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:01:00,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-04 16:01:00,576 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:01:00,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:01:00,576 INFO L85 PathProgramCache]: Analyzing trace with hash 399386812, now seen corresponding path program 2 times [2024-06-04 16:01:00,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:01:00,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173931258] [2024-06-04 16:01:00,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:01:00,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:01:00,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:01:04,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:01:04,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:01:04,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173931258] [2024-06-04 16:01:04,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173931258] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:01:04,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:01:04,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 16:01:04,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675510047] [2024-06-04 16:01:04,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:01:04,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 16:01:04,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:01:04,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 16:01:04,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-04 16:01:04,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:01:04,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 178 flow. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:04,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:01:04,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:01:04,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:01:04,431 INFO L124 PetriNetUnfolderBase]: 239/428 cut-off events. [2024-06-04 16:01:04,431 INFO L125 PetriNetUnfolderBase]: For 1132/1134 co-relation queries the response was YES. [2024-06-04 16:01:04,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1403 conditions, 428 events. 239/428 cut-off events. For 1132/1134 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1518 event pairs, 88 based on Foata normal form. 4/432 useless extension candidates. Maximal degree in co-relation 1380. Up to 382 conditions per place. [2024-06-04 16:01:04,434 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 34 selfloop transitions, 11 changer transitions 0/47 dead transitions. [2024-06-04 16:01:04,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 47 transitions, 288 flow [2024-06-04 16:01:04,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 16:01:04,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 16:01:04,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2024-06-04 16:01:04,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35353535353535354 [2024-06-04 16:01:04,436 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 178 flow. Second operand 6 states and 70 transitions. [2024-06-04 16:01:04,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 47 transitions, 288 flow [2024-06-04 16:01:04,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 47 transitions, 274 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-04 16:01:04,438 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 191 flow [2024-06-04 16:01:04,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=191, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2024-06-04 16:01:04,439 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 19 predicate places. [2024-06-04 16:01:04,439 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 191 flow [2024-06-04 16:01:04,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:04,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:01:04,440 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:01:04,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-04 16:01:04,440 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:01:04,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:01:04,441 INFO L85 PathProgramCache]: Analyzing trace with hash 373794700, now seen corresponding path program 1 times [2024-06-04 16:01:04,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:01:04,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210141215] [2024-06-04 16:01:04,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:01:04,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:01:04,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:01:07,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:01:07,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:01:07,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210141215] [2024-06-04 16:01:07,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210141215] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:01:07,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:01:07,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:01:07,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216474500] [2024-06-04 16:01:07,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:01:07,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:01:07,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:01:07,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:01:07,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:01:08,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:01:08,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 191 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:08,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:01:08,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:01:08,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:01:08,280 INFO L124 PetriNetUnfolderBase]: 237/423 cut-off events. [2024-06-04 16:01:08,280 INFO L125 PetriNetUnfolderBase]: For 1357/1357 co-relation queries the response was YES. [2024-06-04 16:01:08,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1437 conditions, 423 events. 237/423 cut-off events. For 1357/1357 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1495 event pairs, 99 based on Foata normal form. 1/424 useless extension candidates. Maximal degree in co-relation 1412. Up to 405 conditions per place. [2024-06-04 16:01:08,282 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 35 selfloop transitions, 10 changer transitions 0/47 dead transitions. [2024-06-04 16:01:08,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 47 transitions, 307 flow [2024-06-04 16:01:08,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:01:08,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:01:08,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2024-06-04 16:01:08,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31601731601731603 [2024-06-04 16:01:08,284 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 191 flow. Second operand 7 states and 73 transitions. [2024-06-04 16:01:08,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 47 transitions, 307 flow [2024-06-04 16:01:08,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 47 transitions, 277 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-06-04 16:01:08,286 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 200 flow [2024-06-04 16:01:08,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=200, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2024-06-04 16:01:08,287 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 20 predicate places. [2024-06-04 16:01:08,287 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 200 flow [2024-06-04 16:01:08,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:08,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:01:08,288 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:01:08,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-04 16:01:08,288 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:01:08,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:01:08,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1075995905, now seen corresponding path program 1 times [2024-06-04 16:01:08,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:01:08,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496833328] [2024-06-04 16:01:08,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:01:08,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:01:08,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:01:10,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:01:10,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:01:10,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496833328] [2024-06-04 16:01:10,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496833328] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:01:10,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:01:10,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:01:10,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137829839] [2024-06-04 16:01:10,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:01:10,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:01:10,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:01:10,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:01:10,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:01:11,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:01:11,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 200 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:11,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:01:11,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:01:11,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:01:11,389 INFO L124 PetriNetUnfolderBase]: 243/434 cut-off events. [2024-06-04 16:01:11,390 INFO L125 PetriNetUnfolderBase]: For 1687/1689 co-relation queries the response was YES. [2024-06-04 16:01:11,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1518 conditions, 434 events. 243/434 cut-off events. For 1687/1689 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1535 event pairs, 85 based on Foata normal form. 4/438 useless extension candidates. Maximal degree in co-relation 1493. Up to 383 conditions per place. [2024-06-04 16:01:11,392 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 39 selfloop transitions, 17 changer transitions 0/58 dead transitions. [2024-06-04 16:01:11,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 58 transitions, 366 flow [2024-06-04 16:01:11,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:01:11,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:01:11,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2024-06-04 16:01:11,394 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3463203463203463 [2024-06-04 16:01:11,394 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 200 flow. Second operand 7 states and 80 transitions. [2024-06-04 16:01:11,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 58 transitions, 366 flow [2024-06-04 16:01:11,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 58 transitions, 343 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-04 16:01:11,397 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 262 flow [2024-06-04 16:01:11,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=262, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2024-06-04 16:01:11,397 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 24 predicate places. [2024-06-04 16:01:11,398 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 262 flow [2024-06-04 16:01:11,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:11,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:01:11,398 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:01:11,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-04 16:01:11,398 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:01:11,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:01:11,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1960148395, now seen corresponding path program 2 times [2024-06-04 16:01:11,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:01:11,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890975881] [2024-06-04 16:01:11,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:01:11,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:01:11,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:01:14,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:01:14,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:01:14,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890975881] [2024-06-04 16:01:14,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890975881] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:01:14,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:01:14,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:01:14,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389901943] [2024-06-04 16:01:14,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:01:14,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:01:14,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:01:14,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:01:14,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:01:14,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:01:14,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 262 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:14,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:01:14,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:01:14,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:01:14,873 INFO L124 PetriNetUnfolderBase]: 249/445 cut-off events. [2024-06-04 16:01:14,873 INFO L125 PetriNetUnfolderBase]: For 2179/2181 co-relation queries the response was YES. [2024-06-04 16:01:14,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1721 conditions, 445 events. 249/445 cut-off events. For 2179/2181 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1606 event pairs, 81 based on Foata normal form. 4/449 useless extension candidates. Maximal degree in co-relation 1693. Up to 371 conditions per place. [2024-06-04 16:01:14,876 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 39 selfloop transitions, 21 changer transitions 0/62 dead transitions. [2024-06-04 16:01:14,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 62 transitions, 459 flow [2024-06-04 16:01:14,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:01:14,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:01:14,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2024-06-04 16:01:14,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35064935064935066 [2024-06-04 16:01:14,877 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 262 flow. Second operand 7 states and 81 transitions. [2024-06-04 16:01:14,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 62 transitions, 459 flow [2024-06-04 16:01:14,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 62 transitions, 443 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-04 16:01:14,880 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 321 flow [2024-06-04 16:01:14,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=321, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2024-06-04 16:01:14,884 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 29 predicate places. [2024-06-04 16:01:14,884 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 321 flow [2024-06-04 16:01:14,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:14,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:01:14,885 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:01:14,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-04 16:01:14,885 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:01:14,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:01:14,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1297542121, now seen corresponding path program 3 times [2024-06-04 16:01:14,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:01:14,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134938823] [2024-06-04 16:01:14,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:01:14,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:01:14,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:01:17,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 16:01:17,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:01:17,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134938823] [2024-06-04 16:01:17,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134938823] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:01:17,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:01:17,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:01:17,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872283484] [2024-06-04 16:01:17,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:01:17,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:01:17,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:01:17,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:01:17,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:01:17,874 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:01:17,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 321 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:17,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:01:17,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:01:17,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:01:18,250 INFO L124 PetriNetUnfolderBase]: 250/447 cut-off events. [2024-06-04 16:01:18,251 INFO L125 PetriNetUnfolderBase]: For 2696/2698 co-relation queries the response was YES. [2024-06-04 16:01:18,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1822 conditions, 447 events. 250/447 cut-off events. For 2696/2698 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1599 event pairs, 86 based on Foata normal form. 4/451 useless extension candidates. Maximal degree in co-relation 1792. Up to 395 conditions per place. [2024-06-04 16:01:18,253 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 43 selfloop transitions, 17 changer transitions 0/62 dead transitions. [2024-06-04 16:01:18,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 62 transitions, 484 flow [2024-06-04 16:01:18,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:01:18,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:01:18,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2024-06-04 16:01:18,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33766233766233766 [2024-06-04 16:01:18,254 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 321 flow. Second operand 7 states and 78 transitions. [2024-06-04 16:01:18,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 62 transitions, 484 flow [2024-06-04 16:01:18,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 62 transitions, 455 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-04 16:01:18,257 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 361 flow [2024-06-04 16:01:18,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=361, PETRI_PLACES=66, PETRI_TRANSITIONS=54} [2024-06-04 16:01:18,258 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 34 predicate places. [2024-06-04 16:01:18,258 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 361 flow [2024-06-04 16:01:18,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:18,258 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:01:18,259 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:01:18,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-04 16:01:18,259 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:01:18,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:01:18,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1282926175, now seen corresponding path program 1 times [2024-06-04 16:01:18,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:01:18,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277042528] [2024-06-04 16:01:18,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:01:18,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:01:18,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:01:23,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 16:01:23,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:01:23,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277042528] [2024-06-04 16:01:23,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277042528] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:01:23,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:01:23,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:01:23,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298993490] [2024-06-04 16:01:23,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:01:23,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:01:23,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:01:23,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:01:23,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:01:23,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:01:23,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 361 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:23,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:01:23,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:01:23,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:01:23,574 INFO L124 PetriNetUnfolderBase]: 248/442 cut-off events. [2024-06-04 16:01:23,575 INFO L125 PetriNetUnfolderBase]: For 2983/2983 co-relation queries the response was YES. [2024-06-04 16:01:23,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1878 conditions, 442 events. 248/442 cut-off events. For 2983/2983 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1591 event pairs, 77 based on Foata normal form. 1/443 useless extension candidates. Maximal degree in co-relation 1845. Up to 421 conditions per place. [2024-06-04 16:01:23,578 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 50 selfloop transitions, 12 changer transitions 0/64 dead transitions. [2024-06-04 16:01:23,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 64 transitions, 515 flow [2024-06-04 16:01:23,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:01:23,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:01:23,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2024-06-04 16:01:23,579 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3068181818181818 [2024-06-04 16:01:23,579 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 361 flow. Second operand 8 states and 81 transitions. [2024-06-04 16:01:23,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 64 transitions, 515 flow [2024-06-04 16:01:23,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 64 transitions, 492 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-04 16:01:23,583 INFO L231 Difference]: Finished difference. Result has 71 places, 56 transitions, 383 flow [2024-06-04 16:01:23,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=383, PETRI_PLACES=71, PETRI_TRANSITIONS=56} [2024-06-04 16:01:23,583 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 39 predicate places. [2024-06-04 16:01:23,584 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 56 transitions, 383 flow [2024-06-04 16:01:23,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:23,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:01:23,584 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:01:23,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-04 16:01:23,584 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:01:23,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:01:23,585 INFO L85 PathProgramCache]: Analyzing trace with hash 991887517, now seen corresponding path program 1 times [2024-06-04 16:01:23,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:01:23,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801463644] [2024-06-04 16:01:23,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:01:23,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:01:23,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:01:27,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:01:27,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:01:27,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801463644] [2024-06-04 16:01:27,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801463644] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:01:27,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:01:27,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:01:27,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873442738] [2024-06-04 16:01:27,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:01:27,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:01:27,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:01:27,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:01:27,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:01:27,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:01:27,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 56 transitions, 383 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:27,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:01:27,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:01:27,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:01:28,154 INFO L124 PetriNetUnfolderBase]: 254/452 cut-off events. [2024-06-04 16:01:28,155 INFO L125 PetriNetUnfolderBase]: For 3484/3484 co-relation queries the response was YES. [2024-06-04 16:01:28,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1972 conditions, 452 events. 254/452 cut-off events. For 3484/3484 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1617 event pairs, 55 based on Foata normal form. 2/454 useless extension candidates. Maximal degree in co-relation 1938. Up to 399 conditions per place. [2024-06-04 16:01:28,157 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 60 selfloop transitions, 11 changer transitions 0/73 dead transitions. [2024-06-04 16:01:28,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 73 transitions, 571 flow [2024-06-04 16:01:28,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:01:28,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:01:28,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2024-06-04 16:01:28,158 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.354978354978355 [2024-06-04 16:01:28,158 INFO L175 Difference]: Start difference. First operand has 71 places, 56 transitions, 383 flow. Second operand 7 states and 82 transitions. [2024-06-04 16:01:28,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 73 transitions, 571 flow [2024-06-04 16:01:28,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 73 transitions, 542 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-04 16:01:28,162 INFO L231 Difference]: Finished difference. Result has 72 places, 58 transitions, 395 flow [2024-06-04 16:01:28,162 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=395, PETRI_PLACES=72, PETRI_TRANSITIONS=58} [2024-06-04 16:01:28,163 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 40 predicate places. [2024-06-04 16:01:28,163 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 58 transitions, 395 flow [2024-06-04 16:01:28,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:28,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:01:28,163 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:01:28,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-04 16:01:28,164 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:01:28,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:01:28,164 INFO L85 PathProgramCache]: Analyzing trace with hash 992007673, now seen corresponding path program 1 times [2024-06-04 16:01:28,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:01:28,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731861100] [2024-06-04 16:01:28,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:01:28,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:01:28,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:01:31,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:01:31,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:01:31,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731861100] [2024-06-04 16:01:31,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731861100] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:01:31,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:01:31,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:01:31,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230535372] [2024-06-04 16:01:31,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:01:31,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:01:31,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:01:31,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:01:31,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:01:31,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:01:31,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 58 transitions, 395 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:31,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:01:31,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:01:31,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:01:32,096 INFO L124 PetriNetUnfolderBase]: 257/457 cut-off events. [2024-06-04 16:01:32,096 INFO L125 PetriNetUnfolderBase]: For 3994/3994 co-relation queries the response was YES. [2024-06-04 16:01:32,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2080 conditions, 457 events. 257/457 cut-off events. For 3994/3994 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1656 event pairs, 75 based on Foata normal form. 1/458 useless extension candidates. Maximal degree in co-relation 2045. Up to 404 conditions per place. [2024-06-04 16:01:32,099 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 51 selfloop transitions, 18 changer transitions 0/71 dead transitions. [2024-06-04 16:01:32,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 71 transitions, 581 flow [2024-06-04 16:01:32,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:01:32,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:01:32,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2024-06-04 16:01:32,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35064935064935066 [2024-06-04 16:01:32,100 INFO L175 Difference]: Start difference. First operand has 72 places, 58 transitions, 395 flow. Second operand 7 states and 81 transitions. [2024-06-04 16:01:32,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 71 transitions, 581 flow [2024-06-04 16:01:32,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 71 transitions, 556 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-04 16:01:32,105 INFO L231 Difference]: Finished difference. Result has 74 places, 60 transitions, 436 flow [2024-06-04 16:01:32,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=436, PETRI_PLACES=74, PETRI_TRANSITIONS=60} [2024-06-04 16:01:32,105 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 42 predicate places. [2024-06-04 16:01:32,106 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 60 transitions, 436 flow [2024-06-04 16:01:32,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:32,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:01:32,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:01:32,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-04 16:01:32,106 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:01:32,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:01:32,107 INFO L85 PathProgramCache]: Analyzing trace with hash 992007487, now seen corresponding path program 2 times [2024-06-04 16:01:32,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:01:32,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450060809] [2024-06-04 16:01:32,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:01:32,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:01:32,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:01:35,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:01:35,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:01:35,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450060809] [2024-06-04 16:01:35,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450060809] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:01:35,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:01:35,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:01:35,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322825310] [2024-06-04 16:01:35,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:01:35,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:01:35,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:01:35,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:01:35,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:01:36,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:01:36,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 60 transitions, 436 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:36,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:01:36,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:01:36,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:01:36,408 INFO L124 PetriNetUnfolderBase]: 263/467 cut-off events. [2024-06-04 16:01:36,409 INFO L125 PetriNetUnfolderBase]: For 4714/4714 co-relation queries the response was YES. [2024-06-04 16:01:36,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2178 conditions, 467 events. 263/467 cut-off events. For 4714/4714 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1681 event pairs, 55 based on Foata normal form. 2/469 useless extension candidates. Maximal degree in co-relation 2142. Up to 382 conditions per place. [2024-06-04 16:01:36,412 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 56 selfloop transitions, 20 changer transitions 0/78 dead transitions. [2024-06-04 16:01:36,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 78 transitions, 676 flow [2024-06-04 16:01:36,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:01:36,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:01:36,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2024-06-04 16:01:36,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3722943722943723 [2024-06-04 16:01:36,413 INFO L175 Difference]: Start difference. First operand has 74 places, 60 transitions, 436 flow. Second operand 7 states and 86 transitions. [2024-06-04 16:01:36,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 78 transitions, 676 flow [2024-06-04 16:01:36,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 78 transitions, 640 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-04 16:01:36,422 INFO L231 Difference]: Finished difference. Result has 76 places, 64 transitions, 477 flow [2024-06-04 16:01:36,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=477, PETRI_PLACES=76, PETRI_TRANSITIONS=64} [2024-06-04 16:01:36,424 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 44 predicate places. [2024-06-04 16:01:36,424 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 64 transitions, 477 flow [2024-06-04 16:01:36,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:36,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:01:36,424 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:01:36,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-04 16:01:36,424 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:01:36,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:01:36,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1799378955, now seen corresponding path program 1 times [2024-06-04 16:01:36,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:01:36,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582300011] [2024-06-04 16:01:36,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:01:36,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:01:36,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:01:40,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:01:40,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:01:40,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582300011] [2024-06-04 16:01:40,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582300011] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:01:40,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:01:40,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:01:40,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203835471] [2024-06-04 16:01:40,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:01:40,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:01:40,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:01:40,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:01:40,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:01:40,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:01:40,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 64 transitions, 477 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:40,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:01:40,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:01:40,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:01:40,767 INFO L124 PetriNetUnfolderBase]: 269/478 cut-off events. [2024-06-04 16:01:40,767 INFO L125 PetriNetUnfolderBase]: For 5473/5475 co-relation queries the response was YES. [2024-06-04 16:01:40,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2297 conditions, 478 events. 269/478 cut-off events. For 5473/5475 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1757 event pairs, 80 based on Foata normal form. 4/482 useless extension candidates. Maximal degree in co-relation 2260. Up to 419 conditions per place. [2024-06-04 16:01:40,770 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 57 selfloop transitions, 20 changer transitions 0/79 dead transitions. [2024-06-04 16:01:40,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 79 transitions, 681 flow [2024-06-04 16:01:40,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:01:40,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:01:40,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2024-06-04 16:01:40,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3371212121212121 [2024-06-04 16:01:40,771 INFO L175 Difference]: Start difference. First operand has 76 places, 64 transitions, 477 flow. Second operand 8 states and 89 transitions. [2024-06-04 16:01:40,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 79 transitions, 681 flow [2024-06-04 16:01:40,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 79 transitions, 657 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-04 16:01:40,776 INFO L231 Difference]: Finished difference. Result has 81 places, 66 transitions, 514 flow [2024-06-04 16:01:40,777 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=514, PETRI_PLACES=81, PETRI_TRANSITIONS=66} [2024-06-04 16:01:40,777 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 49 predicate places. [2024-06-04 16:01:40,777 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 66 transitions, 514 flow [2024-06-04 16:01:40,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:40,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:01:40,777 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:01:40,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-04 16:01:40,778 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:01:40,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:01:40,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1004551139, now seen corresponding path program 2 times [2024-06-04 16:01:40,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:01:40,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624336270] [2024-06-04 16:01:40,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:01:40,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:01:40,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:01:44,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:01:44,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:01:44,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624336270] [2024-06-04 16:01:44,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624336270] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:01:44,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:01:44,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:01:44,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179805298] [2024-06-04 16:01:44,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:01:44,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:01:44,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:01:44,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:01:44,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:01:44,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:01:44,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 66 transitions, 514 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:44,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:01:44,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:01:44,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:01:45,136 INFO L124 PetriNetUnfolderBase]: 275/489 cut-off events. [2024-06-04 16:01:45,137 INFO L125 PetriNetUnfolderBase]: For 6156/6158 co-relation queries the response was YES. [2024-06-04 16:01:45,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2446 conditions, 489 events. 275/489 cut-off events. For 6156/6158 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1791 event pairs, 83 based on Foata normal form. 4/493 useless extension candidates. Maximal degree in co-relation 2407. Up to 429 conditions per place. [2024-06-04 16:01:45,141 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 57 selfloop transitions, 19 changer transitions 0/78 dead transitions. [2024-06-04 16:01:45,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 78 transitions, 712 flow [2024-06-04 16:01:45,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:01:45,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:01:45,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2024-06-04 16:01:45,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32954545454545453 [2024-06-04 16:01:45,142 INFO L175 Difference]: Start difference. First operand has 81 places, 66 transitions, 514 flow. Second operand 8 states and 87 transitions. [2024-06-04 16:01:45,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 78 transitions, 712 flow [2024-06-04 16:01:45,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 78 transitions, 667 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-04 16:01:45,149 INFO L231 Difference]: Finished difference. Result has 83 places, 68 transitions, 532 flow [2024-06-04 16:01:45,149 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=532, PETRI_PLACES=83, PETRI_TRANSITIONS=68} [2024-06-04 16:01:45,149 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 51 predicate places. [2024-06-04 16:01:45,150 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 68 transitions, 532 flow [2024-06-04 16:01:45,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:45,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:01:45,150 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:01:45,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-04 16:01:45,150 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:01:45,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:01:45,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1560528341, now seen corresponding path program 3 times [2024-06-04 16:01:45,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:01:45,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021532852] [2024-06-04 16:01:45,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:01:45,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:01:45,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:01:48,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 16:01:48,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:01:48,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021532852] [2024-06-04 16:01:48,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021532852] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:01:48,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:01:48,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:01:48,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691954389] [2024-06-04 16:01:48,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:01:48,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:01:48,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:01:48,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:01:48,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:01:48,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:01:48,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 68 transitions, 532 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:48,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:01:48,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:01:48,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:01:49,075 INFO L124 PetriNetUnfolderBase]: 281/497 cut-off events. [2024-06-04 16:01:49,075 INFO L125 PetriNetUnfolderBase]: For 6826/6826 co-relation queries the response was YES. [2024-06-04 16:01:49,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2558 conditions, 497 events. 281/497 cut-off events. For 6826/6826 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1825 event pairs, 77 based on Foata normal form. 2/499 useless extension candidates. Maximal degree in co-relation 2518. Up to 473 conditions per place. [2024-06-04 16:01:49,079 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 65 selfloop transitions, 12 changer transitions 0/79 dead transitions. [2024-06-04 16:01:49,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 79 transitions, 730 flow [2024-06-04 16:01:49,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:01:49,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:01:49,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2024-06-04 16:01:49,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3106060606060606 [2024-06-04 16:01:49,080 INFO L175 Difference]: Start difference. First operand has 83 places, 68 transitions, 532 flow. Second operand 8 states and 82 transitions. [2024-06-04 16:01:49,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 79 transitions, 730 flow [2024-06-04 16:01:49,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 79 transitions, 683 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-04 16:01:49,086 INFO L231 Difference]: Finished difference. Result has 85 places, 70 transitions, 538 flow [2024-06-04 16:01:49,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=538, PETRI_PLACES=85, PETRI_TRANSITIONS=70} [2024-06-04 16:01:49,086 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 53 predicate places. [2024-06-04 16:01:49,086 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 70 transitions, 538 flow [2024-06-04 16:01:49,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:49,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:01:49,087 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:01:49,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-04 16:01:49,087 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:01:49,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:01:49,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1115699107, now seen corresponding path program 4 times [2024-06-04 16:01:49,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:01:49,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133286901] [2024-06-04 16:01:49,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:01:49,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:01:49,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:01:52,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:01:52,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:01:52,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133286901] [2024-06-04 16:01:52,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133286901] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:01:52,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:01:52,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:01:52,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308239377] [2024-06-04 16:01:52,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:01:52,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:01:52,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:01:52,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:01:52,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:01:53,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:01:53,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 70 transitions, 538 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:53,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:01:53,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:01:53,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:01:53,393 INFO L124 PetriNetUnfolderBase]: 282/501 cut-off events. [2024-06-04 16:01:53,393 INFO L125 PetriNetUnfolderBase]: For 7563/7565 co-relation queries the response was YES. [2024-06-04 16:01:53,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2614 conditions, 501 events. 282/501 cut-off events. For 7563/7565 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1858 event pairs, 81 based on Foata normal form. 4/505 useless extension candidates. Maximal degree in co-relation 2573. Up to 387 conditions per place. [2024-06-04 16:01:53,397 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 52 selfloop transitions, 32 changer transitions 0/86 dead transitions. [2024-06-04 16:01:53,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 86 transitions, 828 flow [2024-06-04 16:01:53,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:01:53,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:01:53,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2024-06-04 16:01:53,398 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3484848484848485 [2024-06-04 16:01:53,398 INFO L175 Difference]: Start difference. First operand has 85 places, 70 transitions, 538 flow. Second operand 8 states and 92 transitions. [2024-06-04 16:01:53,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 86 transitions, 828 flow [2024-06-04 16:01:53,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 86 transitions, 791 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-04 16:01:53,405 INFO L231 Difference]: Finished difference. Result has 87 places, 74 transitions, 622 flow [2024-06-04 16:01:53,405 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=622, PETRI_PLACES=87, PETRI_TRANSITIONS=74} [2024-06-04 16:01:53,405 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 55 predicate places. [2024-06-04 16:01:53,405 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 74 transitions, 622 flow [2024-06-04 16:01:53,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:53,406 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:01:53,406 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:01:53,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-04 16:01:53,406 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:01:53,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:01:53,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1107418139, now seen corresponding path program 2 times [2024-06-04 16:01:53,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:01:53,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310112530] [2024-06-04 16:01:53,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:01:53,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:01:53,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:01:57,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:01:57,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:01:57,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310112530] [2024-06-04 16:01:57,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310112530] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:01:57,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:01:57,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:01:57,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705041222] [2024-06-04 16:01:57,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:01:57,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:01:57,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:01:57,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:01:57,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:01:57,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:01:57,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 74 transitions, 622 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:57,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:01:57,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:01:57,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:01:57,444 INFO L124 PetriNetUnfolderBase]: 280/498 cut-off events. [2024-06-04 16:01:57,444 INFO L125 PetriNetUnfolderBase]: For 8079/8081 co-relation queries the response was YES. [2024-06-04 16:01:57,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2682 conditions, 498 events. 280/498 cut-off events. For 8079/8081 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1844 event pairs, 85 based on Foata normal form. 3/501 useless extension candidates. Maximal degree in co-relation 2640. Up to 443 conditions per place. [2024-06-04 16:01:57,448 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 62 selfloop transitions, 18 changer transitions 0/82 dead transitions. [2024-06-04 16:01:57,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 82 transitions, 804 flow [2024-06-04 16:01:57,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:01:57,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:01:57,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2024-06-04 16:01:57,450 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.341991341991342 [2024-06-04 16:01:57,450 INFO L175 Difference]: Start difference. First operand has 87 places, 74 transitions, 622 flow. Second operand 7 states and 79 transitions. [2024-06-04 16:01:57,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 82 transitions, 804 flow [2024-06-04 16:01:57,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 82 transitions, 759 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-04 16:01:57,457 INFO L231 Difference]: Finished difference. Result has 90 places, 74 transitions, 621 flow [2024-06-04 16:01:57,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=621, PETRI_PLACES=90, PETRI_TRANSITIONS=74} [2024-06-04 16:01:57,458 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 58 predicate places. [2024-06-04 16:01:57,458 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 74 transitions, 621 flow [2024-06-04 16:01:57,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:01:57,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:01:57,459 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:01:57,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-04 16:01:57,459 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:01:57,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:01:57,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1107417953, now seen corresponding path program 3 times [2024-06-04 16:01:57,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:01:57,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206141400] [2024-06-04 16:01:57,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:01:57,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:01:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:02:01,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 16:02:01,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:02:01,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206141400] [2024-06-04 16:02:01,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206141400] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:02:01,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:02:01,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:02:01,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760914927] [2024-06-04 16:02:01,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:02:01,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:02:01,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:02:01,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:02:01,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:02:01,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:02:01,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 74 transitions, 621 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:02:01,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:02:01,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:02:01,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:02:01,882 INFO L124 PetriNetUnfolderBase]: 276/492 cut-off events. [2024-06-04 16:02:01,882 INFO L125 PetriNetUnfolderBase]: For 8592/8594 co-relation queries the response was YES. [2024-06-04 16:02:01,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2667 conditions, 492 events. 276/492 cut-off events. For 8592/8594 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1823 event pairs, 74 based on Foata normal form. 2/494 useless extension candidates. Maximal degree in co-relation 2623. Up to 408 conditions per place. [2024-06-04 16:02:01,885 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 62 selfloop transitions, 20 changer transitions 0/84 dead transitions. [2024-06-04 16:02:01,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 84 transitions, 807 flow [2024-06-04 16:02:01,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:02:01,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:02:01,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2024-06-04 16:02:01,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3593073593073593 [2024-06-04 16:02:01,886 INFO L175 Difference]: Start difference. First operand has 90 places, 74 transitions, 621 flow. Second operand 7 states and 83 transitions. [2024-06-04 16:02:01,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 84 transitions, 807 flow [2024-06-04 16:02:01,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 84 transitions, 744 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-04 16:02:01,893 INFO L231 Difference]: Finished difference. Result has 91 places, 74 transitions, 603 flow [2024-06-04 16:02:01,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=603, PETRI_PLACES=91, PETRI_TRANSITIONS=74} [2024-06-04 16:02:01,894 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 59 predicate places. [2024-06-04 16:02:01,894 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 74 transitions, 603 flow [2024-06-04 16:02:01,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:02:01,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:02:01,894 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:02:01,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-04 16:02:01,895 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:02:01,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:02:01,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1116006689, now seen corresponding path program 1 times [2024-06-04 16:02:01,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:02:01,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612544700] [2024-06-04 16:02:01,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:02:01,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:02:01,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:02:07,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:02:07,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:02:07,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612544700] [2024-06-04 16:02:07,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612544700] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:02:07,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:02:07,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:02:07,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745153519] [2024-06-04 16:02:07,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:02:07,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:02:07,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:02:07,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:02:07,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:02:07,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:02:07,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 74 transitions, 603 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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 16:02:07,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:02:07,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:02:07,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:02:08,264 INFO L124 PetriNetUnfolderBase]: 274/487 cut-off events. [2024-06-04 16:02:08,265 INFO L125 PetriNetUnfolderBase]: For 8099/8099 co-relation queries the response was YES. [2024-06-04 16:02:08,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2625 conditions, 487 events. 274/487 cut-off events. For 8099/8099 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1803 event pairs, 77 based on Foata normal form. 1/488 useless extension candidates. Maximal degree in co-relation 2580. Up to 463 conditions per place. [2024-06-04 16:02:08,268 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 69 selfloop transitions, 14 changer transitions 0/85 dead transitions. [2024-06-04 16:02:08,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 85 transitions, 803 flow [2024-06-04 16:02:08,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:02:08,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:02:08,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 89 transitions. [2024-06-04 16:02:08,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2996632996632997 [2024-06-04 16:02:08,270 INFO L175 Difference]: Start difference. First operand has 91 places, 74 transitions, 603 flow. Second operand 9 states and 89 transitions. [2024-06-04 16:02:08,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 85 transitions, 803 flow [2024-06-04 16:02:08,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 85 transitions, 752 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-04 16:02:08,278 INFO L231 Difference]: Finished difference. Result has 94 places, 76 transitions, 603 flow [2024-06-04 16:02:08,278 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=603, PETRI_PLACES=94, PETRI_TRANSITIONS=76} [2024-06-04 16:02:08,278 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 62 predicate places. [2024-06-04 16:02:08,279 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 76 transitions, 603 flow [2024-06-04 16:02:08,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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 16:02:08,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:02:08,279 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:02:08,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-04 16:02:08,279 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:02:08,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:02:08,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1202850814, now seen corresponding path program 1 times [2024-06-04 16:02:08,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:02:08,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987561195] [2024-06-04 16:02:08,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:02:08,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:02:08,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:02:11,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:02:11,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:02:11,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987561195] [2024-06-04 16:02:11,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987561195] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:02:11,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:02:11,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:02:11,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916924938] [2024-06-04 16:02:11,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:02:11,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:02:11,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:02:11,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:02:11,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:02:11,658 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:02:11,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 76 transitions, 603 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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 16:02:11,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:02:11,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:02:11,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:02:12,009 INFO L124 PetriNetUnfolderBase]: 302/539 cut-off events. [2024-06-04 16:02:12,009 INFO L125 PetriNetUnfolderBase]: For 8926/8926 co-relation queries the response was YES. [2024-06-04 16:02:12,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2854 conditions, 539 events. 302/539 cut-off events. For 8926/8926 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2066 event pairs, 61 based on Foata normal form. 2/541 useless extension candidates. Maximal degree in co-relation 2808. Up to 459 conditions per place. [2024-06-04 16:02:12,012 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 83 selfloop transitions, 20 changer transitions 0/105 dead transitions. [2024-06-04 16:02:12,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 105 transitions, 952 flow [2024-06-04 16:02:12,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:02:12,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:02:12,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2024-06-04 16:02:12,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3400673400673401 [2024-06-04 16:02:12,014 INFO L175 Difference]: Start difference. First operand has 94 places, 76 transitions, 603 flow. Second operand 9 states and 101 transitions. [2024-06-04 16:02:12,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 105 transitions, 952 flow [2024-06-04 16:02:12,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 105 transitions, 915 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-04 16:02:12,022 INFO L231 Difference]: Finished difference. Result has 100 places, 89 transitions, 734 flow [2024-06-04 16:02:12,023 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=734, PETRI_PLACES=100, PETRI_TRANSITIONS=89} [2024-06-04 16:02:12,023 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 68 predicate places. [2024-06-04 16:02:12,023 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 89 transitions, 734 flow [2024-06-04 16:02:12,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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 16:02:12,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:02:12,023 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:02:12,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-04 16:02:12,024 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:02:12,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:02:12,024 INFO L85 PathProgramCache]: Analyzing trace with hash 2072080182, now seen corresponding path program 2 times [2024-06-04 16:02:12,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:02:12,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818637090] [2024-06-04 16:02:12,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:02:12,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:02:12,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:02:15,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:02:15,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:02:15,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818637090] [2024-06-04 16:02:15,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818637090] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:02:15,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:02:15,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:02:15,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120529679] [2024-06-04 16:02:15,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:02:15,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:02:15,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:02:15,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:02:15,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:02:15,516 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:02:15,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 89 transitions, 734 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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 16:02:15,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:02:15,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:02:15,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:02:15,890 INFO L124 PetriNetUnfolderBase]: 325/578 cut-off events. [2024-06-04 16:02:15,890 INFO L125 PetriNetUnfolderBase]: For 9871/9873 co-relation queries the response was YES. [2024-06-04 16:02:15,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3209 conditions, 578 events. 325/578 cut-off events. For 9871/9873 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2288 event pairs, 60 based on Foata normal form. 4/582 useless extension candidates. Maximal degree in co-relation 3158. Up to 479 conditions per place. [2024-06-04 16:02:15,894 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 86 selfloop transitions, 30 changer transitions 0/118 dead transitions. [2024-06-04 16:02:15,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 118 transitions, 1101 flow [2024-06-04 16:02:15,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:02:15,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:02:15,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2024-06-04 16:02:15,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-04 16:02:15,897 INFO L175 Difference]: Start difference. First operand has 100 places, 89 transitions, 734 flow. Second operand 10 states and 110 transitions. [2024-06-04 16:02:15,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 118 transitions, 1101 flow [2024-06-04 16:02:15,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 118 transitions, 1071 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-06-04 16:02:15,908 INFO L231 Difference]: Finished difference. Result has 111 places, 100 transitions, 884 flow [2024-06-04 16:02:15,908 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=706, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=884, PETRI_PLACES=111, PETRI_TRANSITIONS=100} [2024-06-04 16:02:15,908 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 79 predicate places. [2024-06-04 16:02:15,908 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 100 transitions, 884 flow [2024-06-04 16:02:15,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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 16:02:15,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:02:15,909 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:02:15,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-04 16:02:15,909 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:02:15,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:02:15,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1623255512, now seen corresponding path program 3 times [2024-06-04 16:02:15,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:02:15,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461381768] [2024-06-04 16:02:15,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:02:15,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:02:15,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:02:19,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:02:19,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:02:19,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461381768] [2024-06-04 16:02:19,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461381768] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:02:19,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:02:19,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:02:19,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749988394] [2024-06-04 16:02:19,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:02:19,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:02:19,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:02:19,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:02:19,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:02:19,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:02:19,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 100 transitions, 884 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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 16:02:19,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:02:19,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:02:19,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:02:19,931 INFO L124 PetriNetUnfolderBase]: 331/588 cut-off events. [2024-06-04 16:02:19,932 INFO L125 PetriNetUnfolderBase]: For 11211/11211 co-relation queries the response was YES. [2024-06-04 16:02:19,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3487 conditions, 588 events. 331/588 cut-off events. For 11211/11211 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2347 event pairs, 58 based on Foata normal form. 2/590 useless extension candidates. Maximal degree in co-relation 3431. Up to 501 conditions per place. [2024-06-04 16:02:19,936 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 95 selfloop transitions, 24 changer transitions 0/121 dead transitions. [2024-06-04 16:02:19,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 121 transitions, 1238 flow [2024-06-04 16:02:19,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:02:19,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:02:19,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions. [2024-06-04 16:02:19,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3468013468013468 [2024-06-04 16:02:19,938 INFO L175 Difference]: Start difference. First operand has 111 places, 100 transitions, 884 flow. Second operand 9 states and 103 transitions. [2024-06-04 16:02:19,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 121 transitions, 1238 flow [2024-06-04 16:02:19,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 121 transitions, 1191 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-04 16:02:19,949 INFO L231 Difference]: Finished difference. Result has 118 places, 104 transitions, 959 flow [2024-06-04 16:02:19,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=839, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=959, PETRI_PLACES=118, PETRI_TRANSITIONS=104} [2024-06-04 16:02:19,950 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 86 predicate places. [2024-06-04 16:02:19,950 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 104 transitions, 959 flow [2024-06-04 16:02:19,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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 16:02:19,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:02:19,950 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:02:19,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-04 16:02:19,951 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:02:19,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:02:19,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1619530645, now seen corresponding path program 1 times [2024-06-04 16:02:19,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:02:19,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312086353] [2024-06-04 16:02:19,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:02:19,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:02:19,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:02:24,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:02:24,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:02:24,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312086353] [2024-06-04 16:02:24,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312086353] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:02:24,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:02:24,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:02:24,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440814254] [2024-06-04 16:02:24,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:02:24,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:02:24,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:02:24,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:02:24,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:02:24,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:02:24,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 104 transitions, 959 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:02:24,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:02:24,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:02:24,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:02:24,875 INFO L124 PetriNetUnfolderBase]: 334/593 cut-off events. [2024-06-04 16:02:24,875 INFO L125 PetriNetUnfolderBase]: For 11983/11983 co-relation queries the response was YES. [2024-06-04 16:02:24,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3644 conditions, 593 events. 334/593 cut-off events. For 11983/11983 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2382 event pairs, 88 based on Foata normal form. 1/594 useless extension candidates. Maximal degree in co-relation 3584. Up to 514 conditions per place. [2024-06-04 16:02:24,880 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 88 selfloop transitions, 27 changer transitions 0/117 dead transitions. [2024-06-04 16:02:24,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 117 transitions, 1249 flow [2024-06-04 16:02:24,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:02:24,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:02:24,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2024-06-04 16:02:24,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3712121212121212 [2024-06-04 16:02:24,882 INFO L175 Difference]: Start difference. First operand has 118 places, 104 transitions, 959 flow. Second operand 8 states and 98 transitions. [2024-06-04 16:02:24,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 117 transitions, 1249 flow [2024-06-04 16:02:24,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 117 transitions, 1191 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-06-04 16:02:24,896 INFO L231 Difference]: Finished difference. Result has 122 places, 106 transitions, 993 flow [2024-06-04 16:02:24,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=901, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=993, PETRI_PLACES=122, PETRI_TRANSITIONS=106} [2024-06-04 16:02:24,897 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 90 predicate places. [2024-06-04 16:02:24,897 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 106 transitions, 993 flow [2024-06-04 16:02:24,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:02:24,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:02:24,897 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:02:24,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-04 16:02:24,897 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:02:24,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:02:24,898 INFO L85 PathProgramCache]: Analyzing trace with hash -871478852, now seen corresponding path program 4 times [2024-06-04 16:02:24,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:02:24,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43602274] [2024-06-04 16:02:24,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:02:24,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:02:24,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:02:28,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:02:28,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:02:28,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43602274] [2024-06-04 16:02:28,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43602274] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:02:28,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:02:28,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:02:28,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152670536] [2024-06-04 16:02:28,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:02:28,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:02:28,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:02:28,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:02:28,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:02:28,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:02:28,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 106 transitions, 993 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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 16:02:28,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:02:28,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:02:28,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:02:28,875 INFO L124 PetriNetUnfolderBase]: 374/659 cut-off events. [2024-06-04 16:02:28,875 INFO L125 PetriNetUnfolderBase]: For 14229/14229 co-relation queries the response was YES. [2024-06-04 16:02:28,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4084 conditions, 659 events. 374/659 cut-off events. For 14229/14229 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2745 event pairs, 60 based on Foata normal form. 2/661 useless extension candidates. Maximal degree in co-relation 4023. Up to 471 conditions per place. [2024-06-04 16:02:28,880 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 89 selfloop transitions, 50 changer transitions 0/141 dead transitions. [2024-06-04 16:02:28,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 141 transitions, 1579 flow [2024-06-04 16:02:28,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:02:28,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:02:28,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-04 16:02:28,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.367003367003367 [2024-06-04 16:02:28,882 INFO L175 Difference]: Start difference. First operand has 122 places, 106 transitions, 993 flow. Second operand 9 states and 109 transitions. [2024-06-04 16:02:28,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 141 transitions, 1579 flow [2024-06-04 16:02:28,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 141 transitions, 1505 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-04 16:02:28,898 INFO L231 Difference]: Finished difference. Result has 126 places, 120 transitions, 1212 flow [2024-06-04 16:02:28,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=931, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1212, PETRI_PLACES=126, PETRI_TRANSITIONS=120} [2024-06-04 16:02:28,898 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 94 predicate places. [2024-06-04 16:02:28,898 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 120 transitions, 1212 flow [2024-06-04 16:02:28,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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 16:02:28,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:02:28,899 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:02:28,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-04 16:02:28,899 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:02:28,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:02:28,900 INFO L85 PathProgramCache]: Analyzing trace with hash -871484432, now seen corresponding path program 5 times [2024-06-04 16:02:28,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:02:28,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111475352] [2024-06-04 16:02:28,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:02:28,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:02:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:02:32,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:02:32,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:02:32,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111475352] [2024-06-04 16:02:32,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111475352] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:02:32,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:02:32,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:02:32,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640431048] [2024-06-04 16:02:32,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:02:32,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:02:32,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:02:32,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:02:32,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:02:32,450 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:02:32,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 120 transitions, 1212 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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 16:02:32,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:02:32,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:02:32,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:02:32,846 INFO L124 PetriNetUnfolderBase]: 375/661 cut-off events. [2024-06-04 16:02:32,846 INFO L125 PetriNetUnfolderBase]: For 15326/15326 co-relation queries the response was YES. [2024-06-04 16:02:32,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4255 conditions, 661 events. 375/661 cut-off events. For 15326/15326 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2745 event pairs, 62 based on Foata normal form. 2/663 useless extension candidates. Maximal degree in co-relation 4192. Up to 511 conditions per place. [2024-06-04 16:02:32,850 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 97 selfloop transitions, 41 changer transitions 0/140 dead transitions. [2024-06-04 16:02:32,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 140 transitions, 1605 flow [2024-06-04 16:02:32,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:02:32,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:02:32,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-04 16:02:32,851 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3569023569023569 [2024-06-04 16:02:32,851 INFO L175 Difference]: Start difference. First operand has 126 places, 120 transitions, 1212 flow. Second operand 9 states and 106 transitions. [2024-06-04 16:02:32,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 140 transitions, 1605 flow [2024-06-04 16:02:32,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 140 transitions, 1562 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-06-04 16:02:32,868 INFO L231 Difference]: Finished difference. Result has 133 places, 123 transitions, 1320 flow [2024-06-04 16:02:32,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1171, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1320, PETRI_PLACES=133, PETRI_TRANSITIONS=123} [2024-06-04 16:02:32,869 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 101 predicate places. [2024-06-04 16:02:32,869 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 123 transitions, 1320 flow [2024-06-04 16:02:32,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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 16:02:32,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:02:32,869 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:02:32,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-04 16:02:32,869 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:02:32,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:02:32,870 INFO L85 PathProgramCache]: Analyzing trace with hash 771282366, now seen corresponding path program 1 times [2024-06-04 16:02:32,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:02:32,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186800767] [2024-06-04 16:02:32,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:02:32,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:02:32,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:02:37,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:02:37,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:02:37,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186800767] [2024-06-04 16:02:37,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186800767] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:02:37,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:02:37,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:02:37,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282891727] [2024-06-04 16:02:37,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:02:37,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:02:37,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:02:37,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:02:37,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:02:38,100 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:02:38,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 123 transitions, 1320 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:02:38,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:02:38,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:02:38,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:02:38,493 INFO L124 PetriNetUnfolderBase]: 391/688 cut-off events. [2024-06-04 16:02:38,493 INFO L125 PetriNetUnfolderBase]: For 17665/17665 co-relation queries the response was YES. [2024-06-04 16:02:38,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4549 conditions, 688 events. 391/688 cut-off events. For 17665/17665 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2898 event pairs, 92 based on Foata normal form. 2/690 useless extension candidates. Maximal degree in co-relation 4483. Up to 581 conditions per place. [2024-06-04 16:02:38,498 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 107 selfloop transitions, 33 changer transitions 0/142 dead transitions. [2024-06-04 16:02:38,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 142 transitions, 1753 flow [2024-06-04 16:02:38,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:02:38,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:02:38,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-04 16:02:38,499 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.367003367003367 [2024-06-04 16:02:38,499 INFO L175 Difference]: Start difference. First operand has 133 places, 123 transitions, 1320 flow. Second operand 9 states and 109 transitions. [2024-06-04 16:02:38,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 142 transitions, 1753 flow [2024-06-04 16:02:38,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 142 transitions, 1648 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-04 16:02:38,521 INFO L231 Difference]: Finished difference. Result has 137 places, 127 transitions, 1341 flow [2024-06-04 16:02:38,521 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1217, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1341, PETRI_PLACES=137, PETRI_TRANSITIONS=127} [2024-06-04 16:02:38,522 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 105 predicate places. [2024-06-04 16:02:38,522 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 127 transitions, 1341 flow [2024-06-04 16:02:38,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:02:38,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:02:38,522 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:02:38,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-04 16:02:38,523 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:02:38,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:02:38,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1890173610, now seen corresponding path program 6 times [2024-06-04 16:02:38,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:02:38,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477210211] [2024-06-04 16:02:38,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:02:38,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:02:38,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:02:42,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:02:42,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:02:42,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477210211] [2024-06-04 16:02:42,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477210211] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:02:42,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:02:42,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:02:42,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637420700] [2024-06-04 16:02:42,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:02:42,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:02:42,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:02:42,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:02:42,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:02:42,177 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:02:42,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 127 transitions, 1341 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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 16:02:42,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:02:42,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:02:42,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:02:42,579 INFO L124 PetriNetUnfolderBase]: 407/713 cut-off events. [2024-06-04 16:02:42,580 INFO L125 PetriNetUnfolderBase]: For 19467/19467 co-relation queries the response was YES. [2024-06-04 16:02:42,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4841 conditions, 713 events. 407/713 cut-off events. For 19467/19467 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3017 event pairs, 66 based on Foata normal form. 2/715 useless extension candidates. Maximal degree in co-relation 4773. Up to 488 conditions per place. [2024-06-04 16:02:42,584 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 81 selfloop transitions, 63 changer transitions 0/146 dead transitions. [2024-06-04 16:02:42,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 146 transitions, 1811 flow [2024-06-04 16:02:42,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:02:42,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:02:42,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2024-06-04 16:02:42,585 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36742424242424243 [2024-06-04 16:02:42,585 INFO L175 Difference]: Start difference. First operand has 137 places, 127 transitions, 1341 flow. Second operand 8 states and 97 transitions. [2024-06-04 16:02:42,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 146 transitions, 1811 flow [2024-06-04 16:02:42,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 146 transitions, 1753 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-04 16:02:42,606 INFO L231 Difference]: Finished difference. Result has 140 places, 131 transitions, 1487 flow [2024-06-04 16:02:42,606 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1283, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1487, PETRI_PLACES=140, PETRI_TRANSITIONS=131} [2024-06-04 16:02:42,606 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 108 predicate places. [2024-06-04 16:02:42,607 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 131 transitions, 1487 flow [2024-06-04 16:02:42,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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 16:02:42,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:02:42,607 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:02:42,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-04 16:02:42,607 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 16:02:42,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:02:42,607 INFO L85 PathProgramCache]: Analyzing trace with hash 804764776, now seen corresponding path program 7 times [2024-06-04 16:02:42,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:02:42,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532778312] [2024-06-04 16:02:42,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:02:42,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:02:42,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:02:46,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:02:46,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:02:46,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532778312] [2024-06-04 16:02:46,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532778312] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:02:46,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:02:46,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:02:46,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038062098] [2024-06-04 16:02:46,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:02:46,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:02:46,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:02:46,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:02:46,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:02:46,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:02:46,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 131 transitions, 1487 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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 16:02:46,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:02:46,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:02:46,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:02:46,517 INFO L124 PetriNetUnfolderBase]: 408/715 cut-off events. [2024-06-04 16:02:46,517 INFO L125 PetriNetUnfolderBase]: For 20715/20715 co-relation queries the response was YES. [2024-06-04 16:02:46,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5037 conditions, 715 events. 408/715 cut-off events. For 20715/20715 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3014 event pairs, 73 based on Foata normal form. 2/717 useless extension candidates. Maximal degree in co-relation 4967. Up to 557 conditions per place. [2024-06-04 16:02:46,523 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 98 selfloop transitions, 45 changer transitions 0/145 dead transitions. [2024-06-04 16:02:46,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 145 transitions, 1855 flow [2024-06-04 16:02:46,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:02:46,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:02:46,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2024-06-04 16:02:46,524 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3560606060606061 [2024-06-04 16:02:46,524 INFO L175 Difference]: Start difference. First operand has 140 places, 131 transitions, 1487 flow. Second operand 8 states and 94 transitions. [2024-06-04 16:02:46,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 145 transitions, 1855 flow [2024-06-04 16:02:46,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 145 transitions, 1767 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-04 16:02:46,553 INFO L231 Difference]: Finished difference. Result has 143 places, 133 transitions, 1537 flow [2024-06-04 16:02:46,553 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1401, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1537, PETRI_PLACES=143, PETRI_TRANSITIONS=133} [2024-06-04 16:02:46,554 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 111 predicate places. [2024-06-04 16:02:46,554 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 133 transitions, 1537 flow [2024-06-04 16:02:46,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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 16:02:46,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:02:46,554 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:02:46,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-04 16:02:46,554 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 16:02:46,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:02:46,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1332807708, now seen corresponding path program 8 times [2024-06-04 16:02:46,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:02:46,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768132598] [2024-06-04 16:02:46,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:02:46,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:02:46,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:02:49,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 16:02:49,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:02:49,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768132598] [2024-06-04 16:02:49,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768132598] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:02:49,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:02:49,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:02:49,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426521032] [2024-06-04 16:02:49,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:02:49,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:02:49,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:02:49,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:02:49,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:02:50,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:02:50,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 133 transitions, 1537 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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 16:02:50,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:02:50,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:02:50,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:02:50,431 INFO L124 PetriNetUnfolderBase]: 414/725 cut-off events. [2024-06-04 16:02:50,431 INFO L125 PetriNetUnfolderBase]: For 20471/20471 co-relation queries the response was YES. [2024-06-04 16:02:50,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5132 conditions, 725 events. 414/725 cut-off events. For 20471/20471 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3074 event pairs, 68 based on Foata normal form. 2/727 useless extension candidates. Maximal degree in co-relation 5061. Up to 462 conditions per place. [2024-06-04 16:02:50,436 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 79 selfloop transitions, 72 changer transitions 0/153 dead transitions. [2024-06-04 16:02:50,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 153 transitions, 2038 flow [2024-06-04 16:02:50,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:02:50,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:02:50,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-04 16:02:50,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3569023569023569 [2024-06-04 16:02:50,438 INFO L175 Difference]: Start difference. First operand has 143 places, 133 transitions, 1537 flow. Second operand 9 states and 106 transitions. [2024-06-04 16:02:50,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 153 transitions, 2038 flow [2024-06-04 16:02:50,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 153 transitions, 1932 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-04 16:02:50,463 INFO L231 Difference]: Finished difference. Result has 146 places, 137 transitions, 1648 flow [2024-06-04 16:02:50,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1431, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1648, PETRI_PLACES=146, PETRI_TRANSITIONS=137} [2024-06-04 16:02:50,464 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 114 predicate places. [2024-06-04 16:02:50,464 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 137 transitions, 1648 flow [2024-06-04 16:02:50,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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 16:02:50,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:02:50,465 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:02:50,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-04 16:02:50,465 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 16:02:50,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:02:50,465 INFO L85 PathProgramCache]: Analyzing trace with hash -29775410, now seen corresponding path program 9 times [2024-06-04 16:02:50,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:02:50,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707973759] [2024-06-04 16:02:50,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:02:50,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:02:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:02:53,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:02:53,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:02:53,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707973759] [2024-06-04 16:02:53,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707973759] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:02:53,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:02:53,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:02:53,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296134305] [2024-06-04 16:02:53,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:02:53,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:02:53,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:02:53,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:02:53,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:02:53,881 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:02:53,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 137 transitions, 1648 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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 16:02:53,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:02:53,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:02:53,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:02:54,281 INFO L124 PetriNetUnfolderBase]: 420/735 cut-off events. [2024-06-04 16:02:54,281 INFO L125 PetriNetUnfolderBase]: For 21979/21979 co-relation queries the response was YES. [2024-06-04 16:02:54,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5330 conditions, 735 events. 420/735 cut-off events. For 21979/21979 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3146 event pairs, 76 based on Foata normal form. 2/737 useless extension candidates. Maximal degree in co-relation 5258. Up to 565 conditions per place. [2024-06-04 16:02:54,286 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 104 selfloop transitions, 49 changer transitions 0/155 dead transitions. [2024-06-04 16:02:54,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 155 transitions, 2129 flow [2024-06-04 16:02:54,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:02:54,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:02:54,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-04 16:02:54,301 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3602693602693603 [2024-06-04 16:02:54,301 INFO L175 Difference]: Start difference. First operand has 146 places, 137 transitions, 1648 flow. Second operand 9 states and 107 transitions. [2024-06-04 16:02:54,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 155 transitions, 2129 flow [2024-06-04 16:02:54,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 155 transitions, 2038 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-04 16:02:54,330 INFO L231 Difference]: Finished difference. Result has 150 places, 139 transitions, 1697 flow [2024-06-04 16:02:54,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1559, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1697, PETRI_PLACES=150, PETRI_TRANSITIONS=139} [2024-06-04 16:02:54,331 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 118 predicate places. [2024-06-04 16:02:54,331 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 139 transitions, 1697 flow [2024-06-04 16:02:54,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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 16:02:54,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:02:54,331 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:02:54,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-04 16:02:54,332 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 16:02:54,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:02:54,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1891205620, now seen corresponding path program 2 times [2024-06-04 16:02:54,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:02:54,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562378193] [2024-06-04 16:02:54,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:02:54,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:02:54,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:02:58,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:02:58,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:02:58,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562378193] [2024-06-04 16:02:58,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562378193] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:02:58,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:02:58,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:02:58,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182520328] [2024-06-04 16:02:58,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:02:58,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:02:58,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:02:58,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:02:58,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:02:58,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:02:58,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 139 transitions, 1697 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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 16:02:58,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:02:58,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:02:58,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:02:59,024 INFO L124 PetriNetUnfolderBase]: 442/771 cut-off events. [2024-06-04 16:02:59,024 INFO L125 PetriNetUnfolderBase]: For 25179/25179 co-relation queries the response was YES. [2024-06-04 16:02:59,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5637 conditions, 771 events. 442/771 cut-off events. For 25179/25179 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3339 event pairs, 162 based on Foata normal form. 4/775 useless extension candidates. Maximal degree in co-relation 5563. Up to 720 conditions per place. [2024-06-04 16:02:59,029 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 134 selfloop transitions, 20 changer transitions 0/156 dead transitions. [2024-06-04 16:02:59,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 156 transitions, 2155 flow [2024-06-04 16:02:59,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:02:59,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:02:59,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 102 transitions. [2024-06-04 16:02:59,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3090909090909091 [2024-06-04 16:02:59,031 INFO L175 Difference]: Start difference. First operand has 150 places, 139 transitions, 1697 flow. Second operand 10 states and 102 transitions. [2024-06-04 16:02:59,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 156 transitions, 2155 flow [2024-06-04 16:02:59,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 156 transitions, 1956 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-04 16:02:59,066 INFO L231 Difference]: Finished difference. Result has 152 places, 144 transitions, 1605 flow [2024-06-04 16:02:59,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1498, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1605, PETRI_PLACES=152, PETRI_TRANSITIONS=144} [2024-06-04 16:02:59,066 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 120 predicate places. [2024-06-04 16:02:59,066 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 144 transitions, 1605 flow [2024-06-04 16:02:59,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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 16:02:59,067 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:02:59,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 16:02:59,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-04 16:02:59,067 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 16:02:59,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:02:59,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1131737418, now seen corresponding path program 3 times [2024-06-04 16:02:59,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:02:59,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146901936] [2024-06-04 16:02:59,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:02:59,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:02:59,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:03:03,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:03:03,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:03:03,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146901936] [2024-06-04 16:03:03,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146901936] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:03:03,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:03:03,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:03:03,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122678237] [2024-06-04 16:03:03,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:03:03,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:03:03,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:03:03,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:03:03,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:03:03,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:03:03,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 144 transitions, 1605 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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 16:03:03,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:03:03,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:03:03,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:03:03,755 INFO L124 PetriNetUnfolderBase]: 448/783 cut-off events. [2024-06-04 16:03:03,756 INFO L125 PetriNetUnfolderBase]: For 25389/25389 co-relation queries the response was YES. [2024-06-04 16:03:03,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5539 conditions, 783 events. 448/783 cut-off events. For 25389/25389 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3387 event pairs, 92 based on Foata normal form. 2/785 useless extension candidates. Maximal degree in co-relation 5465. Up to 543 conditions per place. [2024-06-04 16:03:03,761 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 102 selfloop transitions, 58 changer transitions 0/162 dead transitions. [2024-06-04 16:03:03,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 162 transitions, 2097 flow [2024-06-04 16:03:03,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:03:03,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:03:03,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2024-06-04 16:03:03,763 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3501683501683502 [2024-06-04 16:03:03,763 INFO L175 Difference]: Start difference. First operand has 152 places, 144 transitions, 1605 flow. Second operand 9 states and 104 transitions. [2024-06-04 16:03:03,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 162 transitions, 2097 flow [2024-06-04 16:03:03,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 162 transitions, 2045 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-06-04 16:03:03,798 INFO L231 Difference]: Finished difference. Result has 156 places, 148 transitions, 1762 flow [2024-06-04 16:03:03,798 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1553, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1762, PETRI_PLACES=156, PETRI_TRANSITIONS=148} [2024-06-04 16:03:03,799 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 124 predicate places. [2024-06-04 16:03:03,799 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 148 transitions, 1762 flow [2024-06-04 16:03:03,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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 16:03:03,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:03:03,799 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:03:03,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-04 16:03:03,799 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 16:03:03,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:03:03,800 INFO L85 PathProgramCache]: Analyzing trace with hash 226934846, now seen corresponding path program 4 times [2024-06-04 16:03:03,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:03:03,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070464535] [2024-06-04 16:03:03,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:03:03,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:03:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:03:08,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:03:08,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:03:08,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070464535] [2024-06-04 16:03:08,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070464535] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:03:08,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:03:08,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:03:08,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280464505] [2024-06-04 16:03:08,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:03:08,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:03:08,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:03:08,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:03:08,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:03:09,000 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:03:09,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 148 transitions, 1762 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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 16:03:09,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:03:09,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:03:09,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:03:09,455 INFO L124 PetriNetUnfolderBase]: 454/791 cut-off events. [2024-06-04 16:03:09,455 INFO L125 PetriNetUnfolderBase]: For 27106/27106 co-relation queries the response was YES. [2024-06-04 16:03:09,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5815 conditions, 791 events. 454/791 cut-off events. For 27106/27106 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3437 event pairs, 99 based on Foata normal form. 2/793 useless extension candidates. Maximal degree in co-relation 5738. Up to 676 conditions per place. [2024-06-04 16:03:09,462 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 120 selfloop transitions, 40 changer transitions 0/162 dead transitions. [2024-06-04 16:03:09,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 162 transitions, 2157 flow [2024-06-04 16:03:09,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:03:09,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:03:09,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-04 16:03:09,463 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32996632996632996 [2024-06-04 16:03:09,463 INFO L175 Difference]: Start difference. First operand has 156 places, 148 transitions, 1762 flow. Second operand 9 states and 98 transitions. [2024-06-04 16:03:09,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 162 transitions, 2157 flow [2024-06-04 16:03:09,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 162 transitions, 2063 flow, removed 19 selfloop flow, removed 5 redundant places. [2024-06-04 16:03:09,502 INFO L231 Difference]: Finished difference. Result has 160 places, 150 transitions, 1790 flow [2024-06-04 16:03:09,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1672, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1790, PETRI_PLACES=160, PETRI_TRANSITIONS=150} [2024-06-04 16:03:09,503 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 128 predicate places. [2024-06-04 16:03:09,503 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 150 transitions, 1790 flow [2024-06-04 16:03:09,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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 16:03:09,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:03:09,503 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:03:09,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-04 16:03:09,504 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 16:03:09,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:03:09,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1397650024, now seen corresponding path program 10 times [2024-06-04 16:03:09,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:03:09,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005826731] [2024-06-04 16:03:09,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:03:09,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:03:09,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:03:12,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:03:12,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:03:12,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005826731] [2024-06-04 16:03:12,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005826731] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:03:12,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:03:12,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:03:12,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310967567] [2024-06-04 16:03:12,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:03:12,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:03:12,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:03:12,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:03:12,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:03:12,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:03:12,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 150 transitions, 1790 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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 16:03:12,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:03:12,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:03:12,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:03:13,400 INFO L124 PetriNetUnfolderBase]: 450/785 cut-off events. [2024-06-04 16:03:13,400 INFO L125 PetriNetUnfolderBase]: For 27027/27027 co-relation queries the response was YES. [2024-06-04 16:03:13,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5780 conditions, 785 events. 450/785 cut-off events. For 27027/27027 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3405 event pairs, 91 based on Foata normal form. 2/787 useless extension candidates. Maximal degree in co-relation 5701. Up to 635 conditions per place. [2024-06-04 16:03:13,405 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 118 selfloop transitions, 41 changer transitions 0/161 dead transitions. [2024-06-04 16:03:13,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 161 transitions, 2156 flow [2024-06-04 16:03:13,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:03:13,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:03:13,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2024-06-04 16:03:13,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3484848484848485 [2024-06-04 16:03:13,406 INFO L175 Difference]: Start difference. First operand has 160 places, 150 transitions, 1790 flow. Second operand 8 states and 92 transitions. [2024-06-04 16:03:13,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 161 transitions, 2156 flow [2024-06-04 16:03:13,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 161 transitions, 2037 flow, removed 21 selfloop flow, removed 7 redundant places. [2024-06-04 16:03:13,447 INFO L231 Difference]: Finished difference. Result has 161 places, 150 transitions, 1758 flow [2024-06-04 16:03:13,447 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1671, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1758, PETRI_PLACES=161, PETRI_TRANSITIONS=150} [2024-06-04 16:03:13,447 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 129 predicate places. [2024-06-04 16:03:13,447 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 150 transitions, 1758 flow [2024-06-04 16:03:13,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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 16:03:13,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:03:13,448 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:03:13,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-04 16:03:13,448 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 16:03:13,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:03:13,448 INFO L85 PathProgramCache]: Analyzing trace with hash -29775193, now seen corresponding path program 2 times [2024-06-04 16:03:13,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:03:13,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785215500] [2024-06-04 16:03:13,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:03:13,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:03:13,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:03:17,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:03:17,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:03:17,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785215500] [2024-06-04 16:03:17,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785215500] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:03:17,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:03:17,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:03:17,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084571140] [2024-06-04 16:03:17,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:03:17,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:03:17,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:03:17,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:03:17,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:03:17,713 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:03:17,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 150 transitions, 1758 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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 16:03:17,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:03:17,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:03:17,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:03:18,094 INFO L124 PetriNetUnfolderBase]: 448/782 cut-off events. [2024-06-04 16:03:18,094 INFO L125 PetriNetUnfolderBase]: For 27228/27228 co-relation queries the response was YES. [2024-06-04 16:03:18,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5728 conditions, 782 events. 448/782 cut-off events. For 27228/27228 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3382 event pairs, 110 based on Foata normal form. 1/783 useless extension candidates. Maximal degree in co-relation 5648. Up to 699 conditions per place. [2024-06-04 16:03:18,100 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 128 selfloop transitions, 29 changer transitions 0/159 dead transitions. [2024-06-04 16:03:18,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 159 transitions, 2100 flow [2024-06-04 16:03:18,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:03:18,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:03:18,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2024-06-04 16:03:18,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-04 16:03:18,102 INFO L175 Difference]: Start difference. First operand has 161 places, 150 transitions, 1758 flow. Second operand 8 states and 88 transitions. [2024-06-04 16:03:18,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 159 transitions, 2100 flow [2024-06-04 16:03:18,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 159 transitions, 2006 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-04 16:03:18,144 INFO L231 Difference]: Finished difference. Result has 162 places, 150 transitions, 1730 flow [2024-06-04 16:03:18,145 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1664, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1730, PETRI_PLACES=162, PETRI_TRANSITIONS=150} [2024-06-04 16:03:18,145 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 130 predicate places. [2024-06-04 16:03:18,145 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 150 transitions, 1730 flow [2024-06-04 16:03:18,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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 16:03:18,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:03:18,145 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:03:18,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-04 16:03:18,145 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 16:03:18,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:03:18,146 INFO L85 PathProgramCache]: Analyzing trace with hash -792737108, now seen corresponding path program 5 times [2024-06-04 16:03:18,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:03:18,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586804517] [2024-06-04 16:03:18,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:03:18,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:03:18,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:03:22,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 16:03:22,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:03:22,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586804517] [2024-06-04 16:03:22,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586804517] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:03:22,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:03:22,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:03:22,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729211519] [2024-06-04 16:03:22,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:03:22,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:03:22,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:03:22,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:03:22,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:03:22,987 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:03:22,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 150 transitions, 1730 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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 16:03:22,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:03:22,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:03:22,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:03:23,431 INFO L124 PetriNetUnfolderBase]: 449/784 cut-off events. [2024-06-04 16:03:23,431 INFO L125 PetriNetUnfolderBase]: For 28419/28419 co-relation queries the response was YES. [2024-06-04 16:03:23,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5717 conditions, 784 events. 449/784 cut-off events. For 28419/28419 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3396 event pairs, 109 based on Foata normal form. 2/786 useless extension candidates. Maximal degree in co-relation 5636. Up to 699 conditions per place. [2024-06-04 16:03:23,437 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 133 selfloop transitions, 28 changer transitions 0/163 dead transitions. [2024-06-04 16:03:23,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 163 transitions, 2121 flow [2024-06-04 16:03:23,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:03:23,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:03:23,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2024-06-04 16:03:23,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32323232323232326 [2024-06-04 16:03:23,438 INFO L175 Difference]: Start difference. First operand has 162 places, 150 transitions, 1730 flow. Second operand 9 states and 96 transitions. [2024-06-04 16:03:23,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 163 transitions, 2121 flow [2024-06-04 16:03:23,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 163 transitions, 2033 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-04 16:03:23,482 INFO L231 Difference]: Finished difference. Result has 164 places, 152 transitions, 1740 flow [2024-06-04 16:03:23,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1642, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1740, PETRI_PLACES=164, PETRI_TRANSITIONS=152} [2024-06-04 16:03:23,482 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 132 predicate places. [2024-06-04 16:03:23,482 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 152 transitions, 1740 flow [2024-06-04 16:03:23,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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 16:03:23,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:03:23,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:03:23,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-04 16:03:23,483 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 16:03:23,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:03:23,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1131399084, now seen corresponding path program 1 times [2024-06-04 16:03:23,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:03:23,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920231258] [2024-06-04 16:03:23,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:03:23,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:03:23,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:03:29,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 16:03:29,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:03:29,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920231258] [2024-06-04 16:03:29,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920231258] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:03:29,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:03:29,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:03:29,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280871768] [2024-06-04 16:03:29,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:03:29,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:03:29,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:03:29,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:03:29,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:03:29,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:03:29,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 152 transitions, 1740 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:03:29,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:03:29,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:03:29,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:03:29,750 INFO L124 PetriNetUnfolderBase]: 446/779 cut-off events. [2024-06-04 16:03:29,750 INFO L125 PetriNetUnfolderBase]: For 28705/28705 co-relation queries the response was YES. [2024-06-04 16:03:29,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5668 conditions, 779 events. 446/779 cut-off events. For 28705/28705 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3357 event pairs, 168 based on Foata normal form. 2/781 useless extension candidates. Maximal degree in co-relation 5586. Up to 745 conditions per place. [2024-06-04 16:03:29,755 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 144 selfloop transitions, 16 changer transitions 0/162 dead transitions. [2024-06-04 16:03:29,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 162 transitions, 2082 flow [2024-06-04 16:03:29,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:03:29,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:03:29,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2024-06-04 16:03:29,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2909090909090909 [2024-06-04 16:03:29,756 INFO L175 Difference]: Start difference. First operand has 164 places, 152 transitions, 1740 flow. Second operand 10 states and 96 transitions. [2024-06-04 16:03:29,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 162 transitions, 2082 flow [2024-06-04 16:03:29,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 162 transitions, 2003 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-04 16:03:29,800 INFO L231 Difference]: Finished difference. Result has 167 places, 152 transitions, 1697 flow [2024-06-04 16:03:29,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1661, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1697, PETRI_PLACES=167, PETRI_TRANSITIONS=152} [2024-06-04 16:03:29,800 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 135 predicate places. [2024-06-04 16:03:29,801 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 152 transitions, 1697 flow [2024-06-04 16:03:29,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:03:29,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:03:29,801 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:03:29,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-04 16:03:29,801 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 16:03:29,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:03:29,802 INFO L85 PathProgramCache]: Analyzing trace with hash 160098906, now seen corresponding path program 1 times [2024-06-04 16:03:29,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:03:29,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586665310] [2024-06-04 16:03:29,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:03:29,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:03:29,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:03:34,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:03:34,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:03:34,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586665310] [2024-06-04 16:03:34,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586665310] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:03:34,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:03:34,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:03:34,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868256525] [2024-06-04 16:03:34,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:03:34,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:03:34,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:03:34,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:03:34,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:03:34,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:03:34,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 152 transitions, 1697 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:03:34,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:03:34,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:03:34,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:03:34,463 INFO L124 PetriNetUnfolderBase]: 450/787 cut-off events. [2024-06-04 16:03:34,464 INFO L125 PetriNetUnfolderBase]: For 29856/29856 co-relation queries the response was YES. [2024-06-04 16:03:34,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5681 conditions, 787 events. 450/787 cut-off events. For 29856/29856 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3411 event pairs, 81 based on Foata normal form. 2/789 useless extension candidates. Maximal degree in co-relation 5598. Up to 679 conditions per place. [2024-06-04 16:03:34,469 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 138 selfloop transitions, 28 changer transitions 0/168 dead transitions. [2024-06-04 16:03:34,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 168 transitions, 2095 flow [2024-06-04 16:03:34,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:03:34,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:03:34,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2024-06-04 16:03:34,470 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3560606060606061 [2024-06-04 16:03:34,470 INFO L175 Difference]: Start difference. First operand has 167 places, 152 transitions, 1697 flow. Second operand 8 states and 94 transitions. [2024-06-04 16:03:34,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 168 transitions, 2095 flow [2024-06-04 16:03:34,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 168 transitions, 2053 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-04 16:03:34,519 INFO L231 Difference]: Finished difference. Result has 167 places, 153 transitions, 1729 flow [2024-06-04 16:03:34,519 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1655, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1729, PETRI_PLACES=167, PETRI_TRANSITIONS=153} [2024-06-04 16:03:34,520 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 135 predicate places. [2024-06-04 16:03:34,520 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 153 transitions, 1729 flow [2024-06-04 16:03:34,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:03:34,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:03:34,520 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 16:03:34,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-04 16:03:34,520 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 16:03:34,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:03:34,520 INFO L85 PathProgramCache]: Analyzing trace with hash -504896664, now seen corresponding path program 2 times [2024-06-04 16:03:34,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:03:34,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843879551] [2024-06-04 16:03:34,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:03:34,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:03:34,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:03:39,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:03:39,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:03:39,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843879551] [2024-06-04 16:03:39,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843879551] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:03:39,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:03:39,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:03:39,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137396052] [2024-06-04 16:03:39,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:03:39,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:03:39,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:03:39,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:03:39,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:03:39,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:03:39,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 153 transitions, 1729 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:03:39,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:03:39,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:03:39,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:03:39,888 INFO L124 PetriNetUnfolderBase]: 466/819 cut-off events. [2024-06-04 16:03:39,888 INFO L125 PetriNetUnfolderBase]: For 31561/31561 co-relation queries the response was YES. [2024-06-04 16:03:39,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5888 conditions, 819 events. 466/819 cut-off events. For 31561/31561 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3626 event pairs, 75 based on Foata normal form. 2/821 useless extension candidates. Maximal degree in co-relation 5804. Up to 711 conditions per place. [2024-06-04 16:03:39,895 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 150 selfloop transitions, 26 changer transitions 0/178 dead transitions. [2024-06-04 16:03:39,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 178 transitions, 2211 flow [2024-06-04 16:03:39,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:03:39,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:03:39,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2024-06-04 16:03:39,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3393939393939394 [2024-06-04 16:03:39,896 INFO L175 Difference]: Start difference. First operand has 167 places, 153 transitions, 1729 flow. Second operand 10 states and 112 transitions. [2024-06-04 16:03:39,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 178 transitions, 2211 flow [2024-06-04 16:03:39,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 178 transitions, 2139 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-04 16:03:39,949 INFO L231 Difference]: Finished difference. Result has 173 places, 158 transitions, 1790 flow [2024-06-04 16:03:39,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1669, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1790, PETRI_PLACES=173, PETRI_TRANSITIONS=158} [2024-06-04 16:03:39,950 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 141 predicate places. [2024-06-04 16:03:39,950 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 158 transitions, 1790 flow [2024-06-04 16:03:39,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:03:39,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:03:39,951 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:03:39,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-04 16:03:39,951 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 16:03:39,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:03:39,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1218687546, now seen corresponding path program 1 times [2024-06-04 16:03:39,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:03:39,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073056687] [2024-06-04 16:03:39,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:03:39,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:03:39,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:03:44,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:03:44,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:03:44,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073056687] [2024-06-04 16:03:44,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073056687] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:03:44,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:03:44,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:03:44,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295001997] [2024-06-04 16:03:44,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:03:44,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:03:44,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:03:44,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:03:44,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:03:44,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:03:44,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 158 transitions, 1790 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:03:44,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:03:44,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:03:44,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:03:44,948 INFO L124 PetriNetUnfolderBase]: 472/829 cut-off events. [2024-06-04 16:03:44,948 INFO L125 PetriNetUnfolderBase]: For 32943/32943 co-relation queries the response was YES. [2024-06-04 16:03:44,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5995 conditions, 829 events. 472/829 cut-off events. For 32943/32943 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3684 event pairs, 69 based on Foata normal form. 2/831 useless extension candidates. Maximal degree in co-relation 5908. Up to 734 conditions per place. [2024-06-04 16:03:44,955 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 151 selfloop transitions, 26 changer transitions 0/179 dead transitions. [2024-06-04 16:03:44,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 179 transitions, 2253 flow [2024-06-04 16:03:44,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:03:44,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:03:44,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2024-06-04 16:03:44,956 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3393939393939394 [2024-06-04 16:03:44,956 INFO L175 Difference]: Start difference. First operand has 173 places, 158 transitions, 1790 flow. Second operand 10 states and 112 transitions. [2024-06-04 16:03:44,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 179 transitions, 2253 flow [2024-06-04 16:03:45,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 179 transitions, 2203 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-04 16:03:45,014 INFO L231 Difference]: Finished difference. Result has 177 places, 160 transitions, 1829 flow [2024-06-04 16:03:45,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1740, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1829, PETRI_PLACES=177, PETRI_TRANSITIONS=160} [2024-06-04 16:03:45,015 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 145 predicate places. [2024-06-04 16:03:45,015 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 160 transitions, 1829 flow [2024-06-04 16:03:45,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:03:45,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:03:45,015 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 16:03:45,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-04 16:03:45,016 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 16:03:45,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:03:45,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1218682710, now seen corresponding path program 1 times [2024-06-04 16:03:45,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:03:45,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650249333] [2024-06-04 16:03:45,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:03:45,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:03:45,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:03:48,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 16:03:48,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:03:48,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650249333] [2024-06-04 16:03:48,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650249333] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:03:48,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:03:48,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:03:48,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314653073] [2024-06-04 16:03:48,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:03:48,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:03:48,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:03:48,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:03:48,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:03:48,975 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:03:48,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 160 transitions, 1829 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:03:48,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:03:48,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:03:48,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:03:49,389 INFO L124 PetriNetUnfolderBase]: 475/834 cut-off events. [2024-06-04 16:03:49,389 INFO L125 PetriNetUnfolderBase]: For 33561/33561 co-relation queries the response was YES. [2024-06-04 16:03:49,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6107 conditions, 834 events. 475/834 cut-off events. For 33561/33561 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3709 event pairs, 68 based on Foata normal form. 1/835 useless extension candidates. Maximal degree in co-relation 6019. Up to 741 conditions per place. [2024-06-04 16:03:49,395 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 150 selfloop transitions, 27 changer transitions 0/179 dead transitions. [2024-06-04 16:03:49,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 179 transitions, 2294 flow [2024-06-04 16:03:49,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:03:49,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:03:49,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions. [2024-06-04 16:03:49,396 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3468013468013468 [2024-06-04 16:03:49,396 INFO L175 Difference]: Start difference. First operand has 177 places, 160 transitions, 1829 flow. Second operand 9 states and 103 transitions. [2024-06-04 16:03:49,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 179 transitions, 2294 flow [2024-06-04 16:03:49,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 179 transitions, 2221 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-04 16:03:49,458 INFO L231 Difference]: Finished difference. Result has 178 places, 162 transitions, 1862 flow [2024-06-04 16:03:49,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1756, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1862, PETRI_PLACES=178, PETRI_TRANSITIONS=162} [2024-06-04 16:03:49,458 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 146 predicate places. [2024-06-04 16:03:49,459 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 162 transitions, 1862 flow [2024-06-04 16:03:49,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:03:49,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:03:49,459 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 16:03:49,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-04 16:03:49,459 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 16:03:49,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:03:49,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1246039770, now seen corresponding path program 2 times [2024-06-04 16:03:49,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:03:49,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845305025] [2024-06-04 16:03:49,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:03:49,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:03:49,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:03:53,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:03:53,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:03:53,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845305025] [2024-06-04 16:03:53,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845305025] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:03:53,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:03:53,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:03:53,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680069343] [2024-06-04 16:03:53,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:03:53,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:03:53,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:03:53,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:03:53,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:03:53,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:03:53,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 162 transitions, 1862 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:03:53,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:03:53,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:03:53,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:03:54,174 INFO L124 PetriNetUnfolderBase]: 481/844 cut-off events. [2024-06-04 16:03:54,174 INFO L125 PetriNetUnfolderBase]: For 36460/36460 co-relation queries the response was YES. [2024-06-04 16:03:54,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6197 conditions, 844 events. 481/844 cut-off events. For 36460/36460 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3781 event pairs, 60 based on Foata normal form. 2/846 useless extension candidates. Maximal degree in co-relation 6108. Up to 645 conditions per place. [2024-06-04 16:03:54,181 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 126 selfloop transitions, 58 changer transitions 0/186 dead transitions. [2024-06-04 16:03:54,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 186 transitions, 2444 flow [2024-06-04 16:03:54,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:03:54,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:03:54,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-04 16:03:54,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3575757575757576 [2024-06-04 16:03:54,184 INFO L175 Difference]: Start difference. First operand has 178 places, 162 transitions, 1862 flow. Second operand 10 states and 118 transitions. [2024-06-04 16:03:54,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 186 transitions, 2444 flow [2024-06-04 16:03:54,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 186 transitions, 2374 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-04 16:03:54,253 INFO L231 Difference]: Finished difference. Result has 181 places, 164 transitions, 1949 flow [2024-06-04 16:03:54,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1792, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1949, PETRI_PLACES=181, PETRI_TRANSITIONS=164} [2024-06-04 16:03:54,253 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 149 predicate places. [2024-06-04 16:03:54,253 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 164 transitions, 1949 flow [2024-06-04 16:03:54,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:03:54,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:03:54,254 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 16:03:54,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-04 16:03:54,254 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 16:03:54,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:03:54,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1246033012, now seen corresponding path program 1 times [2024-06-04 16:03:54,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:03:54,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363215390] [2024-06-04 16:03:54,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:03:54,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:03:54,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:04:00,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:04:00,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:04:00,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363215390] [2024-06-04 16:04:00,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363215390] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:04:00,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:04:00,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:04:00,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843697329] [2024-06-04 16:04:00,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:04:00,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:04:00,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:04:00,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:04:00,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:04:00,694 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:04:00,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 164 transitions, 1949 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:04:00,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:04:00,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:04:00,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:04:01,170 INFO L124 PetriNetUnfolderBase]: 499/874 cut-off events. [2024-06-04 16:04:01,170 INFO L125 PetriNetUnfolderBase]: For 37823/37823 co-relation queries the response was YES. [2024-06-04 16:04:01,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6501 conditions, 874 events. 499/874 cut-off events. For 37823/37823 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3971 event pairs, 103 based on Foata normal form. 1/875 useless extension candidates. Maximal degree in co-relation 6411. Up to 780 conditions per place. [2024-06-04 16:04:01,176 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 154 selfloop transitions, 33 changer transitions 0/189 dead transitions. [2024-06-04 16:04:01,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 189 transitions, 2475 flow [2024-06-04 16:04:01,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:04:01,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:04:01,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2024-06-04 16:04:01,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3303030303030303 [2024-06-04 16:04:01,177 INFO L175 Difference]: Start difference. First operand has 181 places, 164 transitions, 1949 flow. Second operand 10 states and 109 transitions. [2024-06-04 16:04:01,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 189 transitions, 2475 flow [2024-06-04 16:04:01,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 189 transitions, 2334 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-04 16:04:01,238 INFO L231 Difference]: Finished difference. Result has 184 places, 172 transitions, 1996 flow [2024-06-04 16:04:01,238 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1808, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1996, PETRI_PLACES=184, PETRI_TRANSITIONS=172} [2024-06-04 16:04:01,238 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 152 predicate places. [2024-06-04 16:04:01,238 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 172 transitions, 1996 flow [2024-06-04 16:04:01,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:04:01,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:04:01,239 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 16:04:01,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-04 16:04:01,239 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 16:04:01,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:04:01,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1246217710, now seen corresponding path program 3 times [2024-06-04 16:04:01,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:04:01,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533505297] [2024-06-04 16:04:01,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:04:01,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:04:01,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:04:05,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:04:05,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:04:05,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533505297] [2024-06-04 16:04:05,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533505297] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:04:05,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:04:05,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:04:05,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108135362] [2024-06-04 16:04:05,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:04:05,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:04:05,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:04:05,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:04:05,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:04:05,476 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:04:05,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 172 transitions, 1996 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:04:05,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:04:05,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:04:05,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:04:05,960 INFO L124 PetriNetUnfolderBase]: 503/882 cut-off events. [2024-06-04 16:04:05,960 INFO L125 PetriNetUnfolderBase]: For 39887/39887 co-relation queries the response was YES. [2024-06-04 16:04:05,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6526 conditions, 882 events. 503/882 cut-off events. For 39887/39887 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4000 event pairs, 74 based on Foata normal form. 2/884 useless extension candidates. Maximal degree in co-relation 6434. Up to 733 conditions per place. [2024-06-04 16:04:05,968 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 146 selfloop transitions, 42 changer transitions 0/190 dead transitions. [2024-06-04 16:04:05,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 190 transitions, 2452 flow [2024-06-04 16:04:05,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:04:05,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:04:05,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2024-06-04 16:04:05,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35353535353535354 [2024-06-04 16:04:05,970 INFO L175 Difference]: Start difference. First operand has 184 places, 172 transitions, 1996 flow. Second operand 9 states and 105 transitions. [2024-06-04 16:04:05,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 190 transitions, 2452 flow [2024-06-04 16:04:06,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 190 transitions, 2364 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-06-04 16:04:06,042 INFO L231 Difference]: Finished difference. Result has 187 places, 173 transitions, 2012 flow [2024-06-04 16:04:06,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1908, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2012, PETRI_PLACES=187, PETRI_TRANSITIONS=173} [2024-06-04 16:04:06,043 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 155 predicate places. [2024-06-04 16:04:06,043 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 173 transitions, 2012 flow [2024-06-04 16:04:06,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:04:06,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:04:06,043 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 16:04:06,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-04 16:04:06,043 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 16:04:06,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:04:06,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1246033260, now seen corresponding path program 3 times [2024-06-04 16:04:06,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:04:06,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952603432] [2024-06-04 16:04:06,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:04:06,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:04:06,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:04:10,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:04:10,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:04:10,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952603432] [2024-06-04 16:04:10,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952603432] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:04:10,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:04:10,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:04:10,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956837699] [2024-06-04 16:04:10,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:04:10,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:04:10,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:04:10,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:04:10,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:04:10,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:04:10,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 173 transitions, 2012 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:04:10,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:04:10,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:04:10,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:04:11,385 INFO L124 PetriNetUnfolderBase]: 519/908 cut-off events. [2024-06-04 16:04:11,385 INFO L125 PetriNetUnfolderBase]: For 44208/44208 co-relation queries the response was YES. [2024-06-04 16:04:11,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6828 conditions, 908 events. 519/908 cut-off events. For 44208/44208 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4158 event pairs, 65 based on Foata normal form. 2/910 useless extension candidates. Maximal degree in co-relation 6737. Up to 662 conditions per place. [2024-06-04 16:04:11,392 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 133 selfloop transitions, 66 changer transitions 0/201 dead transitions. [2024-06-04 16:04:11,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 201 transitions, 2768 flow [2024-06-04 16:04:11,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:04:11,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:04:11,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2024-06-04 16:04:11,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2024-06-04 16:04:11,396 INFO L175 Difference]: Start difference. First operand has 187 places, 173 transitions, 2012 flow. Second operand 10 states and 121 transitions. [2024-06-04 16:04:11,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 201 transitions, 2768 flow [2024-06-04 16:04:11,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 201 transitions, 2674 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-04 16:04:11,468 INFO L231 Difference]: Finished difference. Result has 190 places, 177 transitions, 2132 flow [2024-06-04 16:04:11,468 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1918, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2132, PETRI_PLACES=190, PETRI_TRANSITIONS=177} [2024-06-04 16:04:11,469 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 158 predicate places. [2024-06-04 16:04:11,469 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 177 transitions, 2132 flow [2024-06-04 16:04:11,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:04:11,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:04:11,469 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 16:04:11,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-04 16:04:11,469 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 16:04:11,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:04:11,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1333978716, now seen corresponding path program 4 times [2024-06-04 16:04:11,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:04:11,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424130633] [2024-06-04 16:04:11,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:04:11,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:04:11,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:04:15,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:04:15,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:04:15,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424130633] [2024-06-04 16:04:15,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424130633] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:04:15,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:04:15,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:04:15,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953208522] [2024-06-04 16:04:15,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:04:15,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:04:15,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:04:15,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:04:15,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:04:15,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:04:15,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 177 transitions, 2132 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:04:15,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:04:15,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:04:15,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:04:16,007 INFO L124 PetriNetUnfolderBase]: 525/918 cut-off events. [2024-06-04 16:04:16,007 INFO L125 PetriNetUnfolderBase]: For 46327/46327 co-relation queries the response was YES. [2024-06-04 16:04:16,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7028 conditions, 918 events. 525/918 cut-off events. For 46327/46327 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4222 event pairs, 74 based on Foata normal form. 2/920 useless extension candidates. Maximal degree in co-relation 6936. Up to 759 conditions per place. [2024-06-04 16:04:16,014 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 151 selfloop transitions, 45 changer transitions 0/198 dead transitions. [2024-06-04 16:04:16,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 198 transitions, 2646 flow [2024-06-04 16:04:16,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:04:16,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:04:16,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-04 16:04:16,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3484848484848485 [2024-06-04 16:04:16,015 INFO L175 Difference]: Start difference. First operand has 190 places, 177 transitions, 2132 flow. Second operand 10 states and 115 transitions. [2024-06-04 16:04:16,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 198 transitions, 2646 flow [2024-06-04 16:04:16,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 198 transitions, 2535 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-04 16:04:16,100 INFO L231 Difference]: Finished difference. Result has 194 places, 179 transitions, 2160 flow [2024-06-04 16:04:16,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2025, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2160, PETRI_PLACES=194, PETRI_TRANSITIONS=179} [2024-06-04 16:04:16,101 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 162 predicate places. [2024-06-04 16:04:16,101 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 179 transitions, 2160 flow [2024-06-04 16:04:16,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:04:16,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:04:16,101 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 16:04:16,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-04 16:04:16,101 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 16:04:16,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:04:16,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1125197256, now seen corresponding path program 4 times [2024-06-04 16:04:16,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:04:16,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936461991] [2024-06-04 16:04:16,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:04:16,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:04:16,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:04:20,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:04:20,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:04:20,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936461991] [2024-06-04 16:04:20,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936461991] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:04:20,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:04:20,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:04:20,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536514411] [2024-06-04 16:04:20,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:04:20,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:04:20,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:04:20,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:04:20,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:04:20,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:04:20,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 179 transitions, 2160 flow. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:04:20,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:04:20,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:04:20,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:04:20,587 INFO L124 PetriNetUnfolderBase]: 526/927 cut-off events. [2024-06-04 16:04:20,587 INFO L125 PetriNetUnfolderBase]: For 49638/49643 co-relation queries the response was YES. [2024-06-04 16:04:20,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7229 conditions, 927 events. 526/927 cut-off events. For 49638/49643 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4320 event pairs, 83 based on Foata normal form. 6/931 useless extension candidates. Maximal degree in co-relation 7135. Up to 724 conditions per place. [2024-06-04 16:04:20,593 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 138 selfloop transitions, 43 changer transitions 0/191 dead transitions. [2024-06-04 16:04:20,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 191 transitions, 2676 flow [2024-06-04 16:04:20,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:04:20,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:04:20,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2024-06-04 16:04:20,594 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3722943722943723 [2024-06-04 16:04:20,594 INFO L175 Difference]: Start difference. First operand has 194 places, 179 transitions, 2160 flow. Second operand 7 states and 86 transitions. [2024-06-04 16:04:20,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 191 transitions, 2676 flow [2024-06-04 16:04:20,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 191 transitions, 2561 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-04 16:04:20,680 INFO L231 Difference]: Finished difference. Result has 193 places, 181 transitions, 2171 flow [2024-06-04 16:04:20,680 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2045, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2171, PETRI_PLACES=193, PETRI_TRANSITIONS=181} [2024-06-04 16:04:20,680 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 161 predicate places. [2024-06-04 16:04:20,680 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 181 transitions, 2171 flow [2024-06-04 16:04:20,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:04:20,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:04:20,681 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:04:20,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-04 16:04:20,681 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 16:04:20,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:04:20,681 INFO L85 PathProgramCache]: Analyzing trace with hash -350334456, now seen corresponding path program 2 times [2024-06-04 16:04:20,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:04:20,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492751123] [2024-06-04 16:04:20,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:04:20,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:04:20,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:04:24,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 16:04:24,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:04:24,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492751123] [2024-06-04 16:04:24,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492751123] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:04:24,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:04:24,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:04:24,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226617160] [2024-06-04 16:04:24,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:04:24,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:04:24,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:04:24,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:04:24,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:04:24,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:04:24,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 181 transitions, 2171 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:04:24,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:04:24,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:04:24,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:04:24,824 INFO L124 PetriNetUnfolderBase]: 534/936 cut-off events. [2024-06-04 16:04:24,824 INFO L125 PetriNetUnfolderBase]: For 50140/50140 co-relation queries the response was YES. [2024-06-04 16:04:24,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7245 conditions, 936 events. 534/936 cut-off events. For 50140/50140 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4349 event pairs, 85 based on Foata normal form. 1/937 useless extension candidates. Maximal degree in co-relation 7150. Up to 831 conditions per place. [2024-06-04 16:04:24,831 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 162 selfloop transitions, 34 changer transitions 0/198 dead transitions. [2024-06-04 16:04:24,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 198 transitions, 2623 flow [2024-06-04 16:04:24,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:04:24,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:04:24,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2024-06-04 16:04:24,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-04 16:04:24,833 INFO L175 Difference]: Start difference. First operand has 193 places, 181 transitions, 2171 flow. Second operand 10 states and 110 transitions. [2024-06-04 16:04:24,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 198 transitions, 2623 flow [2024-06-04 16:04:24,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 198 transitions, 2552 flow, removed 13 selfloop flow, removed 3 redundant places. [2024-06-04 16:04:24,924 INFO L231 Difference]: Finished difference. Result has 200 places, 181 transitions, 2176 flow [2024-06-04 16:04:24,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2100, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2176, PETRI_PLACES=200, PETRI_TRANSITIONS=181} [2024-06-04 16:04:24,925 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 168 predicate places. [2024-06-04 16:04:24,925 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 181 transitions, 2176 flow [2024-06-04 16:04:24,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:04:24,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:04:24,925 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 16:04:24,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-04 16:04:24,925 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 16:04:24,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:04:24,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1989120936, now seen corresponding path program 5 times [2024-06-04 16:04:24,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:04:24,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264965643] [2024-06-04 16:04:24,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:04:24,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:04:24,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:04:29,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:04:29,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:04:29,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264965643] [2024-06-04 16:04:29,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264965643] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:04:29,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:04:29,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:04:29,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405267386] [2024-06-04 16:04:29,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:04:29,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:04:29,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:04:29,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:04:29,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:04:29,938 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:04:29,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 181 transitions, 2176 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:04:29,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:04:29,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:04:29,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:04:30,402 INFO L124 PetriNetUnfolderBase]: 541/948 cut-off events. [2024-06-04 16:04:30,402 INFO L125 PetriNetUnfolderBase]: For 54218/54218 co-relation queries the response was YES. [2024-06-04 16:04:30,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7370 conditions, 948 events. 541/948 cut-off events. For 54218/54218 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4427 event pairs, 90 based on Foata normal form. 4/952 useless extension candidates. Maximal degree in co-relation 7273. Up to 809 conditions per place. [2024-06-04 16:04:30,411 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 158 selfloop transitions, 40 changer transitions 0/200 dead transitions. [2024-06-04 16:04:30,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 200 transitions, 2706 flow [2024-06-04 16:04:30,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:04:30,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:04:30,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-04 16:04:30,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.367003367003367 [2024-06-04 16:04:30,412 INFO L175 Difference]: Start difference. First operand has 200 places, 181 transitions, 2176 flow. Second operand 9 states and 109 transitions. [2024-06-04 16:04:30,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 200 transitions, 2706 flow [2024-06-04 16:04:30,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 200 transitions, 2588 flow, removed 10 selfloop flow, removed 10 redundant places. [2024-06-04 16:04:30,520 INFO L231 Difference]: Finished difference. Result has 199 places, 185 transitions, 2237 flow [2024-06-04 16:04:30,521 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2058, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2237, PETRI_PLACES=199, PETRI_TRANSITIONS=185} [2024-06-04 16:04:30,521 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 167 predicate places. [2024-06-04 16:04:30,521 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 185 transitions, 2237 flow [2024-06-04 16:04:30,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:04:30,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:04:30,522 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 16:04:30,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-04 16:04:30,522 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 16:04:30,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:04:30,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1860049502, now seen corresponding path program 1 times [2024-06-04 16:04:30,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:04:30,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052488322] [2024-06-04 16:04:30,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:04:30,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:04:30,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:04:35,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:04:35,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:04:35,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052488322] [2024-06-04 16:04:35,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052488322] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:04:35,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:04:35,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:04:35,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042258515] [2024-06-04 16:04:35,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:04:35,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:04:35,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:04:35,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:04:35,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:04:36,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:04:36,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 185 transitions, 2237 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:04:36,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:04:36,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:04:36,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:04:36,684 INFO L124 PetriNetUnfolderBase]: 547/959 cut-off events. [2024-06-04 16:04:36,684 INFO L125 PetriNetUnfolderBase]: For 54099/54099 co-relation queries the response was YES. [2024-06-04 16:04:36,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7493 conditions, 959 events. 547/959 cut-off events. For 54099/54099 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4502 event pairs, 126 based on Foata normal form. 2/961 useless extension candidates. Maximal degree in co-relation 7396. Up to 865 conditions per place. [2024-06-04 16:04:36,690 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 172 selfloop transitions, 33 changer transitions 0/207 dead transitions. [2024-06-04 16:04:36,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 207 transitions, 2754 flow [2024-06-04 16:04:36,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:04:36,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:04:36,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 116 transitions. [2024-06-04 16:04:36,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31955922865013775 [2024-06-04 16:04:36,691 INFO L175 Difference]: Start difference. First operand has 199 places, 185 transitions, 2237 flow. Second operand 11 states and 116 transitions. [2024-06-04 16:04:36,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 207 transitions, 2754 flow [2024-06-04 16:04:36,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 207 transitions, 2612 flow, removed 34 selfloop flow, removed 8 redundant places. [2024-06-04 16:04:36,790 INFO L231 Difference]: Finished difference. Result has 203 places, 190 transitions, 2232 flow [2024-06-04 16:04:36,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2095, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2232, PETRI_PLACES=203, PETRI_TRANSITIONS=190} [2024-06-04 16:04:36,790 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 171 predicate places. [2024-06-04 16:04:36,791 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 190 transitions, 2232 flow [2024-06-04 16:04:36,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:04:36,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:04:36,791 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 16:04:36,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-04 16:04:36,791 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 16:04:36,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:04:36,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1074637990, now seen corresponding path program 5 times [2024-06-04 16:04:36,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:04:36,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475661510] [2024-06-04 16:04:36,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:04:36,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:04:36,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:04:41,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:04:41,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:04:41,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475661510] [2024-06-04 16:04:41,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475661510] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:04:41,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:04:41,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:04:41,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978582003] [2024-06-04 16:04:41,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:04:41,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:04:41,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:04:41,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:04:41,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:04:41,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:04:41,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 190 transitions, 2232 flow. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:04:41,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:04:41,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:04:41,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:04:42,098 INFO L124 PetriNetUnfolderBase]: 544/953 cut-off events. [2024-06-04 16:04:42,098 INFO L125 PetriNetUnfolderBase]: For 47878/47878 co-relation queries the response was YES. [2024-06-04 16:04:42,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7225 conditions, 953 events. 544/953 cut-off events. For 47878/47878 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4426 event pairs, 108 based on Foata normal form. 2/955 useless extension candidates. Maximal degree in co-relation 7127. Up to 829 conditions per place. [2024-06-04 16:04:42,106 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 167 selfloop transitions, 34 changer transitions 0/203 dead transitions. [2024-06-04 16:04:42,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 203 transitions, 2672 flow [2024-06-04 16:04:42,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:04:42,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:04:42,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2024-06-04 16:04:42,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3409090909090909 [2024-06-04 16:04:42,107 INFO L175 Difference]: Start difference. First operand has 203 places, 190 transitions, 2232 flow. Second operand 8 states and 90 transitions. [2024-06-04 16:04:42,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 203 transitions, 2672 flow [2024-06-04 16:04:42,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 203 transitions, 2607 flow, removed 13 selfloop flow, removed 3 redundant places. [2024-06-04 16:04:42,196 INFO L231 Difference]: Finished difference. Result has 208 places, 190 transitions, 2246 flow [2024-06-04 16:04:42,197 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2167, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2246, PETRI_PLACES=208, PETRI_TRANSITIONS=190} [2024-06-04 16:04:42,197 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 176 predicate places. [2024-06-04 16:04:42,197 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 190 transitions, 2246 flow [2024-06-04 16:04:42,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:04:42,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:04:42,197 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 16:04:42,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-04 16:04:42,197 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 16:04:42,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:04:42,198 INFO L85 PathProgramCache]: Analyzing trace with hash -937390860, now seen corresponding path program 3 times [2024-06-04 16:04:42,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:04:42,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132840697] [2024-06-04 16:04:42,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:04:42,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:04:42,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:04:46,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:04:46,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:04:46,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132840697] [2024-06-04 16:04:46,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132840697] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:04:46,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:04:46,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:04:46,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33260837] [2024-06-04 16:04:46,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:04:46,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:04:46,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:04:46,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:04:46,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:04:46,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:04:46,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 190 transitions, 2246 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:04:46,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:04:46,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:04:46,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:04:46,926 INFO L124 PetriNetUnfolderBase]: 542/950 cut-off events. [2024-06-04 16:04:46,926 INFO L125 PetriNetUnfolderBase]: For 47521/47521 co-relation queries the response was YES. [2024-06-04 16:04:46,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7199 conditions, 950 events. 542/950 cut-off events. For 47521/47521 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4401 event pairs, 105 based on Foata normal form. 1/951 useless extension candidates. Maximal degree in co-relation 7100. Up to 817 conditions per place. [2024-06-04 16:04:46,934 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 158 selfloop transitions, 43 changer transitions 0/203 dead transitions. [2024-06-04 16:04:46,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 203 transitions, 2692 flow [2024-06-04 16:04:46,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:04:46,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:04:46,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions. [2024-06-04 16:04:46,935 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3446969696969697 [2024-06-04 16:04:46,935 INFO L175 Difference]: Start difference. First operand has 208 places, 190 transitions, 2246 flow. Second operand 8 states and 91 transitions. [2024-06-04 16:04:46,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 203 transitions, 2692 flow [2024-06-04 16:04:47,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 203 transitions, 2612 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-04 16:04:47,030 INFO L231 Difference]: Finished difference. Result has 209 places, 190 transitions, 2272 flow [2024-06-04 16:04:47,030 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2166, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2272, PETRI_PLACES=209, PETRI_TRANSITIONS=190} [2024-06-04 16:04:47,031 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 177 predicate places. [2024-06-04 16:04:47,031 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 190 transitions, 2272 flow [2024-06-04 16:04:47,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:04:47,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:04:47,031 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:04:47,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-04 16:04:47,031 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 16:04:47,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:04:47,031 INFO L85 PathProgramCache]: Analyzing trace with hash -164117560, now seen corresponding path program 6 times [2024-06-04 16:04:47,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:04:47,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346702176] [2024-06-04 16:04:47,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:04:47,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:04:47,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:04:51,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:04:51,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:04:51,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346702176] [2024-06-04 16:04:51,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346702176] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:04:51,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:04:51,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:04:51,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519775284] [2024-06-04 16:04:51,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:04:51,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:04:51,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:04:51,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:04:51,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:04:51,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:04:51,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 190 transitions, 2272 flow. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:04:51,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:04:51,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:04:51,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:04:52,010 INFO L124 PetriNetUnfolderBase]: 546/958 cut-off events. [2024-06-04 16:04:52,010 INFO L125 PetriNetUnfolderBase]: For 50641/50641 co-relation queries the response was YES. [2024-06-04 16:04:52,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7315 conditions, 958 events. 546/958 cut-off events. For 50641/50641 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4463 event pairs, 78 based on Foata normal form. 2/960 useless extension candidates. Maximal degree in co-relation 7215. Up to 803 conditions per place. [2024-06-04 16:04:52,019 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 156 selfloop transitions, 45 changer transitions 0/203 dead transitions. [2024-06-04 16:04:52,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 203 transitions, 2732 flow [2024-06-04 16:04:52,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:04:52,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:04:52,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2024-06-04 16:04:52,019 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3522727272727273 [2024-06-04 16:04:52,019 INFO L175 Difference]: Start difference. First operand has 209 places, 190 transitions, 2272 flow. Second operand 8 states and 93 transitions. [2024-06-04 16:04:52,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 203 transitions, 2732 flow [2024-06-04 16:04:52,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 203 transitions, 2604 flow, removed 6 selfloop flow, removed 9 redundant places. [2024-06-04 16:04:52,124 INFO L231 Difference]: Finished difference. Result has 208 places, 191 transitions, 2260 flow [2024-06-04 16:04:52,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2144, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2260, PETRI_PLACES=208, PETRI_TRANSITIONS=191} [2024-06-04 16:04:52,124 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 176 predicate places. [2024-06-04 16:04:52,125 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 191 transitions, 2260 flow [2024-06-04 16:04:52,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:04:52,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:04:52,125 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 16:04:52,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-04 16:04:52,125 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 16:04:52,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:04:52,125 INFO L85 PathProgramCache]: Analyzing trace with hash -163517954, now seen corresponding path program 6 times [2024-06-04 16:04:52,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:04:52,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374928710] [2024-06-04 16:04:52,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:04:52,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:04:52,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:04:56,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:04:56,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:04:56,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374928710] [2024-06-04 16:04:56,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374928710] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:04:56,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:04:56,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:04:56,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807791358] [2024-06-04 16:04:56,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:04:56,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:04:56,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:04:56,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:04:56,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:04:56,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:04:56,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 191 transitions, 2260 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:04:56,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:04:56,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:04:56,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:04:56,930 INFO L124 PetriNetUnfolderBase]: 552/968 cut-off events. [2024-06-04 16:04:56,930 INFO L125 PetriNetUnfolderBase]: For 49007/49007 co-relation queries the response was YES. [2024-06-04 16:04:56,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7332 conditions, 968 events. 552/968 cut-off events. For 49007/49007 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4515 event pairs, 78 based on Foata normal form. 2/970 useless extension candidates. Maximal degree in co-relation 7233. Up to 793 conditions per place. [2024-06-04 16:04:56,938 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 154 selfloop transitions, 51 changer transitions 0/207 dead transitions. [2024-06-04 16:04:56,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 207 transitions, 2766 flow [2024-06-04 16:04:56,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:04:56,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:04:56,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions. [2024-06-04 16:04:56,939 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3468013468013468 [2024-06-04 16:04:56,939 INFO L175 Difference]: Start difference. First operand has 208 places, 191 transitions, 2260 flow. Second operand 9 states and 103 transitions. [2024-06-04 16:04:56,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 207 transitions, 2766 flow [2024-06-04 16:04:57,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 207 transitions, 2662 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-04 16:04:57,053 INFO L231 Difference]: Finished difference. Result has 211 places, 193 transitions, 2310 flow [2024-06-04 16:04:57,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2156, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2310, PETRI_PLACES=211, PETRI_TRANSITIONS=193} [2024-06-04 16:04:57,053 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 179 predicate places. [2024-06-04 16:04:57,053 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 193 transitions, 2310 flow [2024-06-04 16:04:57,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:04:57,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:04:57,054 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:04:57,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-04 16:04:57,054 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 16:04:57,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:04:57,055 INFO L85 PathProgramCache]: Analyzing trace with hash -163338216, now seen corresponding path program 2 times [2024-06-04 16:04:57,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:04:57,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402811922] [2024-06-04 16:04:57,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:04:57,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:04:57,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:05:02,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:05:02,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:05:02,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402811922] [2024-06-04 16:05:02,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402811922] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:05:02,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:05:02,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:05:02,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941380647] [2024-06-04 16:05:02,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:05:02,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:05:02,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:05:02,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:05:02,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:05:02,780 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:05:02,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 193 transitions, 2310 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:05:02,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:05:02,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:05:02,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:05:03,328 INFO L124 PetriNetUnfolderBase]: 555/973 cut-off events. [2024-06-04 16:05:03,328 INFO L125 PetriNetUnfolderBase]: For 48100/48100 co-relation queries the response was YES. [2024-06-04 16:05:03,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7406 conditions, 973 events. 555/973 cut-off events. For 48100/48100 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4563 event pairs, 133 based on Foata normal form. 1/974 useless extension candidates. Maximal degree in co-relation 7306. Up to 848 conditions per place. [2024-06-04 16:05:03,336 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 160 selfloop transitions, 46 changer transitions 0/208 dead transitions. [2024-06-04 16:05:03,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 208 transitions, 2805 flow [2024-06-04 16:05:03,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:05:03,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:05:03,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2024-06-04 16:05:03,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-04 16:05:03,337 INFO L175 Difference]: Start difference. First operand has 211 places, 193 transitions, 2310 flow. Second operand 9 states and 99 transitions. [2024-06-04 16:05:03,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 208 transitions, 2805 flow [2024-06-04 16:05:03,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 208 transitions, 2677 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-04 16:05:03,433 INFO L231 Difference]: Finished difference. Result has 213 places, 195 transitions, 2333 flow [2024-06-04 16:05:03,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2182, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2333, PETRI_PLACES=213, PETRI_TRANSITIONS=195} [2024-06-04 16:05:03,433 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 181 predicate places. [2024-06-04 16:05:03,433 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 195 transitions, 2333 flow [2024-06-04 16:05:03,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:05:03,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:05:03,434 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 16:05:03,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-04 16:05:03,434 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 16:05:03,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:05:03,434 INFO L85 PathProgramCache]: Analyzing trace with hash -163338464, now seen corresponding path program 7 times [2024-06-04 16:05:03,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:05:03,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044689577] [2024-06-04 16:05:03,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:05:03,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:05:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:05:07,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:05:07,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:05:07,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044689577] [2024-06-04 16:05:07,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044689577] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:05:07,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:05:07,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:05:07,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622161752] [2024-06-04 16:05:07,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:05:07,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:05:07,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:05:07,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:05:07,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:05:07,833 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:05:07,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 195 transitions, 2333 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:05:07,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:05:07,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:05:07,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:05:08,318 INFO L124 PetriNetUnfolderBase]: 571/999 cut-off events. [2024-06-04 16:05:08,318 INFO L125 PetriNetUnfolderBase]: For 53551/53551 co-relation queries the response was YES. [2024-06-04 16:05:08,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7735 conditions, 999 events. 571/999 cut-off events. For 53551/53551 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4707 event pairs, 63 based on Foata normal form. 2/1001 useless extension candidates. Maximal degree in co-relation 7634. Up to 668 conditions per place. [2024-06-04 16:05:08,326 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 122 selfloop transitions, 93 changer transitions 0/217 dead transitions. [2024-06-04 16:05:08,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 217 transitions, 3031 flow [2024-06-04 16:05:08,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:05:08,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:05:08,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2024-06-04 16:05:08,328 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-04 16:05:08,328 INFO L175 Difference]: Start difference. First operand has 213 places, 195 transitions, 2333 flow. Second operand 9 states and 108 transitions. [2024-06-04 16:05:08,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 217 transitions, 3031 flow [2024-06-04 16:05:08,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 217 transitions, 2911 flow, removed 20 selfloop flow, removed 7 redundant places. [2024-06-04 16:05:08,433 INFO L231 Difference]: Finished difference. Result has 215 places, 199 transitions, 2505 flow [2024-06-04 16:05:08,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2217, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2505, PETRI_PLACES=215, PETRI_TRANSITIONS=199} [2024-06-04 16:05:08,433 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 183 predicate places. [2024-06-04 16:05:08,433 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 199 transitions, 2505 flow [2024-06-04 16:05:08,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:05:08,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:05:08,434 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 16:05:08,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-04 16:05:08,434 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 16:05:08,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:05:08,434 INFO L85 PathProgramCache]: Analyzing trace with hash -163344974, now seen corresponding path program 8 times [2024-06-04 16:05:08,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:05:08,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980060376] [2024-06-04 16:05:08,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:05:08,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:05:08,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:05:12,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:05:12,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:05:12,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980060376] [2024-06-04 16:05:12,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980060376] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:05:12,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:05:12,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:05:12,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942584785] [2024-06-04 16:05:12,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:05:12,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:05:12,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:05:12,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:05:12,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:05:12,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:05:12,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 199 transitions, 2505 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:05:12,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:05:12,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:05:12,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:05:13,184 INFO L124 PetriNetUnfolderBase]: 572/1001 cut-off events. [2024-06-04 16:05:13,185 INFO L125 PetriNetUnfolderBase]: For 51415/51415 co-relation queries the response was YES. [2024-06-04 16:05:13,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7818 conditions, 1001 events. 572/1001 cut-off events. For 51415/51415 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4733 event pairs, 63 based on Foata normal form. 2/1003 useless extension candidates. Maximal degree in co-relation 7716. Up to 759 conditions per place. [2024-06-04 16:05:13,193 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 142 selfloop transitions, 73 changer transitions 0/217 dead transitions. [2024-06-04 16:05:13,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 217 transitions, 3053 flow [2024-06-04 16:05:13,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:05:13,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:05:13,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2024-06-04 16:05:13,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35353535353535354 [2024-06-04 16:05:13,194 INFO L175 Difference]: Start difference. First operand has 215 places, 199 transitions, 2505 flow. Second operand 9 states and 105 transitions. [2024-06-04 16:05:13,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 217 transitions, 3053 flow [2024-06-04 16:05:13,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 217 transitions, 2911 flow, removed 25 selfloop flow, removed 6 redundant places. [2024-06-04 16:05:13,306 INFO L231 Difference]: Finished difference. Result has 218 places, 201 transitions, 2569 flow [2024-06-04 16:05:13,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2367, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2569, PETRI_PLACES=218, PETRI_TRANSITIONS=201} [2024-06-04 16:05:13,306 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 186 predicate places. [2024-06-04 16:05:13,307 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 201 transitions, 2569 flow [2024-06-04 16:05:13,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:05:13,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:05:13,307 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 16:05:13,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-04 16:05:13,307 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 16:05:13,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:05:13,308 INFO L85 PathProgramCache]: Analyzing trace with hash 8796348, now seen corresponding path program 2 times [2024-06-04 16:05:13,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:05:13,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435468048] [2024-06-04 16:05:13,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:05:13,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:05:13,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:05:19,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 16:05:19,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:05:19,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435468048] [2024-06-04 16:05:19,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435468048] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:05:19,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:05:19,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:05:19,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775629482] [2024-06-04 16:05:19,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:05:19,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:05:19,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:05:19,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:05:19,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:05:19,338 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:05:19,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 201 transitions, 2569 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:05:19,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:05:19,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:05:19,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:05:20,022 INFO L124 PetriNetUnfolderBase]: 568/996 cut-off events. [2024-06-04 16:05:20,022 INFO L125 PetriNetUnfolderBase]: For 49784/49784 co-relation queries the response was YES. [2024-06-04 16:05:20,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7732 conditions, 996 events. 568/996 cut-off events. For 49784/49784 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4761 event pairs, 120 based on Foata normal form. 2/998 useless extension candidates. Maximal degree in co-relation 7629. Up to 872 conditions per place. [2024-06-04 16:05:20,031 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 173 selfloop transitions, 41 changer transitions 0/216 dead transitions. [2024-06-04 16:05:20,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 216 transitions, 3047 flow [2024-06-04 16:05:20,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:05:20,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:05:20,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-04 16:05:20,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3242424242424242 [2024-06-04 16:05:20,032 INFO L175 Difference]: Start difference. First operand has 218 places, 201 transitions, 2569 flow. Second operand 10 states and 107 transitions. [2024-06-04 16:05:20,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 216 transitions, 3047 flow [2024-06-04 16:05:20,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 216 transitions, 2871 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-04 16:05:20,131 INFO L231 Difference]: Finished difference. Result has 221 places, 201 transitions, 2483 flow [2024-06-04 16:05:20,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2393, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2483, PETRI_PLACES=221, PETRI_TRANSITIONS=201} [2024-06-04 16:05:20,131 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 189 predicate places. [2024-06-04 16:05:20,131 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 201 transitions, 2483 flow [2024-06-04 16:05:20,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:05:20,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:05:20,132 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 16:05:20,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-04 16:05:20,132 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 16:05:20,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:05:20,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1000648414, now seen corresponding path program 7 times [2024-06-04 16:05:20,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:05:20,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250594312] [2024-06-04 16:05:20,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:05:20,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:05:20,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:05:24,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:05:24,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:05:24,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250594312] [2024-06-04 16:05:24,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250594312] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:05:24,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:05:24,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:05:24,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498449472] [2024-06-04 16:05:24,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:05:24,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:05:24,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:05:24,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:05:24,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:05:25,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:05:25,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 201 transitions, 2483 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:05:25,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:05:25,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:05:25,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:05:25,555 INFO L124 PetriNetUnfolderBase]: 565/990 cut-off events. [2024-06-04 16:05:25,555 INFO L125 PetriNetUnfolderBase]: For 47205/47205 co-relation queries the response was YES. [2024-06-04 16:05:25,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7522 conditions, 990 events. 565/990 cut-off events. For 47205/47205 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4668 event pairs, 89 based on Foata normal form. 2/992 useless extension candidates. Maximal degree in co-relation 7418. Up to 841 conditions per place. [2024-06-04 16:05:25,562 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 168 selfloop transitions, 42 changer transitions 0/212 dead transitions. [2024-06-04 16:05:25,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 212 transitions, 2945 flow [2024-06-04 16:05:25,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:05:25,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:05:25,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions. [2024-06-04 16:05:25,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3446969696969697 [2024-06-04 16:05:25,563 INFO L175 Difference]: Start difference. First operand has 221 places, 201 transitions, 2483 flow. Second operand 8 states and 91 transitions. [2024-06-04 16:05:25,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 212 transitions, 2945 flow [2024-06-04 16:05:25,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 212 transitions, 2851 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-04 16:05:25,661 INFO L231 Difference]: Finished difference. Result has 220 places, 201 transitions, 2477 flow [2024-06-04 16:05:25,662 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2389, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2477, PETRI_PLACES=220, PETRI_TRANSITIONS=201} [2024-06-04 16:05:25,662 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 188 predicate places. [2024-06-04 16:05:25,662 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 201 transitions, 2477 flow [2024-06-04 16:05:25,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:05:25,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:05:25,662 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:05:25,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-04 16:05:25,662 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 16:05:25,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:05:25,663 INFO L85 PathProgramCache]: Analyzing trace with hash -923209824, now seen corresponding path program 9 times [2024-06-04 16:05:25,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:05:25,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030129459] [2024-06-04 16:05:25,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:05:25,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:05:25,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:05:29,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:05:29,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:05:29,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030129459] [2024-06-04 16:05:29,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030129459] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:05:29,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:05:29,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:05:29,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113238725] [2024-06-04 16:05:29,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:05:29,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:05:29,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:05:29,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:05:29,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:05:29,840 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:05:29,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 201 transitions, 2477 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:05:29,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:05:29,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:05:29,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:05:30,316 INFO L124 PetriNetUnfolderBase]: 571/1000 cut-off events. [2024-06-04 16:05:30,317 INFO L125 PetriNetUnfolderBase]: For 47634/47634 co-relation queries the response was YES. [2024-06-04 16:05:30,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7601 conditions, 1000 events. 571/1000 cut-off events. For 47634/47634 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4710 event pairs, 90 based on Foata normal form. 2/1002 useless extension candidates. Maximal degree in co-relation 7496. Up to 841 conditions per place. [2024-06-04 16:05:30,325 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 169 selfloop transitions, 45 changer transitions 0/216 dead transitions. [2024-06-04 16:05:30,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 216 transitions, 3007 flow [2024-06-04 16:05:30,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:05:30,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:05:30,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2024-06-04 16:05:30,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3400673400673401 [2024-06-04 16:05:30,326 INFO L175 Difference]: Start difference. First operand has 220 places, 201 transitions, 2477 flow. Second operand 9 states and 101 transitions. [2024-06-04 16:05:30,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 216 transitions, 3007 flow [2024-06-04 16:05:30,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 216 transitions, 2853 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-04 16:05:30,435 INFO L231 Difference]: Finished difference. Result has 221 places, 203 transitions, 2466 flow [2024-06-04 16:05:30,435 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2323, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2466, PETRI_PLACES=221, PETRI_TRANSITIONS=203} [2024-06-04 16:05:30,435 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 189 predicate places. [2024-06-04 16:05:30,435 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 203 transitions, 2466 flow [2024-06-04 16:05:30,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:05:30,436 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:05:30,436 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 16:05:30,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-04 16:05:30,436 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 16:05:30,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:05:30,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1009460100, now seen corresponding path program 10 times [2024-06-04 16:05:30,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:05:30,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172362136] [2024-06-04 16:05:30,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:05:30,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:05:30,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:05:34,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:05:34,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:05:34,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172362136] [2024-06-04 16:05:34,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172362136] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:05:34,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:05:34,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:05:34,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964024348] [2024-06-04 16:05:34,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:05:34,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:05:34,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:05:34,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:05:34,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:05:34,936 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:05:34,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 203 transitions, 2466 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:05:34,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:05:34,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:05:34,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:05:35,501 INFO L124 PetriNetUnfolderBase]: 597/1042 cut-off events. [2024-06-04 16:05:35,502 INFO L125 PetriNetUnfolderBase]: For 55631/55631 co-relation queries the response was YES. [2024-06-04 16:05:35,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8129 conditions, 1042 events. 597/1042 cut-off events. For 55631/55631 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 4963 event pairs, 77 based on Foata normal form. 2/1044 useless extension candidates. Maximal degree in co-relation 8024. Up to 595 conditions per place. [2024-06-04 16:05:35,510 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 131 selfloop transitions, 98 changer transitions 0/231 dead transitions. [2024-06-04 16:05:35,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 231 transitions, 3518 flow [2024-06-04 16:05:35,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:05:35,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:05:35,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-04 16:05:35,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38047138047138046 [2024-06-04 16:05:35,511 INFO L175 Difference]: Start difference. First operand has 221 places, 203 transitions, 2466 flow. Second operand 9 states and 113 transitions. [2024-06-04 16:05:35,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 231 transitions, 3518 flow [2024-06-04 16:05:35,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 231 transitions, 3319 flow, removed 34 selfloop flow, removed 9 redundant places. [2024-06-04 16:05:35,622 INFO L231 Difference]: Finished difference. Result has 221 places, 211 transitions, 2676 flow [2024-06-04 16:05:35,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2287, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2676, PETRI_PLACES=221, PETRI_TRANSITIONS=211} [2024-06-04 16:05:35,622 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 189 predicate places. [2024-06-04 16:05:35,623 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 211 transitions, 2676 flow [2024-06-04 16:05:35,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:05:35,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:05:35,623 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 16:05:35,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-04 16:05:35,623 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 16:05:35,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:05:35,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1009466610, now seen corresponding path program 11 times [2024-06-04 16:05:35,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:05:35,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784560088] [2024-06-04 16:05:35,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:05:35,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:05:35,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:05:39,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:05:39,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:05:39,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784560088] [2024-06-04 16:05:39,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784560088] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:05:39,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:05:39,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:05:39,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799979947] [2024-06-04 16:05:39,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:05:39,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:05:39,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:05:39,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:05:39,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:05:39,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:05:39,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 211 transitions, 2676 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:05:39,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:05:39,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:05:39,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:05:40,265 INFO L124 PetriNetUnfolderBase]: 593/1036 cut-off events. [2024-06-04 16:05:40,265 INFO L125 PetriNetUnfolderBase]: For 51224/51224 co-relation queries the response was YES. [2024-06-04 16:05:40,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7937 conditions, 1036 events. 593/1036 cut-off events. For 51224/51224 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 4925 event pairs, 66 based on Foata normal form. 2/1038 useless extension candidates. Maximal degree in co-relation 7833. Up to 762 conditions per place. [2024-06-04 16:05:40,274 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 147 selfloop transitions, 77 changer transitions 0/226 dead transitions. [2024-06-04 16:05:40,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 226 transitions, 3194 flow [2024-06-04 16:05:40,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:05:40,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:05:40,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2024-06-04 16:05:40,275 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3501683501683502 [2024-06-04 16:05:40,275 INFO L175 Difference]: Start difference. First operand has 221 places, 211 transitions, 2676 flow. Second operand 9 states and 104 transitions. [2024-06-04 16:05:40,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 226 transitions, 3194 flow [2024-06-04 16:05:40,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 226 transitions, 3056 flow, removed 45 selfloop flow, removed 3 redundant places. [2024-06-04 16:05:40,420 INFO L231 Difference]: Finished difference. Result has 227 places, 211 transitions, 2697 flow [2024-06-04 16:05:40,420 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2538, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2697, PETRI_PLACES=227, PETRI_TRANSITIONS=211} [2024-06-04 16:05:40,421 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 195 predicate places. [2024-06-04 16:05:40,421 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 211 transitions, 2697 flow [2024-06-04 16:05:40,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:05:40,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:05:40,421 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:05:40,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-04 16:05:40,421 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 16:05:40,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:05:40,422 INFO L85 PathProgramCache]: Analyzing trace with hash -377303938, now seen corresponding path program 12 times [2024-06-04 16:05:40,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:05:40,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749074732] [2024-06-04 16:05:40,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:05:40,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:05:40,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:05:44,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:05:44,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:05:44,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749074732] [2024-06-04 16:05:44,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749074732] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:05:44,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:05:44,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:05:44,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458119535] [2024-06-04 16:05:44,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:05:44,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:05:44,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:05:44,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:05:44,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:05:44,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:05:44,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 211 transitions, 2697 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:05:44,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:05:44,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:05:44,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:05:45,122 INFO L124 PetriNetUnfolderBase]: 599/1046 cut-off events. [2024-06-04 16:05:45,122 INFO L125 PetriNetUnfolderBase]: For 52731/52731 co-relation queries the response was YES. [2024-06-04 16:05:45,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8106 conditions, 1046 events. 599/1046 cut-off events. For 52731/52731 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 4985 event pairs, 91 based on Foata normal form. 2/1048 useless extension candidates. Maximal degree in co-relation 8000. Up to 870 conditions per place. [2024-06-04 16:05:45,131 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 176 selfloop transitions, 50 changer transitions 0/228 dead transitions. [2024-06-04 16:05:45,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 228 transitions, 3271 flow [2024-06-04 16:05:45,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:05:45,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:05:45,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2024-06-04 16:05:45,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35353535353535354 [2024-06-04 16:05:45,132 INFO L175 Difference]: Start difference. First operand has 227 places, 211 transitions, 2697 flow. Second operand 9 states and 105 transitions. [2024-06-04 16:05:45,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 228 transitions, 3271 flow [2024-06-04 16:05:45,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 228 transitions, 3112 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-04 16:05:45,257 INFO L231 Difference]: Finished difference. Result has 228 places, 213 transitions, 2697 flow [2024-06-04 16:05:45,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2538, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2697, PETRI_PLACES=228, PETRI_TRANSITIONS=213} [2024-06-04 16:05:45,258 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 196 predicate places. [2024-06-04 16:05:45,258 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 213 transitions, 2697 flow [2024-06-04 16:05:45,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:05:45,258 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:05:45,258 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 16:05:45,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-04 16:05:45,258 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 16:05:45,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:05:45,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1009220532, now seen corresponding path program 3 times [2024-06-04 16:05:45,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:05:45,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719208343] [2024-06-04 16:05:45,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:05:45,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:05:45,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:05:50,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:05:50,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:05:50,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719208343] [2024-06-04 16:05:50,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719208343] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:05:50,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:05:50,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:05:50,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448453401] [2024-06-04 16:05:50,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:05:50,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:05:50,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:05:50,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:05:50,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:05:50,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:05:50,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 213 transitions, 2697 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:05:50,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:05:50,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:05:50,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:05:51,303 INFO L124 PetriNetUnfolderBase]: 605/1056 cut-off events. [2024-06-04 16:05:51,303 INFO L125 PetriNetUnfolderBase]: For 55790/55790 co-relation queries the response was YES. [2024-06-04 16:05:51,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8141 conditions, 1056 events. 605/1056 cut-off events. For 55790/55790 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 5096 event pairs, 117 based on Foata normal form. 2/1058 useless extension candidates. Maximal degree in co-relation 8034. Up to 933 conditions per place. [2024-06-04 16:05:51,312 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 185 selfloop transitions, 42 changer transitions 0/229 dead transitions. [2024-06-04 16:05:51,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 229 transitions, 3237 flow [2024-06-04 16:05:51,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:05:51,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:05:51,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-04 16:05:51,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3242424242424242 [2024-06-04 16:05:51,313 INFO L175 Difference]: Start difference. First operand has 228 places, 213 transitions, 2697 flow. Second operand 10 states and 107 transitions. [2024-06-04 16:05:51,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 229 transitions, 3237 flow [2024-06-04 16:05:51,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 229 transitions, 3098 flow, removed 21 selfloop flow, removed 7 redundant places. [2024-06-04 16:05:51,451 INFO L231 Difference]: Finished difference. Result has 231 places, 215 transitions, 2687 flow [2024-06-04 16:05:51,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2558, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2687, PETRI_PLACES=231, PETRI_TRANSITIONS=215} [2024-06-04 16:05:51,451 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 199 predicate places. [2024-06-04 16:05:51,451 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 215 transitions, 2687 flow [2024-06-04 16:05:51,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:05:51,452 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:05:51,452 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 16:05:51,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-04 16:05:51,452 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 16:05:51,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:05:51,452 INFO L85 PathProgramCache]: Analyzing trace with hash -377297180, now seen corresponding path program 3 times [2024-06-04 16:05:51,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:05:51,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125662139] [2024-06-04 16:05:51,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:05:51,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:05:51,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:05:56,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 16:05:56,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:05:56,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125662139] [2024-06-04 16:05:56,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125662139] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:05:56,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:05:56,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:05:56,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390593121] [2024-06-04 16:05:56,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:05:56,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:05:56,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:05:56,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:05:56,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:05:57,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:05:57,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 215 transitions, 2687 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:05:57,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:05:57,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:05:57,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:05:57,515 INFO L124 PetriNetUnfolderBase]: 603/1053 cut-off events. [2024-06-04 16:05:57,515 INFO L125 PetriNetUnfolderBase]: For 54393/54393 co-relation queries the response was YES. [2024-06-04 16:05:57,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8029 conditions, 1053 events. 603/1053 cut-off events. For 54393/54393 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 5074 event pairs, 135 based on Foata normal form. 1/1054 useless extension candidates. Maximal degree in co-relation 7921. Up to 959 conditions per place. [2024-06-04 16:05:57,524 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 193 selfloop transitions, 33 changer transitions 0/228 dead transitions. [2024-06-04 16:05:57,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 228 transitions, 3216 flow [2024-06-04 16:05:57,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:05:57,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:05:57,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-04 16:05:57,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3265993265993266 [2024-06-04 16:05:57,525 INFO L175 Difference]: Start difference. First operand has 231 places, 215 transitions, 2687 flow. Second operand 9 states and 97 transitions. [2024-06-04 16:05:57,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 228 transitions, 3216 flow [2024-06-04 16:05:57,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 228 transitions, 3109 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-04 16:05:57,650 INFO L231 Difference]: Finished difference. Result has 232 places, 217 transitions, 2699 flow [2024-06-04 16:05:57,657 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2580, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2699, PETRI_PLACES=232, PETRI_TRANSITIONS=217} [2024-06-04 16:05:57,657 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 200 predicate places. [2024-06-04 16:05:57,657 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 217 transitions, 2699 flow [2024-06-04 16:05:57,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:05:57,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:05:57,658 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 16:05:57,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-04 16:05:57,658 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 16:05:57,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:05:57,658 INFO L85 PathProgramCache]: Analyzing trace with hash -377297428, now seen corresponding path program 13 times [2024-06-04 16:05:57,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:05:57,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453195531] [2024-06-04 16:05:57,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:05:57,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:05:57,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:06:01,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:06:01,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:06:01,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453195531] [2024-06-04 16:06:01,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453195531] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:06:01,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:06:01,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:06:01,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424188688] [2024-06-04 16:06:01,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:06:01,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:06:01,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:06:01,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:06:01,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:06:01,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:06:01,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 217 transitions, 2699 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:06:01,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:06:01,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:06:01,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:06:02,490 INFO L124 PetriNetUnfolderBase]: 599/1047 cut-off events. [2024-06-04 16:06:02,490 INFO L125 PetriNetUnfolderBase]: For 53351/53351 co-relation queries the response was YES. [2024-06-04 16:06:02,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7873 conditions, 1047 events. 599/1047 cut-off events. For 53351/53351 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 5017 event pairs, 90 based on Foata normal form. 2/1049 useless extension candidates. Maximal degree in co-relation 7764. Up to 844 conditions per place. [2024-06-04 16:06:02,497 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 175 selfloop transitions, 56 changer transitions 0/233 dead transitions. [2024-06-04 16:06:02,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 233 transitions, 3239 flow [2024-06-04 16:06:02,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:06:02,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:06:02,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-04 16:06:02,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3602693602693603 [2024-06-04 16:06:02,498 INFO L175 Difference]: Start difference. First operand has 232 places, 217 transitions, 2699 flow. Second operand 9 states and 107 transitions. [2024-06-04 16:06:02,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 233 transitions, 3239 flow [2024-06-04 16:06:02,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 233 transitions, 3143 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-04 16:06:02,614 INFO L231 Difference]: Finished difference. Result has 234 places, 217 transitions, 2721 flow [2024-06-04 16:06:02,615 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2603, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2721, PETRI_PLACES=234, PETRI_TRANSITIONS=217} [2024-06-04 16:06:02,615 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 202 predicate places. [2024-06-04 16:06:02,615 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 217 transitions, 2721 flow [2024-06-04 16:06:02,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:06:02,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:06:02,615 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 16:06:02,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-04 16:06:02,615 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 16:06:02,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:06:02,616 INFO L85 PathProgramCache]: Analyzing trace with hash -370801750, now seen corresponding path program 4 times [2024-06-04 16:06:02,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:06:02,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992301373] [2024-06-04 16:06:02,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:06:02,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:06:02,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:06:08,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:06:08,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:06:08,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992301373] [2024-06-04 16:06:08,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992301373] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:06:08,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:06:08,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:06:08,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105508340] [2024-06-04 16:06:08,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:06:08,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:06:08,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:06:08,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:06:08,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:06:08,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:06:08,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 217 transitions, 2721 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:06:08,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:06:08,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:06:08,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:06:08,984 INFO L124 PetriNetUnfolderBase]: 605/1057 cut-off events. [2024-06-04 16:06:08,984 INFO L125 PetriNetUnfolderBase]: For 54897/54897 co-relation queries the response was YES. [2024-06-04 16:06:08,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7988 conditions, 1057 events. 605/1057 cut-off events. For 54897/54897 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5109 event pairs, 134 based on Foata normal form. 2/1059 useless extension candidates. Maximal degree in co-relation 7878. Up to 964 conditions per place. [2024-06-04 16:06:08,993 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 199 selfloop transitions, 29 changer transitions 0/230 dead transitions. [2024-06-04 16:06:08,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 230 transitions, 3253 flow [2024-06-04 16:06:08,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:06:08,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:06:08,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-04 16:06:08,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3265993265993266 [2024-06-04 16:06:08,994 INFO L175 Difference]: Start difference. First operand has 234 places, 217 transitions, 2721 flow. Second operand 9 states and 97 transitions. [2024-06-04 16:06:08,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 230 transitions, 3253 flow [2024-06-04 16:06:09,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 230 transitions, 2980 flow, removed 23 selfloop flow, removed 9 redundant places. [2024-06-04 16:06:09,119 INFO L231 Difference]: Finished difference. Result has 234 places, 219 transitions, 2556 flow [2024-06-04 16:06:09,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2448, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2556, PETRI_PLACES=234, PETRI_TRANSITIONS=219} [2024-06-04 16:06:09,120 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 202 predicate places. [2024-06-04 16:06:09,120 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 219 transitions, 2556 flow [2024-06-04 16:06:09,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:06:09,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:06:09,120 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:06:09,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-04 16:06:09,120 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 16:06:09,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:06:09,120 INFO L85 PathProgramCache]: Analyzing trace with hash -724129590, now seen corresponding path program 14 times [2024-06-04 16:06:09,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:06:09,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76116445] [2024-06-04 16:06:09,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:06:09,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:06:09,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:06:12,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:06:12,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:06:12,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76116445] [2024-06-04 16:06:12,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76116445] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:06:12,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:06:12,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:06:12,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198585719] [2024-06-04 16:06:12,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:06:12,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:06:12,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:06:12,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:06:12,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:06:12,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:06:12,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 219 transitions, 2556 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:06:12,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:06:12,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:06:12,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:06:13,292 INFO L124 PetriNetUnfolderBase]: 601/1051 cut-off events. [2024-06-04 16:06:13,293 INFO L125 PetriNetUnfolderBase]: For 51741/51741 co-relation queries the response was YES. [2024-06-04 16:06:13,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7553 conditions, 1051 events. 601/1051 cut-off events. For 51741/51741 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5072 event pairs, 204 based on Foata normal form. 2/1053 useless extension candidates. Maximal degree in co-relation 7443. Up to 1017 conditions per place. [2024-06-04 16:06:13,300 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 212 selfloop transitions, 15 changer transitions 0/229 dead transitions. [2024-06-04 16:06:13,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 229 transitions, 3042 flow [2024-06-04 16:06:13,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:06:13,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:06:13,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 91 transitions. [2024-06-04 16:06:13,301 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3063973063973064 [2024-06-04 16:06:13,301 INFO L175 Difference]: Start difference. First operand has 234 places, 219 transitions, 2556 flow. Second operand 9 states and 91 transitions. [2024-06-04 16:06:13,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 229 transitions, 3042 flow [2024-06-04 16:06:13,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 229 transitions, 2928 flow, removed 30 selfloop flow, removed 7 redundant places. [2024-06-04 16:06:13,418 INFO L231 Difference]: Finished difference. Result has 236 places, 219 transitions, 2477 flow [2024-06-04 16:06:13,419 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2442, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2477, PETRI_PLACES=236, PETRI_TRANSITIONS=219} [2024-06-04 16:06:13,419 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 204 predicate places. [2024-06-04 16:06:13,419 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 219 transitions, 2477 flow [2024-06-04 16:06:13,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:06:13,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:06:13,419 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 16:06:13,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-04 16:06:13,420 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 16:06:13,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:06:13,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1269853568, now seen corresponding path program 5 times [2024-06-04 16:06:13,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:06:13,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182566424] [2024-06-04 16:06:13,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:06:13,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:06:13,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:06:18,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:06:18,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:06:18,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182566424] [2024-06-04 16:06:18,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182566424] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:06:18,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:06:18,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:06:18,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100326534] [2024-06-04 16:06:18,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:06:18,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:06:18,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:06:18,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:06:18,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:06:19,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:06:19,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 219 transitions, 2477 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:06:19,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:06:19,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:06:19,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:06:19,728 INFO L124 PetriNetUnfolderBase]: 602/1053 cut-off events. [2024-06-04 16:06:19,728 INFO L125 PetriNetUnfolderBase]: For 51469/51469 co-relation queries the response was YES. [2024-06-04 16:06:19,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7461 conditions, 1053 events. 602/1053 cut-off events. For 51469/51469 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5079 event pairs, 201 based on Foata normal form. 2/1055 useless extension candidates. Maximal degree in co-relation 7350. Up to 980 conditions per place. [2024-06-04 16:06:19,737 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 209 selfloop transitions, 24 changer transitions 0/235 dead transitions. [2024-06-04 16:06:19,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 235 transitions, 3147 flow [2024-06-04 16:06:19,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:06:19,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:06:19,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-04 16:06:19,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3242424242424242 [2024-06-04 16:06:19,737 INFO L175 Difference]: Start difference. First operand has 236 places, 219 transitions, 2477 flow. Second operand 10 states and 107 transitions. [2024-06-04 16:06:19,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 235 transitions, 3147 flow [2024-06-04 16:06:19,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 235 transitions, 3106 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-04 16:06:19,857 INFO L231 Difference]: Finished difference. Result has 238 places, 221 transitions, 2537 flow [2024-06-04 16:06:19,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2436, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2537, PETRI_PLACES=238, PETRI_TRANSITIONS=221} [2024-06-04 16:06:19,858 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 206 predicate places. [2024-06-04 16:06:19,858 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 221 transitions, 2537 flow [2024-06-04 16:06:19,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:06:19,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:06:19,858 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 16:06:19,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-04 16:06:19,858 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 16:06:19,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:06:19,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1259734238, now seen corresponding path program 6 times [2024-06-04 16:06:19,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:06:19,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544048747] [2024-06-04 16:06:19,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:06:19,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:06:19,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:06:25,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:06:25,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:06:25,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544048747] [2024-06-04 16:06:25,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544048747] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:06:25,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:06:25,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:06:25,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182899505] [2024-06-04 16:06:25,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:06:25,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:06:25,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:06:25,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:06:25,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:06:25,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:06:25,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 221 transitions, 2537 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:06:25,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:06:25,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:06:25,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:06:25,567 INFO L124 PetriNetUnfolderBase]: 598/1047 cut-off events. [2024-06-04 16:06:25,567 INFO L125 PetriNetUnfolderBase]: For 49839/49839 co-relation queries the response was YES. [2024-06-04 16:06:25,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7374 conditions, 1047 events. 598/1047 cut-off events. For 49839/49839 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5050 event pairs, 205 based on Foata normal form. 2/1049 useless extension candidates. Maximal degree in co-relation 7262. Up to 999 conditions per place. [2024-06-04 16:06:25,577 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 210 selfloop transitions, 20 changer transitions 0/232 dead transitions. [2024-06-04 16:06:25,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 232 transitions, 3029 flow [2024-06-04 16:06:25,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:06:25,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:06:25,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 101 transitions. [2024-06-04 16:06:25,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30606060606060603 [2024-06-04 16:06:25,578 INFO L175 Difference]: Start difference. First operand has 238 places, 221 transitions, 2537 flow. Second operand 10 states and 101 transitions. [2024-06-04 16:06:25,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 232 transitions, 3029 flow [2024-06-04 16:06:25,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 232 transitions, 2942 flow, removed 21 selfloop flow, removed 8 redundant places. [2024-06-04 16:06:25,704 INFO L231 Difference]: Finished difference. Result has 240 places, 221 transitions, 2498 flow [2024-06-04 16:06:25,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2450, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2498, PETRI_PLACES=240, PETRI_TRANSITIONS=221} [2024-06-04 16:06:25,705 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 208 predicate places. [2024-06-04 16:06:25,705 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 221 transitions, 2498 flow [2024-06-04 16:06:25,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:06:25,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:06:25,705 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 16:06:25,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-04 16:06:25,705 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 16:06:25,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:06:25,705 INFO L85 PathProgramCache]: Analyzing trace with hash 115091121, now seen corresponding path program 1 times [2024-06-04 16:06:25,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:06:25,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783077090] [2024-06-04 16:06:25,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:06:25,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:06:25,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:06:29,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 16:06:29,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:06:29,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783077090] [2024-06-04 16:06:29,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783077090] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:06:29,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:06:29,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:06:29,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077658795] [2024-06-04 16:06:29,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:06:29,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:06:29,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:06:29,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:06:29,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:06:29,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:06:29,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 221 transitions, 2498 flow. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:06:29,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:06:29,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:06:29,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:06:30,002 INFO L124 PetriNetUnfolderBase]: 592/1043 cut-off events. [2024-06-04 16:06:30,002 INFO L125 PetriNetUnfolderBase]: For 51774/51779 co-relation queries the response was YES. [2024-06-04 16:06:30,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7319 conditions, 1043 events. 592/1043 cut-off events. For 51774/51779 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 5082 event pairs, 83 based on Foata normal form. 6/1047 useless extension candidates. Maximal degree in co-relation 7206. Up to 831 conditions per place. [2024-06-04 16:06:30,011 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 179 selfloop transitions, 44 changer transitions 0/233 dead transitions. [2024-06-04 16:06:30,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 233 transitions, 2990 flow [2024-06-04 16:06:30,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:06:30,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:06:30,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2024-06-04 16:06:30,013 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3560606060606061 [2024-06-04 16:06:30,013 INFO L175 Difference]: Start difference. First operand has 240 places, 221 transitions, 2498 flow. Second operand 8 states and 94 transitions. [2024-06-04 16:06:30,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 233 transitions, 2990 flow [2024-06-04 16:06:30,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 233 transitions, 2950 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-04 16:06:30,152 INFO L231 Difference]: Finished difference. Result has 239 places, 222 transitions, 2569 flow [2024-06-04 16:06:30,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2458, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2569, PETRI_PLACES=239, PETRI_TRANSITIONS=222} [2024-06-04 16:06:30,152 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 207 predicate places. [2024-06-04 16:06:30,152 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 222 transitions, 2569 flow [2024-06-04 16:06:30,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:06:30,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:06:30,152 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 16:06:30,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-04 16:06:30,153 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 16:06:30,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:06:30,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1169205169, now seen corresponding path program 2 times [2024-06-04 16:06:30,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:06:30,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096046333] [2024-06-04 16:06:30,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:06:30,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:06:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:06:34,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:06:34,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:06:34,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096046333] [2024-06-04 16:06:34,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096046333] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:06:34,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:06:34,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:06:34,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539212347] [2024-06-04 16:06:34,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:06:34,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:06:34,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:06:34,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:06:34,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:06:34,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:06:34,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 222 transitions, 2569 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:06:34,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:06:34,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:06:34,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:06:35,186 INFO L124 PetriNetUnfolderBase]: 606/1063 cut-off events. [2024-06-04 16:06:35,187 INFO L125 PetriNetUnfolderBase]: For 53274/53274 co-relation queries the response was YES. [2024-06-04 16:06:35,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7550 conditions, 1063 events. 606/1063 cut-off events. For 53274/53274 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 5156 event pairs, 117 based on Foata normal form. 2/1065 useless extension candidates. Maximal degree in co-relation 7436. Up to 944 conditions per place. [2024-06-04 16:06:35,194 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 203 selfloop transitions, 37 changer transitions 0/242 dead transitions. [2024-06-04 16:06:35,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 242 transitions, 3131 flow [2024-06-04 16:06:35,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:06:35,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:06:35,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 118 transitions. [2024-06-04 16:06:35,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.325068870523416 [2024-06-04 16:06:35,195 INFO L175 Difference]: Start difference. First operand has 239 places, 222 transitions, 2569 flow. Second operand 11 states and 118 transitions. [2024-06-04 16:06:35,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 242 transitions, 3131 flow [2024-06-04 16:06:35,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 242 transitions, 3032 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-04 16:06:35,320 INFO L231 Difference]: Finished difference. Result has 244 places, 223 transitions, 2569 flow [2024-06-04 16:06:35,320 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2470, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2569, PETRI_PLACES=244, PETRI_TRANSITIONS=223} [2024-06-04 16:06:35,321 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 212 predicate places. [2024-06-04 16:06:35,321 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 223 transitions, 2569 flow [2024-06-04 16:06:35,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:06:35,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:06:35,321 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 16:06:35,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-04 16:06:35,321 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 16:06:35,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:06:35,322 INFO L85 PathProgramCache]: Analyzing trace with hash 254295417, now seen corresponding path program 3 times [2024-06-04 16:06:35,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:06:35,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990446700] [2024-06-04 16:06:35,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:06:35,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:06:35,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:06:39,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:06:39,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:06:39,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990446700] [2024-06-04 16:06:39,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990446700] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:06:39,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:06:39,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:06:39,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67029087] [2024-06-04 16:06:39,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:06:39,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:06:39,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:06:39,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:06:39,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:06:39,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:06:39,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 223 transitions, 2569 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:06:39,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:06:39,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:06:39,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:06:39,809 INFO L124 PetriNetUnfolderBase]: 610/1071 cut-off events. [2024-06-04 16:06:39,809 INFO L125 PetriNetUnfolderBase]: For 55557/55557 co-relation queries the response was YES. [2024-06-04 16:06:39,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7597 conditions, 1071 events. 610/1071 cut-off events. For 55557/55557 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 5235 event pairs, 117 based on Foata normal form. 2/1073 useless extension candidates. Maximal degree in co-relation 7482. Up to 955 conditions per place. [2024-06-04 16:06:39,817 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 207 selfloop transitions, 34 changer transitions 0/243 dead transitions. [2024-06-04 16:06:39,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 243 transitions, 3129 flow [2024-06-04 16:06:39,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:06:39,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:06:39,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2024-06-04 16:06:39,819 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32231404958677684 [2024-06-04 16:06:39,819 INFO L175 Difference]: Start difference. First operand has 244 places, 223 transitions, 2569 flow. Second operand 11 states and 117 transitions. [2024-06-04 16:06:39,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 243 transitions, 3129 flow [2024-06-04 16:06:39,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 243 transitions, 3037 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-04 16:06:39,960 INFO L231 Difference]: Finished difference. Result has 246 places, 224 transitions, 2571 flow [2024-06-04 16:06:39,960 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2477, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2571, PETRI_PLACES=246, PETRI_TRANSITIONS=224} [2024-06-04 16:06:39,960 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 214 predicate places. [2024-06-04 16:06:39,961 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 224 transitions, 2571 flow [2024-06-04 16:06:39,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:06:39,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:06:39,961 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 16:06:39,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-04 16:06:39,961 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 16:06:39,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:06:39,961 INFO L85 PathProgramCache]: Analyzing trace with hash 892093488, now seen corresponding path program 1 times [2024-06-04 16:06:39,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:06:39,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782280890] [2024-06-04 16:06:39,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:06:39,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:06:39,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:06:44,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:06:44,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:06:44,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782280890] [2024-06-04 16:06:44,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782280890] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:06:44,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:06:44,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:06:44,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720067832] [2024-06-04 16:06:44,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:06:44,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:06:44,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:06:44,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:06:44,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:06:44,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:06:44,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 224 transitions, 2571 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:06:44,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:06:44,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:06:44,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:06:45,323 INFO L124 PetriNetUnfolderBase]: 613/1076 cut-off events. [2024-06-04 16:06:45,323 INFO L125 PetriNetUnfolderBase]: For 55331/55331 co-relation queries the response was YES. [2024-06-04 16:06:45,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7647 conditions, 1076 events. 613/1076 cut-off events. For 55331/55331 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 5261 event pairs, 116 based on Foata normal form. 1/1077 useless extension candidates. Maximal degree in co-relation 7531. Up to 928 conditions per place. [2024-06-04 16:06:45,332 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 197 selfloop transitions, 46 changer transitions 0/245 dead transitions. [2024-06-04 16:06:45,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 245 transitions, 3171 flow [2024-06-04 16:06:45,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:06:45,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:06:45,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 119 transitions. [2024-06-04 16:06:45,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3278236914600551 [2024-06-04 16:06:45,333 INFO L175 Difference]: Start difference. First operand has 246 places, 224 transitions, 2571 flow. Second operand 11 states and 119 transitions. [2024-06-04 16:06:45,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 245 transitions, 3171 flow [2024-06-04 16:06:45,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 245 transitions, 3088 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-04 16:06:45,492 INFO L231 Difference]: Finished difference. Result has 249 places, 226 transitions, 2642 flow [2024-06-04 16:06:45,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2488, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2642, PETRI_PLACES=249, PETRI_TRANSITIONS=226} [2024-06-04 16:06:45,492 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 217 predicate places. [2024-06-04 16:06:45,492 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 226 transitions, 2642 flow [2024-06-04 16:06:45,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:06:45,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:06:45,493 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 16:06:45,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-04 16:06:45,493 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 16:06:45,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:06:45,493 INFO L85 PathProgramCache]: Analyzing trace with hash 896769745, now seen corresponding path program 1 times [2024-06-04 16:06:45,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:06:45,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127534393] [2024-06-04 16:06:45,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:06:45,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:06:45,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:06:51,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:06:51,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:06:51,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127534393] [2024-06-04 16:06:51,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127534393] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:06:51,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:06:51,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:06:51,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828778251] [2024-06-04 16:06:51,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:06:51,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:06:51,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:06:51,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:06:51,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:06:51,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:06:51,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 226 transitions, 2642 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:06:51,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:06:51,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:06:51,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:06:51,962 INFO L124 PetriNetUnfolderBase]: 619/1086 cut-off events. [2024-06-04 16:06:51,962 INFO L125 PetriNetUnfolderBase]: For 58914/58914 co-relation queries the response was YES. [2024-06-04 16:06:51,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7775 conditions, 1086 events. 619/1086 cut-off events. For 58914/58914 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5320 event pairs, 115 based on Foata normal form. 2/1088 useless extension candidates. Maximal degree in co-relation 7658. Up to 971 conditions per place. [2024-06-04 16:06:51,973 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 212 selfloop transitions, 35 changer transitions 0/249 dead transitions. [2024-06-04 16:06:51,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 249 transitions, 3254 flow [2024-06-04 16:06:51,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 16:06:51,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 16:06:51,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 128 transitions. [2024-06-04 16:06:51,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32323232323232326 [2024-06-04 16:06:51,974 INFO L175 Difference]: Start difference. First operand has 249 places, 226 transitions, 2642 flow. Second operand 12 states and 128 transitions. [2024-06-04 16:06:51,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 249 transitions, 3254 flow [2024-06-04 16:06:52,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 249 transitions, 3146 flow, removed 14 selfloop flow, removed 9 redundant places. [2024-06-04 16:06:52,150 INFO L231 Difference]: Finished difference. Result has 252 places, 228 transitions, 2651 flow [2024-06-04 16:06:52,150 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2534, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2651, PETRI_PLACES=252, PETRI_TRANSITIONS=228} [2024-06-04 16:06:52,151 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 220 predicate places. [2024-06-04 16:06:52,151 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 228 transitions, 2651 flow [2024-06-04 16:06:52,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:06:52,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:06:52,151 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 16:06:52,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-04 16:06:52,151 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 16:06:52,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:06:52,152 INFO L85 PathProgramCache]: Analyzing trace with hash -962232753, now seen corresponding path program 4 times [2024-06-04 16:06:52,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:06:52,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938243953] [2024-06-04 16:06:52,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:06:52,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:06:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:06:55,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:06:55,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:06:55,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938243953] [2024-06-04 16:06:55,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938243953] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:06:55,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:06:55,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:06:55,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326508038] [2024-06-04 16:06:55,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:06:55,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:06:55,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:06:55,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:06:55,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:06:56,106 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:06:56,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 228 transitions, 2651 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:06:56,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:06:56,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:06:56,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:06:56,644 INFO L124 PetriNetUnfolderBase]: 623/1094 cut-off events. [2024-06-04 16:06:56,644 INFO L125 PetriNetUnfolderBase]: For 60514/60514 co-relation queries the response was YES. [2024-06-04 16:06:56,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7847 conditions, 1094 events. 623/1094 cut-off events. For 60514/60514 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 5361 event pairs, 91 based on Foata normal form. 2/1096 useless extension candidates. Maximal degree in co-relation 7729. Up to 993 conditions per place. [2024-06-04 16:06:56,653 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 216 selfloop transitions, 29 changer transitions 0/247 dead transitions. [2024-06-04 16:06:56,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 247 transitions, 3231 flow [2024-06-04 16:06:56,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:06:56,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:06:56,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2024-06-04 16:06:56,655 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33636363636363636 [2024-06-04 16:06:56,655 INFO L175 Difference]: Start difference. First operand has 252 places, 228 transitions, 2651 flow. Second operand 10 states and 111 transitions. [2024-06-04 16:06:56,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 247 transitions, 3231 flow [2024-06-04 16:06:56,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 247 transitions, 3126 flow, removed 19 selfloop flow, removed 10 redundant places. [2024-06-04 16:06:56,846 INFO L231 Difference]: Finished difference. Result has 252 places, 229 transitions, 2633 flow [2024-06-04 16:06:56,846 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2546, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2633, PETRI_PLACES=252, PETRI_TRANSITIONS=229} [2024-06-04 16:06:56,846 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 220 predicate places. [2024-06-04 16:06:56,847 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 229 transitions, 2633 flow [2024-06-04 16:06:56,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:06:56,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:06:56,847 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 16:06:56,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-04 16:06:56,847 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 16:06:56,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:06:56,847 INFO L85 PathProgramCache]: Analyzing trace with hash -962236473, now seen corresponding path program 5 times [2024-06-04 16:06:56,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:06:56,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476113566] [2024-06-04 16:06:56,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:06:56,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:06:56,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:07:00,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:07:00,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:07:00,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476113566] [2024-06-04 16:07:00,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476113566] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:07:00,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:07:00,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:07:00,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153454469] [2024-06-04 16:07:00,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:07:00,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:07:00,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:07:00,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:07:00,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:07:01,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:07:01,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 229 transitions, 2633 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:07:01,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:07:01,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:07:01,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:07:01,523 INFO L124 PetriNetUnfolderBase]: 627/1102 cut-off events. [2024-06-04 16:07:01,523 INFO L125 PetriNetUnfolderBase]: For 63292/63292 co-relation queries the response was YES. [2024-06-04 16:07:01,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7873 conditions, 1102 events. 627/1102 cut-off events. For 63292/63292 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 5422 event pairs, 89 based on Foata normal form. 2/1104 useless extension candidates. Maximal degree in co-relation 7755. Up to 1004 conditions per place. [2024-06-04 16:07:01,534 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 220 selfloop transitions, 26 changer transitions 0/248 dead transitions. [2024-06-04 16:07:01,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 248 transitions, 3211 flow [2024-06-04 16:07:01,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:07:01,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:07:01,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2024-06-04 16:07:01,535 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-04 16:07:01,535 INFO L175 Difference]: Start difference. First operand has 252 places, 229 transitions, 2633 flow. Second operand 10 states and 110 transitions. [2024-06-04 16:07:01,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 248 transitions, 3211 flow [2024-06-04 16:07:01,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 248 transitions, 3136 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-04 16:07:01,746 INFO L231 Difference]: Finished difference. Result has 254 places, 230 transitions, 2640 flow [2024-06-04 16:07:01,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2558, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2640, PETRI_PLACES=254, PETRI_TRANSITIONS=230} [2024-06-04 16:07:01,747 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 222 predicate places. [2024-06-04 16:07:01,747 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 230 transitions, 2640 flow [2024-06-04 16:07:01,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:07:01,747 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:07:01,747 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 16:07:01,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-04 16:07:01,747 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 16:07:01,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:07:01,748 INFO L85 PathProgramCache]: Analyzing trace with hash -875390841, now seen corresponding path program 2 times [2024-06-04 16:07:01,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:07:01,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236633255] [2024-06-04 16:07:01,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:07:01,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:07:01,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:07:09,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:07:09,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:07:09,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236633255] [2024-06-04 16:07:09,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236633255] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:07:09,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:07:09,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:07:09,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218658051] [2024-06-04 16:07:09,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:07:09,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:07:09,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:07:09,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:07:09,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:07:09,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:07:09,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 230 transitions, 2640 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:07:09,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:07:09,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:07:09,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:07:09,927 INFO L124 PetriNetUnfolderBase]: 633/1112 cut-off events. [2024-06-04 16:07:09,927 INFO L125 PetriNetUnfolderBase]: For 65148/65148 co-relation queries the response was YES. [2024-06-04 16:07:09,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7947 conditions, 1112 events. 633/1112 cut-off events. For 65148/65148 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 5464 event pairs, 91 based on Foata normal form. 2/1114 useless extension candidates. Maximal degree in co-relation 7828. Up to 1009 conditions per place. [2024-06-04 16:07:09,937 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 221 selfloop transitions, 29 changer transitions 0/252 dead transitions. [2024-06-04 16:07:09,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 252 transitions, 3266 flow [2024-06-04 16:07:09,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:07:09,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:07:09,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 121 transitions. [2024-06-04 16:07:09,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-04 16:07:09,938 INFO L175 Difference]: Start difference. First operand has 254 places, 230 transitions, 2640 flow. Second operand 11 states and 121 transitions. [2024-06-04 16:07:09,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 252 transitions, 3266 flow [2024-06-04 16:07:10,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 252 transitions, 3191 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-04 16:07:10,119 INFO L231 Difference]: Finished difference. Result has 257 places, 232 transitions, 2674 flow [2024-06-04 16:07:10,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2565, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2674, PETRI_PLACES=257, PETRI_TRANSITIONS=232} [2024-06-04 16:07:10,120 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 225 predicate places. [2024-06-04 16:07:10,120 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 232 transitions, 2674 flow [2024-06-04 16:07:10,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:07:10,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:07:10,120 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 16:07:10,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-04 16:07:10,120 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 16:07:10,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:07:10,120 INFO L85 PathProgramCache]: Analyzing trace with hash -875540788, now seen corresponding path program 2 times [2024-06-04 16:07:10,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:07:10,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735769044] [2024-06-04 16:07:10,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:07:10,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:07:10,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:07:14,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:07:14,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:07:14,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735769044] [2024-06-04 16:07:14,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735769044] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:07:14,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:07:14,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:07:14,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370450873] [2024-06-04 16:07:14,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:07:14,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:07:14,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:07:14,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:07:14,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:07:15,094 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:07:15,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 232 transitions, 2674 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:07:15,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:07:15,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:07:15,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:07:15,654 INFO L124 PetriNetUnfolderBase]: 631/1109 cut-off events. [2024-06-04 16:07:15,654 INFO L125 PetriNetUnfolderBase]: For 62516/62516 co-relation queries the response was YES. [2024-06-04 16:07:15,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7874 conditions, 1109 events. 631/1109 cut-off events. For 62516/62516 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 5471 event pairs, 91 based on Foata normal form. 1/1110 useless extension candidates. Maximal degree in co-relation 7754. Up to 1005 conditions per place. [2024-06-04 16:07:15,662 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 216 selfloop transitions, 32 changer transitions 0/250 dead transitions. [2024-06-04 16:07:15,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 250 transitions, 3244 flow [2024-06-04 16:07:15,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:07:15,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:07:15,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2024-06-04 16:07:15,663 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3393939393939394 [2024-06-04 16:07:15,663 INFO L175 Difference]: Start difference. First operand has 257 places, 232 transitions, 2674 flow. Second operand 10 states and 112 transitions. [2024-06-04 16:07:15,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 250 transitions, 3244 flow [2024-06-04 16:07:15,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 250 transitions, 3135 flow, removed 27 selfloop flow, removed 9 redundant places. [2024-06-04 16:07:15,854 INFO L231 Difference]: Finished difference. Result has 258 places, 232 transitions, 2637 flow [2024-06-04 16:07:15,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2565, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2637, PETRI_PLACES=258, PETRI_TRANSITIONS=232} [2024-06-04 16:07:15,854 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 226 predicate places. [2024-06-04 16:07:15,854 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 232 transitions, 2637 flow [2024-06-04 16:07:15,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:07:15,854 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:07:15,854 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:07:15,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-04 16:07:15,855 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 16:07:15,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:07:15,855 INFO L85 PathProgramCache]: Analyzing trace with hash 27675501, now seen corresponding path program 3 times [2024-06-04 16:07:15,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:07:15,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349898391] [2024-06-04 16:07:15,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:07:15,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:07:15,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:07:21,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 16:07:21,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:07:21,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349898391] [2024-06-04 16:07:21,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349898391] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:07:21,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:07:21,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:07:21,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003160690] [2024-06-04 16:07:21,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:07:21,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:07:21,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:07:21,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:07:21,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:07:21,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:07:21,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 232 transitions, 2637 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:07:21,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:07:21,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:07:21,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:07:22,415 INFO L124 PetriNetUnfolderBase]: 657/1151 cut-off events. [2024-06-04 16:07:22,416 INFO L125 PetriNetUnfolderBase]: For 76240/76240 co-relation queries the response was YES. [2024-06-04 16:07:22,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8463 conditions, 1151 events. 657/1151 cut-off events. For 76240/76240 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5689 event pairs, 77 based on Foata normal form. 2/1153 useless extension candidates. Maximal degree in co-relation 8342. Up to 839 conditions per place. [2024-06-04 16:07:22,427 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 181 selfloop transitions, 79 changer transitions 0/262 dead transitions. [2024-06-04 16:07:22,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 262 transitions, 3671 flow [2024-06-04 16:07:22,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:07:22,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:07:22,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2024-06-04 16:07:22,428 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-04 16:07:22,428 INFO L175 Difference]: Start difference. First operand has 258 places, 232 transitions, 2637 flow. Second operand 11 states and 132 transitions. [2024-06-04 16:07:22,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 262 transitions, 3671 flow [2024-06-04 16:07:22,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 262 transitions, 3601 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-04 16:07:22,702 INFO L231 Difference]: Finished difference. Result has 261 places, 238 transitions, 2872 flow [2024-06-04 16:07:22,702 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2567, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2872, PETRI_PLACES=261, PETRI_TRANSITIONS=238} [2024-06-04 16:07:22,703 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 229 predicate places. [2024-06-04 16:07:22,703 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 238 transitions, 2872 flow [2024-06-04 16:07:22,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:07:22,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:07:22,703 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 16:07:22,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-04 16:07:22,703 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 16:07:22,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:07:22,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1590759958, now seen corresponding path program 1 times [2024-06-04 16:07:22,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:07:22,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134822770] [2024-06-04 16:07:22,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:07:22,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:07:22,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:07:29,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:07:29,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:07:29,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134822770] [2024-06-04 16:07:29,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134822770] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:07:29,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:07:29,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:07:29,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358428444] [2024-06-04 16:07:29,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:07:29,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:07:29,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:07:29,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:07:29,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:07:29,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:07:29,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 238 transitions, 2872 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:07:29,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:07:29,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:07:29,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:07:29,977 INFO L124 PetriNetUnfolderBase]: 660/1156 cut-off events. [2024-06-04 16:07:29,978 INFO L125 PetriNetUnfolderBase]: For 76695/76695 co-relation queries the response was YES. [2024-06-04 16:07:29,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8701 conditions, 1156 events. 660/1156 cut-off events. For 76695/76695 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5748 event pairs, 155 based on Foata normal form. 1/1157 useless extension candidates. Maximal degree in co-relation 8579. Up to 1010 conditions per place. [2024-06-04 16:07:29,989 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 201 selfloop transitions, 52 changer transitions 0/255 dead transitions. [2024-06-04 16:07:29,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 255 transitions, 3476 flow [2024-06-04 16:07:29,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:07:29,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:07:29,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-04 16:07:29,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3575757575757576 [2024-06-04 16:07:29,990 INFO L175 Difference]: Start difference. First operand has 261 places, 238 transitions, 2872 flow. Second operand 10 states and 118 transitions. [2024-06-04 16:07:29,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 255 transitions, 3476 flow [2024-06-04 16:07:30,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 255 transitions, 3352 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-06-04 16:07:30,229 INFO L231 Difference]: Finished difference. Result has 264 places, 240 transitions, 2916 flow [2024-06-04 16:07:30,229 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2748, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2916, PETRI_PLACES=264, PETRI_TRANSITIONS=240} [2024-06-04 16:07:30,230 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 232 predicate places. [2024-06-04 16:07:30,230 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 240 transitions, 2916 flow [2024-06-04 16:07:30,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:07:30,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:07:30,230 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 16:07:30,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-04 16:07:30,230 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 16:07:30,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:07:30,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1590975439, now seen corresponding path program 6 times [2024-06-04 16:07:30,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:07:30,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246973964] [2024-06-04 16:07:30,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:07:30,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:07:30,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:07:34,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:07:34,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:07:34,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246973964] [2024-06-04 16:07:34,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246973964] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:07:34,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:07:34,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:07:34,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624504411] [2024-06-04 16:07:34,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:07:34,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:07:34,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:07:34,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:07:34,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:07:34,478 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:07:34,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 240 transitions, 2916 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:07:34,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:07:34,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:07:34,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:07:35,026 INFO L124 PetriNetUnfolderBase]: 664/1164 cut-off events. [2024-06-04 16:07:35,026 INFO L125 PetriNetUnfolderBase]: For 78881/78881 co-relation queries the response was YES. [2024-06-04 16:07:35,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8794 conditions, 1164 events. 664/1164 cut-off events. For 78881/78881 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 5783 event pairs, 78 based on Foata normal form. 2/1166 useless extension candidates. Maximal degree in co-relation 8671. Up to 968 conditions per place. [2024-06-04 16:07:35,036 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 200 selfloop transitions, 58 changer transitions 0/260 dead transitions. [2024-06-04 16:07:35,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 260 transitions, 3536 flow [2024-06-04 16:07:35,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:07:35,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:07:35,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2024-06-04 16:07:35,038 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3515151515151515 [2024-06-04 16:07:35,038 INFO L175 Difference]: Start difference. First operand has 264 places, 240 transitions, 2916 flow. Second operand 10 states and 116 transitions. [2024-06-04 16:07:35,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 260 transitions, 3536 flow [2024-06-04 16:07:35,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 260 transitions, 3400 flow, removed 18 selfloop flow, removed 9 redundant places. [2024-06-04 16:07:35,280 INFO L231 Difference]: Finished difference. Result has 265 places, 241 transitions, 2928 flow [2024-06-04 16:07:35,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2780, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2928, PETRI_PLACES=265, PETRI_TRANSITIONS=241} [2024-06-04 16:07:35,281 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 233 predicate places. [2024-06-04 16:07:35,281 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 241 transitions, 2928 flow [2024-06-04 16:07:35,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:07:35,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:07:35,281 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 16:07:35,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-04 16:07:35,282 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 16:07:35,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:07:35,282 INFO L85 PathProgramCache]: Analyzing trace with hash 21961209, now seen corresponding path program 7 times [2024-06-04 16:07:35,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:07:35,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070462999] [2024-06-04 16:07:35,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:07:35,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:07:35,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:07:39,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:07:39,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:07:39,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070462999] [2024-06-04 16:07:39,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070462999] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:07:39,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:07:39,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:07:39,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13098774] [2024-06-04 16:07:39,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:07:39,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:07:39,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:07:39,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:07:39,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:07:39,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:07:39,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 241 transitions, 2928 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:07:39,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:07:39,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:07:39,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:07:40,168 INFO L124 PetriNetUnfolderBase]: 668/1172 cut-off events. [2024-06-04 16:07:40,168 INFO L125 PetriNetUnfolderBase]: For 79425/79425 co-relation queries the response was YES. [2024-06-04 16:07:40,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8861 conditions, 1172 events. 668/1172 cut-off events. For 79425/79425 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 5846 event pairs, 88 based on Foata normal form. 2/1174 useless extension candidates. Maximal degree in co-relation 8738. Up to 1015 conditions per place. [2024-06-04 16:07:40,180 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 212 selfloop transitions, 45 changer transitions 0/259 dead transitions. [2024-06-04 16:07:40,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 259 transitions, 3534 flow [2024-06-04 16:07:40,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:07:40,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:07:40,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2024-06-04 16:07:40,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34545454545454546 [2024-06-04 16:07:40,182 INFO L175 Difference]: Start difference. First operand has 265 places, 241 transitions, 2928 flow. Second operand 10 states and 114 transitions. [2024-06-04 16:07:40,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 259 transitions, 3534 flow [2024-06-04 16:07:40,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 259 transitions, 3396 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-04 16:07:40,437 INFO L231 Difference]: Finished difference. Result has 267 places, 242 transitions, 2914 flow [2024-06-04 16:07:40,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2790, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2914, PETRI_PLACES=267, PETRI_TRANSITIONS=242} [2024-06-04 16:07:40,437 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 235 predicate places. [2024-06-04 16:07:40,437 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 242 transitions, 2914 flow [2024-06-04 16:07:40,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:07:40,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:07:40,438 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 16:07:40,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-04 16:07:40,438 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 16:07:40,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:07:40,438 INFO L85 PathProgramCache]: Analyzing trace with hash 27473691, now seen corresponding path program 4 times [2024-06-04 16:07:40,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:07:40,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416352417] [2024-06-04 16:07:40,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:07:40,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:07:40,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:07:46,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 16:07:46,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:07:46,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416352417] [2024-06-04 16:07:46,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416352417] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:07:46,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:07:46,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:07:46,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96069805] [2024-06-04 16:07:46,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:07:46,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:07:46,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:07:46,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:07:46,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:07:46,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:07:46,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 242 transitions, 2914 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:07:46,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:07:46,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:07:46,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:07:47,259 INFO L124 PetriNetUnfolderBase]: 674/1182 cut-off events. [2024-06-04 16:07:47,259 INFO L125 PetriNetUnfolderBase]: For 81475/81475 co-relation queries the response was YES. [2024-06-04 16:07:47,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8910 conditions, 1182 events. 674/1182 cut-off events. For 81475/81475 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 5903 event pairs, 80 based on Foata normal form. 2/1184 useless extension candidates. Maximal degree in co-relation 8786. Up to 976 conditions per place. [2024-06-04 16:07:47,271 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 202 selfloop transitions, 61 changer transitions 0/265 dead transitions. [2024-06-04 16:07:47,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 265 transitions, 3582 flow [2024-06-04 16:07:47,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:07:47,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:07:47,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 126 transitions. [2024-06-04 16:07:47,272 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34710743801652894 [2024-06-04 16:07:47,272 INFO L175 Difference]: Start difference. First operand has 267 places, 242 transitions, 2914 flow. Second operand 11 states and 126 transitions. [2024-06-04 16:07:47,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 265 transitions, 3582 flow [2024-06-04 16:07:47,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 265 transitions, 3468 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-04 16:07:47,501 INFO L231 Difference]: Finished difference. Result has 270 places, 244 transitions, 2979 flow [2024-06-04 16:07:47,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2800, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2979, PETRI_PLACES=270, PETRI_TRANSITIONS=244} [2024-06-04 16:07:47,501 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 238 predicate places. [2024-06-04 16:07:47,501 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 244 transitions, 2979 flow [2024-06-04 16:07:47,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:07:47,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:07:47,501 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 16:07:47,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-04 16:07:47,501 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 16:07:47,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:07:47,502 INFO L85 PathProgramCache]: Analyzing trace with hash 27682941, now seen corresponding path program 5 times [2024-06-04 16:07:47,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:07:47,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027066169] [2024-06-04 16:07:47,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:07:47,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:07:47,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:07:53,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:07:53,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:07:53,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027066169] [2024-06-04 16:07:53,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027066169] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:07:53,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:07:53,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:07:53,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150112941] [2024-06-04 16:07:53,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:07:53,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:07:53,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:07:53,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:07:53,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:07:53,283 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:07:53,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 244 transitions, 2979 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:07:53,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:07:53,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:07:53,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:07:53,933 INFO L124 PetriNetUnfolderBase]: 670/1176 cut-off events. [2024-06-04 16:07:53,934 INFO L125 PetriNetUnfolderBase]: For 78591/78591 co-relation queries the response was YES. [2024-06-04 16:07:53,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8760 conditions, 1176 events. 670/1176 cut-off events. For 78591/78591 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 5873 event pairs, 77 based on Foata normal form. 2/1178 useless extension candidates. Maximal degree in co-relation 8635. Up to 863 conditions per place. [2024-06-04 16:07:53,946 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 179 selfloop transitions, 87 changer transitions 0/268 dead transitions. [2024-06-04 16:07:53,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 268 transitions, 3761 flow [2024-06-04 16:07:53,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:07:53,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:07:53,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 131 transitions. [2024-06-04 16:07:53,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3608815426997245 [2024-06-04 16:07:53,947 INFO L175 Difference]: Start difference. First operand has 270 places, 244 transitions, 2979 flow. Second operand 11 states and 131 transitions. [2024-06-04 16:07:53,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 268 transitions, 3761 flow [2024-06-04 16:07:54,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 268 transitions, 3564 flow, removed 39 selfloop flow, removed 9 redundant places. [2024-06-04 16:07:54,185 INFO L231 Difference]: Finished difference. Result has 272 places, 244 transitions, 2962 flow [2024-06-04 16:07:54,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2782, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2962, PETRI_PLACES=272, PETRI_TRANSITIONS=244} [2024-06-04 16:07:54,185 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 240 predicate places. [2024-06-04 16:07:54,185 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 244 transitions, 2962 flow [2024-06-04 16:07:54,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:07:54,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:07:54,185 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 16:07:54,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-04 16:07:54,185 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 16:07:54,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:07:54,186 INFO L85 PathProgramCache]: Analyzing trace with hash 21957489, now seen corresponding path program 8 times [2024-06-04 16:07:54,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:07:54,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142398825] [2024-06-04 16:07:54,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:07:54,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:07:54,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:07:58,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:07:58,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:07:58,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142398825] [2024-06-04 16:07:58,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142398825] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:07:58,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:07:58,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:07:58,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398212653] [2024-06-04 16:07:58,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:07:58,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:07:58,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:07:58,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:07:58,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:07:58,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:07:58,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 244 transitions, 2962 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:07:58,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:07:58,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:07:58,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:07:59,059 INFO L124 PetriNetUnfolderBase]: 674/1184 cut-off events. [2024-06-04 16:07:59,059 INFO L125 PetriNetUnfolderBase]: For 80462/80462 co-relation queries the response was YES. [2024-06-04 16:07:59,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8838 conditions, 1184 events. 674/1184 cut-off events. For 80462/80462 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 5921 event pairs, 87 based on Foata normal form. 2/1186 useless extension candidates. Maximal degree in co-relation 8712. Up to 1027 conditions per place. [2024-06-04 16:07:59,071 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 216 selfloop transitions, 44 changer transitions 0/262 dead transitions. [2024-06-04 16:07:59,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 262 transitions, 3570 flow [2024-06-04 16:07:59,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:07:59,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:07:59,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2024-06-04 16:07:59,072 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3424242424242424 [2024-06-04 16:07:59,072 INFO L175 Difference]: Start difference. First operand has 272 places, 244 transitions, 2962 flow. Second operand 10 states and 113 transitions. [2024-06-04 16:07:59,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 262 transitions, 3570 flow [2024-06-04 16:07:59,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 262 transitions, 3411 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-04 16:07:59,355 INFO L231 Difference]: Finished difference. Result has 273 places, 245 transitions, 2927 flow [2024-06-04 16:07:59,356 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2803, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2927, PETRI_PLACES=273, PETRI_TRANSITIONS=245} [2024-06-04 16:07:59,356 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 241 predicate places. [2024-06-04 16:07:59,356 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 245 transitions, 2927 flow [2024-06-04 16:07:59,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:07:59,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:07:59,357 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 16:07:59,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-04 16:07:59,357 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 16:07:59,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:07:59,357 INFO L85 PathProgramCache]: Analyzing trace with hash -959865013, now seen corresponding path program 6 times [2024-06-04 16:07:59,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:07:59,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920156594] [2024-06-04 16:07:59,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:07:59,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:07:59,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:08:05,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:08:05,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:08:05,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920156594] [2024-06-04 16:08:05,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920156594] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:08:05,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:08:05,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:08:05,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664814057] [2024-06-04 16:08:05,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:08:05,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:08:05,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:08:05,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:08:05,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:08:05,545 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:08:05,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 245 transitions, 2927 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:08:05,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:08:05,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:08:05,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:08:06,145 INFO L124 PetriNetUnfolderBase]: 675/1186 cut-off events. [2024-06-04 16:08:06,145 INFO L125 PetriNetUnfolderBase]: For 80178/80178 co-relation queries the response was YES. [2024-06-04 16:08:06,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8741 conditions, 1186 events. 675/1186 cut-off events. For 80178/80178 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 5948 event pairs, 89 based on Foata normal form. 2/1188 useless extension candidates. Maximal degree in co-relation 8614. Up to 1019 conditions per place. [2024-06-04 16:08:06,157 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 216 selfloop transitions, 48 changer transitions 0/266 dead transitions. [2024-06-04 16:08:06,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 266 transitions, 3587 flow [2024-06-04 16:08:06,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:08:06,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:08:06,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2024-06-04 16:08:06,158 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3415977961432507 [2024-06-04 16:08:06,158 INFO L175 Difference]: Start difference. First operand has 273 places, 245 transitions, 2927 flow. Second operand 11 states and 124 transitions. [2024-06-04 16:08:06,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 266 transitions, 3587 flow [2024-06-04 16:08:06,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 266 transitions, 3473 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-04 16:08:06,432 INFO L231 Difference]: Finished difference. Result has 276 places, 247 transitions, 2970 flow [2024-06-04 16:08:06,432 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2813, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2970, PETRI_PLACES=276, PETRI_TRANSITIONS=247} [2024-06-04 16:08:06,432 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 244 predicate places. [2024-06-04 16:08:06,432 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 247 transitions, 2970 flow [2024-06-04 16:08:06,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:08:06,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:08:06,433 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 16:08:06,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-04 16:08:06,433 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 16:08:06,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:08:06,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1100139507, now seen corresponding path program 1 times [2024-06-04 16:08:06,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:08:06,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546950574] [2024-06-04 16:08:06,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:08:06,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:08:06,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:08:12,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:08:12,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:08:12,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546950574] [2024-06-04 16:08:12,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546950574] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:08:12,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:08:12,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:08:12,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899818329] [2024-06-04 16:08:12,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:08:12,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:08:12,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:08:12,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:08:12,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:08:12,129 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:08:12,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 247 transitions, 2970 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:08:12,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:08:12,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:08:12,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:08:12,783 INFO L124 PetriNetUnfolderBase]: 683/1202 cut-off events. [2024-06-04 16:08:12,783 INFO L125 PetriNetUnfolderBase]: For 87647/87647 co-relation queries the response was YES. [2024-06-04 16:08:12,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8811 conditions, 1202 events. 683/1202 cut-off events. For 87647/87647 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 6129 event pairs, 150 based on Foata normal form. 4/1206 useless extension candidates. Maximal degree in co-relation 8683. Up to 1093 conditions per place. [2024-06-04 16:08:12,794 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 232 selfloop transitions, 34 changer transitions 0/268 dead transitions. [2024-06-04 16:08:12,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 268 transitions, 3586 flow [2024-06-04 16:08:12,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 16:08:12,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 16:08:12,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 125 transitions. [2024-06-04 16:08:12,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31565656565656564 [2024-06-04 16:08:12,809 INFO L175 Difference]: Start difference. First operand has 276 places, 247 transitions, 2970 flow. Second operand 12 states and 125 transitions. [2024-06-04 16:08:12,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 268 transitions, 3586 flow [2024-06-04 16:08:13,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 268 transitions, 3451 flow, removed 21 selfloop flow, removed 9 redundant places. [2024-06-04 16:08:13,056 INFO L231 Difference]: Finished difference. Result has 279 places, 248 transitions, 2927 flow [2024-06-04 16:08:13,056 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2835, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2927, PETRI_PLACES=279, PETRI_TRANSITIONS=248} [2024-06-04 16:08:13,056 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 247 predicate places. [2024-06-04 16:08:13,056 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 248 transitions, 2927 flow [2024-06-04 16:08:13,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:08:13,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:08:13,056 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:08:13,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-04 16:08:13,057 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 16:08:13,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:08:13,057 INFO L85 PathProgramCache]: Analyzing trace with hash -922438133, now seen corresponding path program 9 times [2024-06-04 16:08:13,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:08:13,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408434219] [2024-06-04 16:08:13,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:08:13,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:08:13,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:08:16,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:08:16,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:08:16,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408434219] [2024-06-04 16:08:16,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408434219] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:08:16,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:08:16,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:08:16,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817031076] [2024-06-04 16:08:16,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:08:16,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:08:16,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:08:16,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:08:16,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:08:17,104 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:08:17,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 248 transitions, 2927 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:08:17,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:08:17,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:08:17,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:08:17,720 INFO L124 PetriNetUnfolderBase]: 687/1210 cut-off events. [2024-06-04 16:08:17,720 INFO L125 PetriNetUnfolderBase]: For 84259/84259 co-relation queries the response was YES. [2024-06-04 16:08:17,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8833 conditions, 1210 events. 687/1210 cut-off events. For 84259/84259 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 6128 event pairs, 134 based on Foata normal form. 2/1212 useless extension candidates. Maximal degree in co-relation 8704. Up to 1053 conditions per place. [2024-06-04 16:08:17,733 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 216 selfloop transitions, 46 changer transitions 0/264 dead transitions. [2024-06-04 16:08:17,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 264 transitions, 3531 flow [2024-06-04 16:08:17,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:08:17,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:08:17,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2024-06-04 16:08:17,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-04 16:08:17,735 INFO L175 Difference]: Start difference. First operand has 279 places, 248 transitions, 2927 flow. Second operand 9 states and 99 transitions. [2024-06-04 16:08:17,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 264 transitions, 3531 flow [2024-06-04 16:08:18,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 264 transitions, 3449 flow, removed 8 selfloop flow, removed 10 redundant places. [2024-06-04 16:08:18,040 INFO L231 Difference]: Finished difference. Result has 278 places, 249 transitions, 2982 flow [2024-06-04 16:08:18,040 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2845, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2982, PETRI_PLACES=278, PETRI_TRANSITIONS=249} [2024-06-04 16:08:18,040 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 246 predicate places. [2024-06-04 16:08:18,040 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 249 transitions, 2982 flow [2024-06-04 16:08:18,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:08:18,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:08:18,040 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 16:08:18,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-04 16:08:18,040 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 16:08:18,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:08:18,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1002076483, now seen corresponding path program 10 times [2024-06-04 16:08:18,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:08:18,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799925093] [2024-06-04 16:08:18,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:08:18,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:08:18,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:08:22,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 16:08:22,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:08:22,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799925093] [2024-06-04 16:08:22,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799925093] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:08:22,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:08:22,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:08:22,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720585465] [2024-06-04 16:08:22,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:08:22,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:08:22,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:08:22,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:08:22,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:08:22,373 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:08:22,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 249 transitions, 2982 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:08:22,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:08:22,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:08:22,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:08:22,900 INFO L124 PetriNetUnfolderBase]: 691/1218 cut-off events. [2024-06-04 16:08:22,900 INFO L125 PetriNetUnfolderBase]: For 87067/87067 co-relation queries the response was YES. [2024-06-04 16:08:22,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8969 conditions, 1218 events. 691/1218 cut-off events. For 87067/87067 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 6196 event pairs, 130 based on Foata normal form. 2/1220 useless extension candidates. Maximal degree in co-relation 8839. Up to 1070 conditions per place. [2024-06-04 16:08:22,913 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 226 selfloop transitions, 37 changer transitions 0/265 dead transitions. [2024-06-04 16:08:22,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 265 transitions, 3584 flow [2024-06-04 16:08:22,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:08:22,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:08:22,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-04 16:08:22,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32996632996632996 [2024-06-04 16:08:22,913 INFO L175 Difference]: Start difference. First operand has 278 places, 249 transitions, 2982 flow. Second operand 9 states and 98 transitions. [2024-06-04 16:08:22,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 265 transitions, 3584 flow [2024-06-04 16:08:23,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 265 transitions, 3463 flow, removed 19 selfloop flow, removed 7 redundant places. [2024-06-04 16:08:23,167 INFO L231 Difference]: Finished difference. Result has 280 places, 250 transitions, 2979 flow [2024-06-04 16:08:23,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2865, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2979, PETRI_PLACES=280, PETRI_TRANSITIONS=250} [2024-06-04 16:08:23,168 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 248 predicate places. [2024-06-04 16:08:23,168 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 250 transitions, 2979 flow [2024-06-04 16:08:23,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:08:23,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:08:23,168 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 16:08:23,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-04 16:08:23,168 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 16:08:23,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:08:23,168 INFO L85 PathProgramCache]: Analyzing trace with hash -53297302, now seen corresponding path program 3 times [2024-06-04 16:08:23,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:08:23,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68686428] [2024-06-04 16:08:23,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:08:23,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:08:23,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:08:27,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:08:27,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:08:27,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68686428] [2024-06-04 16:08:27,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68686428] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:08:27,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:08:27,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:08:27,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599593378] [2024-06-04 16:08:27,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:08:27,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:08:27,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:08:27,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:08:27,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:08:27,559 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:08:27,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 250 transitions, 2979 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:08:27,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:08:27,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:08:27,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:08:28,035 INFO L124 PetriNetUnfolderBase]: 689/1215 cut-off events. [2024-06-04 16:08:28,035 INFO L125 PetriNetUnfolderBase]: For 78859/78859 co-relation queries the response was YES. [2024-06-04 16:08:28,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8780 conditions, 1215 events. 689/1215 cut-off events. For 78859/78859 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 6182 event pairs, 132 based on Foata normal form. 1/1216 useless extension candidates. Maximal degree in co-relation 8649. Up to 1049 conditions per place. [2024-06-04 16:08:28,047 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 208 selfloop transitions, 55 changer transitions 0/265 dead transitions. [2024-06-04 16:08:28,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 265 transitions, 3559 flow [2024-06-04 16:08:28,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:08:28,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:08:28,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2024-06-04 16:08:28,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3367003367003367 [2024-06-04 16:08:28,048 INFO L175 Difference]: Start difference. First operand has 280 places, 250 transitions, 2979 flow. Second operand 9 states and 100 transitions. [2024-06-04 16:08:28,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 265 transitions, 3559 flow [2024-06-04 16:08:28,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 265 transitions, 3443 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-06-04 16:08:28,327 INFO L231 Difference]: Finished difference. Result has 282 places, 250 transitions, 2993 flow [2024-06-04 16:08:28,327 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2863, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2993, PETRI_PLACES=282, PETRI_TRANSITIONS=250} [2024-06-04 16:08:28,327 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 250 predicate places. [2024-06-04 16:08:28,327 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 250 transitions, 2993 flow [2024-06-04 16:08:28,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:08:28,328 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:08:28,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 16:08:28,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-04 16:08:28,328 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 16:08:28,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:08:28,328 INFO L85 PathProgramCache]: Analyzing trace with hash -931050557, now seen corresponding path program 7 times [2024-06-04 16:08:28,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:08:28,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977495180] [2024-06-04 16:08:28,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:08:28,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:08:28,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:08:34,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:08:34,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:08:34,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977495180] [2024-06-04 16:08:34,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977495180] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:08:34,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:08:34,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:08:34,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234716787] [2024-06-04 16:08:34,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:08:34,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:08:34,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:08:34,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:08:34,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:08:34,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:08:34,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 250 transitions, 2993 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:08:34,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:08:34,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:08:34,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:08:34,948 INFO L124 PetriNetUnfolderBase]: 695/1225 cut-off events. [2024-06-04 16:08:34,948 INFO L125 PetriNetUnfolderBase]: For 78871/78871 co-relation queries the response was YES. [2024-06-04 16:08:34,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8847 conditions, 1225 events. 695/1225 cut-off events. For 78871/78871 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 6235 event pairs, 133 based on Foata normal form. 2/1227 useless extension candidates. Maximal degree in co-relation 8715. Up to 1062 conditions per place. [2024-06-04 16:08:34,961 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 221 selfloop transitions, 46 changer transitions 0/269 dead transitions. [2024-06-04 16:08:34,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 269 transitions, 3641 flow [2024-06-04 16:08:34,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:08:34,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:08:34,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2024-06-04 16:08:34,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3303030303030303 [2024-06-04 16:08:34,963 INFO L175 Difference]: Start difference. First operand has 282 places, 250 transitions, 2993 flow. Second operand 10 states and 109 transitions. [2024-06-04 16:08:34,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 269 transitions, 3641 flow [2024-06-04 16:08:35,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 269 transitions, 3481 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-04 16:08:35,235 INFO L231 Difference]: Finished difference. Result has 283 places, 252 transitions, 2990 flow [2024-06-04 16:08:35,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2833, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2990, PETRI_PLACES=283, PETRI_TRANSITIONS=252} [2024-06-04 16:08:35,235 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 251 predicate places. [2024-06-04 16:08:35,235 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 252 transitions, 2990 flow [2024-06-04 16:08:35,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:08:35,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:08:35,235 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 16:08:35,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-04 16:08:35,236 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 16:08:35,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:08:35,236 INFO L85 PathProgramCache]: Analyzing trace with hash 271786601, now seen corresponding path program 11 times [2024-06-04 16:08:35,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:08:35,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686024909] [2024-06-04 16:08:35,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:08:35,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:08:35,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:08:39,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:08:39,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:08:39,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686024909] [2024-06-04 16:08:39,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686024909] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:08:39,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:08:39,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:08:39,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762411817] [2024-06-04 16:08:39,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:08:39,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:08:39,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:08:39,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:08:39,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:08:39,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:08:39,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 252 transitions, 2990 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:08:39,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:08:39,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:08:39,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:08:40,171 INFO L124 PetriNetUnfolderBase]: 699/1233 cut-off events. [2024-06-04 16:08:40,172 INFO L125 PetriNetUnfolderBase]: For 77696/77696 co-relation queries the response was YES. [2024-06-04 16:08:40,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8865 conditions, 1233 events. 699/1233 cut-off events. For 77696/77696 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 6288 event pairs, 76 based on Foata normal form. 2/1235 useless extension candidates. Maximal degree in co-relation 8733. Up to 995 conditions per place. [2024-06-04 16:08:40,184 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 196 selfloop transitions, 71 changer transitions 0/269 dead transitions. [2024-06-04 16:08:40,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 269 transitions, 3616 flow [2024-06-04 16:08:40,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:08:40,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:08:40,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2024-06-04 16:08:40,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3501683501683502 [2024-06-04 16:08:40,185 INFO L175 Difference]: Start difference. First operand has 283 places, 252 transitions, 2990 flow. Second operand 9 states and 104 transitions. [2024-06-04 16:08:40,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 269 transitions, 3616 flow [2024-06-04 16:08:40,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 269 transitions, 3499 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-04 16:08:40,486 INFO L231 Difference]: Finished difference. Result has 284 places, 253 transitions, 3051 flow [2024-06-04 16:08:40,486 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2873, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3051, PETRI_PLACES=284, PETRI_TRANSITIONS=253} [2024-06-04 16:08:40,487 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 252 predicate places. [2024-06-04 16:08:40,487 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 253 transitions, 3051 flow [2024-06-04 16:08:40,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:08:40,487 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:08:40,487 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:08:40,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-04 16:08:40,487 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 16:08:40,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:08:40,488 INFO L85 PathProgramCache]: Analyzing trace with hash -786950777, now seen corresponding path program 8 times [2024-06-04 16:08:40,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:08:40,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494425289] [2024-06-04 16:08:40,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:08:40,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:08:40,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:08:46,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:08:46,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:08:46,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494425289] [2024-06-04 16:08:46,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494425289] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:08:46,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:08:46,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:08:46,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764419642] [2024-06-04 16:08:46,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:08:46,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:08:46,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:08:46,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:08:46,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:08:46,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:08:46,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 253 transitions, 3051 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:08:46,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:08:46,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:08:46,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:08:47,262 INFO L124 PetriNetUnfolderBase]: 715/1259 cut-off events. [2024-06-04 16:08:47,262 INFO L125 PetriNetUnfolderBase]: For 85918/85918 co-relation queries the response was YES. [2024-06-04 16:08:47,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9320 conditions, 1259 events. 715/1259 cut-off events. For 85918/85918 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 6426 event pairs, 74 based on Foata normal form. 2/1261 useless extension candidates. Maximal degree in co-relation 9187. Up to 817 conditions per place. [2024-06-04 16:08:47,272 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 155 selfloop transitions, 121 changer transitions 0/278 dead transitions. [2024-06-04 16:08:47,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 278 transitions, 3953 flow [2024-06-04 16:08:47,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:08:47,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:08:47,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2024-06-04 16:08:47,274 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3606060606060606 [2024-06-04 16:08:47,274 INFO L175 Difference]: Start difference. First operand has 284 places, 253 transitions, 3051 flow. Second operand 10 states and 119 transitions. [2024-06-04 16:08:47,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 278 transitions, 3953 flow [2024-06-04 16:08:47,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 278 transitions, 3785 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-04 16:08:47,566 INFO L231 Difference]: Finished difference. Result has 287 places, 257 transitions, 3249 flow [2024-06-04 16:08:47,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2885, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3249, PETRI_PLACES=287, PETRI_TRANSITIONS=257} [2024-06-04 16:08:47,567 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 255 predicate places. [2024-06-04 16:08:47,567 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 257 transitions, 3249 flow [2024-06-04 16:08:47,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:08:47,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:08:47,567 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 16:08:47,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-04 16:08:47,568 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 16:08:47,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:08:47,568 INFO L85 PathProgramCache]: Analyzing trace with hash -774238483, now seen corresponding path program 12 times [2024-06-04 16:08:47,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:08:47,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234287963] [2024-06-04 16:08:47,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:08:47,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:08:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:08:51,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:08:51,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:08:51,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234287963] [2024-06-04 16:08:51,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234287963] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:08:51,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:08:51,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:08:51,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942814461] [2024-06-04 16:08:51,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:08:51,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:08:51,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:08:51,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:08:51,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:08:51,676 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:08:51,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 257 transitions, 3249 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:08:51,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:08:51,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:08:51,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:08:52,249 INFO L124 PetriNetUnfolderBase]: 719/1267 cut-off events. [2024-06-04 16:08:52,249 INFO L125 PetriNetUnfolderBase]: For 86068/86068 co-relation queries the response was YES. [2024-06-04 16:08:52,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9520 conditions, 1267 events. 719/1267 cut-off events. For 86068/86068 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 6489 event pairs, 100 based on Foata normal form. 2/1269 useless extension candidates. Maximal degree in co-relation 9386. Up to 1096 conditions per place. [2024-06-04 16:08:52,259 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 221 selfloop transitions, 49 changer transitions 0/272 dead transitions. [2024-06-04 16:08:52,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 272 transitions, 3867 flow [2024-06-04 16:08:52,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:08:52,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:08:52,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2024-06-04 16:08:52,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3434343434343434 [2024-06-04 16:08:52,261 INFO L175 Difference]: Start difference. First operand has 287 places, 257 transitions, 3249 flow. Second operand 9 states and 102 transitions. [2024-06-04 16:08:52,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 272 transitions, 3867 flow [2024-06-04 16:08:52,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 272 transitions, 3677 flow, removed 28 selfloop flow, removed 7 redundant places. [2024-06-04 16:08:52,591 INFO L231 Difference]: Finished difference. Result has 289 places, 258 transitions, 3193 flow [2024-06-04 16:08:52,591 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3059, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3193, PETRI_PLACES=289, PETRI_TRANSITIONS=258} [2024-06-04 16:08:52,591 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 257 predicate places. [2024-06-04 16:08:52,591 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 258 transitions, 3193 flow [2024-06-04 16:08:52,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:08:52,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:08:52,591 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 16:08:52,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-04 16:08:52,591 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 16:08:52,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:08:52,592 INFO L85 PathProgramCache]: Analyzing trace with hash -774242203, now seen corresponding path program 13 times [2024-06-04 16:08:52,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:08:52,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518527627] [2024-06-04 16:08:52,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:08:52,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:08:52,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:08:56,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:08:56,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:08:56,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518527627] [2024-06-04 16:08:56,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518527627] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:08:56,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:08:56,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:08:56,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119138854] [2024-06-04 16:08:56,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:08:56,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:08:56,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:08:56,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:08:56,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:08:57,004 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:08:57,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 258 transitions, 3193 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:08:57,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:08:57,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:08:57,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:08:57,577 INFO L124 PetriNetUnfolderBase]: 723/1275 cut-off events. [2024-06-04 16:08:57,577 INFO L125 PetriNetUnfolderBase]: For 85733/85733 co-relation queries the response was YES. [2024-06-04 16:08:57,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9524 conditions, 1275 events. 723/1275 cut-off events. For 85733/85733 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 6543 event pairs, 96 based on Foata normal form. 2/1277 useless extension candidates. Maximal degree in co-relation 9389. Up to 1104 conditions per place. [2024-06-04 16:08:57,591 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 224 selfloop transitions, 47 changer transitions 0/273 dead transitions. [2024-06-04 16:08:57,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 273 transitions, 3809 flow [2024-06-04 16:08:57,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:08:57,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:08:57,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2024-06-04 16:08:57,592 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3400673400673401 [2024-06-04 16:08:57,592 INFO L175 Difference]: Start difference. First operand has 289 places, 258 transitions, 3193 flow. Second operand 9 states and 101 transitions. [2024-06-04 16:08:57,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 273 transitions, 3809 flow [2024-06-04 16:08:57,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 273 transitions, 3685 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-04 16:08:57,932 INFO L231 Difference]: Finished difference. Result has 291 places, 259 transitions, 3201 flow [2024-06-04 16:08:57,932 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3071, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3201, PETRI_PLACES=291, PETRI_TRANSITIONS=259} [2024-06-04 16:08:57,932 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 259 predicate places. [2024-06-04 16:08:57,933 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 259 transitions, 3201 flow [2024-06-04 16:08:57,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:08:57,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:08:57,933 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 16:08:57,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-04 16:08:57,933 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 16:08:57,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:08:57,934 INFO L85 PathProgramCache]: Analyzing trace with hash -792522407, now seen corresponding path program 9 times [2024-06-04 16:08:57,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:08:57,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816986872] [2024-06-04 16:08:57,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:08:57,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:08:57,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:09:04,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:09:04,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:09:04,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816986872] [2024-06-04 16:09:04,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816986872] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:09:04,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:09:04,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:09:04,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658655719] [2024-06-04 16:09:04,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:09:04,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:09:04,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:09:04,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:09:04,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:09:04,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:09:04,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 259 transitions, 3201 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:09:04,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:09:04,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:09:04,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:09:05,242 INFO L124 PetriNetUnfolderBase]: 729/1285 cut-off events. [2024-06-04 16:09:05,242 INFO L125 PetriNetUnfolderBase]: For 85699/85699 co-relation queries the response was YES. [2024-06-04 16:09:05,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9579 conditions, 1285 events. 729/1285 cut-off events. For 85699/85699 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 6636 event pairs, 100 based on Foata normal form. 2/1287 useless extension candidates. Maximal degree in co-relation 9443. Up to 1094 conditions per place. [2024-06-04 16:09:05,255 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 220 selfloop transitions, 55 changer transitions 0/277 dead transitions. [2024-06-04 16:09:05,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 277 transitions, 3871 flow [2024-06-04 16:09:05,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:09:05,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:09:05,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2024-06-04 16:09:05,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3393939393939394 [2024-06-04 16:09:05,256 INFO L175 Difference]: Start difference. First operand has 291 places, 259 transitions, 3201 flow. Second operand 10 states and 112 transitions. [2024-06-04 16:09:05,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 277 transitions, 3871 flow [2024-06-04 16:09:05,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 277 transitions, 3753 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-04 16:09:05,599 INFO L231 Difference]: Finished difference. Result has 294 places, 261 transitions, 3259 flow [2024-06-04 16:09:05,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3083, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3259, PETRI_PLACES=294, PETRI_TRANSITIONS=261} [2024-06-04 16:09:05,599 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 262 predicate places. [2024-06-04 16:09:05,599 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 261 transitions, 3259 flow [2024-06-04 16:09:05,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:09:05,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:09:05,600 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 16:09:05,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-04 16:09:05,600 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 16:09:05,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:09:05,600 INFO L85 PathProgramCache]: Analyzing trace with hash -768524191, now seen corresponding path program 10 times [2024-06-04 16:09:05,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:09:05,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572997825] [2024-06-04 16:09:05,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:09:05,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:09:05,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:09:12,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:09:12,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:09:12,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572997825] [2024-06-04 16:09:12,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572997825] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:09:12,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:09:12,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:09:12,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386071710] [2024-06-04 16:09:12,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:09:12,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:09:12,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:09:12,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:09:12,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:09:12,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:09:12,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 261 transitions, 3259 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:09:12,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:09:12,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:09:12,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:09:13,427 INFO L124 PetriNetUnfolderBase]: 735/1295 cut-off events. [2024-06-04 16:09:13,427 INFO L125 PetriNetUnfolderBase]: For 85762/85762 co-relation queries the response was YES. [2024-06-04 16:09:13,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9679 conditions, 1295 events. 735/1295 cut-off events. For 85762/85762 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 6689 event pairs, 76 based on Foata normal form. 2/1297 useless extension candidates. Maximal degree in co-relation 9542. Up to 950 conditions per place. [2024-06-04 16:09:13,441 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 179 selfloop transitions, 101 changer transitions 0/282 dead transitions. [2024-06-04 16:09:13,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 282 transitions, 3963 flow [2024-06-04 16:09:13,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:09:13,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:09:13,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2024-06-04 16:09:13,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3515151515151515 [2024-06-04 16:09:13,442 INFO L175 Difference]: Start difference. First operand has 294 places, 261 transitions, 3259 flow. Second operand 10 states and 116 transitions. [2024-06-04 16:09:13,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 282 transitions, 3963 flow [2024-06-04 16:09:13,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 282 transitions, 3817 flow, removed 21 selfloop flow, removed 8 redundant places. [2024-06-04 16:09:13,807 INFO L231 Difference]: Finished difference. Result has 296 places, 263 transitions, 3385 flow [2024-06-04 16:09:13,809 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3113, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3385, PETRI_PLACES=296, PETRI_TRANSITIONS=263} [2024-06-04 16:09:13,810 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 264 predicate places. [2024-06-04 16:09:13,810 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 263 transitions, 3385 flow [2024-06-04 16:09:13,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:09:13,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:09:13,810 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 16:09:13,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-04 16:09:13,810 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 16:09:13,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:09:13,811 INFO L85 PathProgramCache]: Analyzing trace with hash -768726001, now seen corresponding path program 11 times [2024-06-04 16:09:13,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:09:13,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431215830] [2024-06-04 16:09:13,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:09:13,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:09:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:09:19,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:09:19,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:09:19,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431215830] [2024-06-04 16:09:19,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431215830] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:09:19,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:09:19,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:09:19,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019761259] [2024-06-04 16:09:19,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:09:19,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:09:19,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:09:19,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:09:19,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:09:19,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:09:19,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 263 transitions, 3385 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:09:19,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:09:19,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:09:19,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:09:20,288 INFO L124 PetriNetUnfolderBase]: 736/1297 cut-off events. [2024-06-04 16:09:20,288 INFO L125 PetriNetUnfolderBase]: For 85240/85240 co-relation queries the response was YES. [2024-06-04 16:09:20,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9772 conditions, 1297 events. 736/1297 cut-off events. For 85240/85240 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 6715 event pairs, 80 based on Foata normal form. 2/1299 useless extension candidates. Maximal degree in co-relation 9634. Up to 1039 conditions per place. [2024-06-04 16:09:20,302 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 204 selfloop transitions, 77 changer transitions 0/283 dead transitions. [2024-06-04 16:09:20,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 283 transitions, 4089 flow [2024-06-04 16:09:20,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:09:20,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:09:20,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2024-06-04 16:09:20,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34545454545454546 [2024-06-04 16:09:20,305 INFO L175 Difference]: Start difference. First operand has 296 places, 263 transitions, 3385 flow. Second operand 10 states and 114 transitions. [2024-06-04 16:09:20,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 283 transitions, 4089 flow [2024-06-04 16:09:20,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 283 transitions, 3842 flow, removed 24 selfloop flow, removed 9 redundant places. [2024-06-04 16:09:20,656 INFO L231 Difference]: Finished difference. Result has 297 places, 265 transitions, 3366 flow [2024-06-04 16:09:20,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3138, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3366, PETRI_PLACES=297, PETRI_TRANSITIONS=265} [2024-06-04 16:09:20,656 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 265 predicate places. [2024-06-04 16:09:20,656 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 265 transitions, 3366 flow [2024-06-04 16:09:20,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:09:20,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:09:20,657 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 16:09:20,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-04 16:09:20,657 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 16:09:20,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:09:20,657 INFO L85 PathProgramCache]: Analyzing trace with hash 272687747, now seen corresponding path program 2 times [2024-06-04 16:09:20,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:09:20,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278811750] [2024-06-04 16:09:20,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:09:20,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:09:20,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:09:27,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:09:27,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:09:27,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278811750] [2024-06-04 16:09:27,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278811750] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:09:27,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:09:27,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:09:27,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119758920] [2024-06-04 16:09:27,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:09:27,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:09:27,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:09:27,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:09:27,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:09:27,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:09:27,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 265 transitions, 3366 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:09:27,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:09:27,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:09:27,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:09:28,297 INFO L124 PetriNetUnfolderBase]: 744/1314 cut-off events. [2024-06-04 16:09:28,297 INFO L125 PetriNetUnfolderBase]: For 91021/91021 co-relation queries the response was YES. [2024-06-04 16:09:28,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9737 conditions, 1314 events. 744/1314 cut-off events. For 91021/91021 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 6879 event pairs, 154 based on Foata normal form. 4/1318 useless extension candidates. Maximal degree in co-relation 9599. Up to 1158 conditions per place. [2024-06-04 16:09:28,311 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 239 selfloop transitions, 43 changer transitions 0/284 dead transitions. [2024-06-04 16:09:28,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 284 transitions, 4010 flow [2024-06-04 16:09:28,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:09:28,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:09:28,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 116 transitions. [2024-06-04 16:09:28,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31955922865013775 [2024-06-04 16:09:28,313 INFO L175 Difference]: Start difference. First operand has 297 places, 265 transitions, 3366 flow. Second operand 11 states and 116 transitions. [2024-06-04 16:09:28,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 284 transitions, 4010 flow [2024-06-04 16:09:28,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 284 transitions, 3812 flow, removed 25 selfloop flow, removed 8 redundant places. [2024-06-04 16:09:28,614 INFO L231 Difference]: Finished difference. Result has 300 places, 266 transitions, 3282 flow [2024-06-04 16:09:28,614 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3168, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3282, PETRI_PLACES=300, PETRI_TRANSITIONS=266} [2024-06-04 16:09:28,615 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 268 predicate places. [2024-06-04 16:09:28,615 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 266 transitions, 3282 flow [2024-06-04 16:09:28,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:09:28,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:09:28,615 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 16:09:28,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-04 16:09:28,615 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 16:09:28,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:09:28,615 INFO L85 PathProgramCache]: Analyzing trace with hash -755879267, now seen corresponding path program 14 times [2024-06-04 16:09:28,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:09:28,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066106324] [2024-06-04 16:09:28,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:09:28,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:09:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:09:33,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:09:33,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:09:33,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066106324] [2024-06-04 16:09:33,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066106324] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:09:33,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:09:33,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:09:33,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967866856] [2024-06-04 16:09:33,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:09:33,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:09:33,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:09:33,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:09:33,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:09:33,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:09:33,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 266 transitions, 3282 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:09:33,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:09:33,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:09:33,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:09:33,811 INFO L124 PetriNetUnfolderBase]: 754/1333 cut-off events. [2024-06-04 16:09:33,811 INFO L125 PetriNetUnfolderBase]: For 87334/87334 co-relation queries the response was YES. [2024-06-04 16:09:33,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9739 conditions, 1333 events. 754/1333 cut-off events. For 87334/87334 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 6952 event pairs, 117 based on Foata normal form. 2/1335 useless extension candidates. Maximal degree in co-relation 9600. Up to 1170 conditions per place. [2024-06-04 16:09:33,825 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 234 selfloop transitions, 46 changer transitions 0/282 dead transitions. [2024-06-04 16:09:33,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 282 transitions, 3933 flow [2024-06-04 16:09:33,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:09:33,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:09:33,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2024-06-04 16:09:33,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-04 16:09:33,826 INFO L175 Difference]: Start difference. First operand has 300 places, 266 transitions, 3282 flow. Second operand 9 states and 99 transitions. [2024-06-04 16:09:33,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 282 transitions, 3933 flow [2024-06-04 16:09:34,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 282 transitions, 3831 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-04 16:09:34,212 INFO L231 Difference]: Finished difference. Result has 301 places, 269 transitions, 3326 flow [2024-06-04 16:09:34,212 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3180, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3326, PETRI_PLACES=301, PETRI_TRANSITIONS=269} [2024-06-04 16:09:34,213 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 269 predicate places. [2024-06-04 16:09:34,213 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 269 transitions, 3326 flow [2024-06-04 16:09:34,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:09:34,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:09:34,213 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 16:09:34,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-04 16:09:34,213 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 16:09:34,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:09:34,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1182968225, now seen corresponding path program 15 times [2024-06-04 16:09:34,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:09:34,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619918527] [2024-06-04 16:09:34,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:09:34,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:09:34,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:09:38,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:09:38,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:09:38,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619918527] [2024-06-04 16:09:38,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619918527] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:09:38,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:09:38,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:09:38,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336858867] [2024-06-04 16:09:38,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:09:38,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:09:38,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:09:38,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:09:38,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:09:38,811 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:09:38,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 269 transitions, 3326 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:09:38,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:09:38,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:09:38,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:09:39,429 INFO L124 PetriNetUnfolderBase]: 758/1339 cut-off events. [2024-06-04 16:09:39,429 INFO L125 PetriNetUnfolderBase]: For 87736/87736 co-relation queries the response was YES. [2024-06-04 16:09:39,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9809 conditions, 1339 events. 758/1339 cut-off events. For 87736/87736 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 7017 event pairs, 120 based on Foata normal form. 2/1341 useless extension candidates. Maximal degree in co-relation 9668. Up to 1182 conditions per place. [2024-06-04 16:09:39,443 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 237 selfloop transitions, 44 changer transitions 0/283 dead transitions. [2024-06-04 16:09:39,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 283 transitions, 3970 flow [2024-06-04 16:09:39,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:09:39,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:09:39,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2024-06-04 16:09:39,444 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3367003367003367 [2024-06-04 16:09:39,444 INFO L175 Difference]: Start difference. First operand has 301 places, 269 transitions, 3326 flow. Second operand 9 states and 100 transitions. [2024-06-04 16:09:39,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 283 transitions, 3970 flow [2024-06-04 16:09:39,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 283 transitions, 3857 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-04 16:09:39,805 INFO L231 Difference]: Finished difference. Result has 304 places, 270 transitions, 3337 flow [2024-06-04 16:09:39,805 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3213, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3337, PETRI_PLACES=304, PETRI_TRANSITIONS=270} [2024-06-04 16:09:39,805 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 272 predicate places. [2024-06-04 16:09:39,806 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 270 transitions, 3337 flow [2024-06-04 16:09:39,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:09:39,806 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:09:39,806 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 16:09:39,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-04 16:09:39,806 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 16:09:39,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:09:39,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1228483691, now seen corresponding path program 12 times [2024-06-04 16:09:39,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:09:39,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369438758] [2024-06-04 16:09:39,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:09:39,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:09:39,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:09:48,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:09:48,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:09:48,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369438758] [2024-06-04 16:09:48,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369438758] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:09:48,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:09:48,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:09:48,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997888550] [2024-06-04 16:09:48,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:09:48,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:09:48,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:09:48,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:09:48,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:09:48,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:09:48,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 270 transitions, 3337 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:09:48,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:09:48,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:09:48,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:09:49,330 INFO L124 PetriNetUnfolderBase]: 774/1365 cut-off events. [2024-06-04 16:09:49,330 INFO L125 PetriNetUnfolderBase]: For 96315/96315 co-relation queries the response was YES. [2024-06-04 16:09:49,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10189 conditions, 1365 events. 774/1365 cut-off events. For 96315/96315 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 7175 event pairs, 76 based on Foata normal form. 2/1367 useless extension candidates. Maximal degree in co-relation 10047. Up to 1044 conditions per place. [2024-06-04 16:09:49,344 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 206 selfloop transitions, 87 changer transitions 0/295 dead transitions. [2024-06-04 16:09:49,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 295 transitions, 4287 flow [2024-06-04 16:09:49,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:09:49,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:09:49,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-04 16:09:49,345 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-04 16:09:49,345 INFO L175 Difference]: Start difference. First operand has 304 places, 270 transitions, 3337 flow. Second operand 10 states and 120 transitions. [2024-06-04 16:09:49,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 295 transitions, 4287 flow [2024-06-04 16:09:49,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 295 transitions, 4173 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-04 16:09:49,712 INFO L231 Difference]: Finished difference. Result has 307 places, 274 transitions, 3514 flow [2024-06-04 16:09:49,712 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3223, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3514, PETRI_PLACES=307, PETRI_TRANSITIONS=274} [2024-06-04 16:09:49,712 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 275 predicate places. [2024-06-04 16:09:49,712 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 274 transitions, 3514 flow [2024-06-04 16:09:49,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:09:49,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:09:49,713 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 16:09:49,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-04 16:09:49,713 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 16:09:49,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:09:49,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1188690236, now seen corresponding path program 2 times [2024-06-04 16:09:49,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:09:49,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139945654] [2024-06-04 16:09:49,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:09:49,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:09:49,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:09:56,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:09:56,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:09:56,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139945654] [2024-06-04 16:09:56,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139945654] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:09:56,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:09:56,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:09:56,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667162353] [2024-06-04 16:09:56,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:09:56,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:09:56,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:09:56,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:09:56,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:09:56,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:09:56,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 274 transitions, 3514 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:09:56,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:09:56,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:09:56,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:09:56,904 INFO L124 PetriNetUnfolderBase]: 772/1362 cut-off events. [2024-06-04 16:09:56,905 INFO L125 PetriNetUnfolderBase]: For 92330/92330 co-relation queries the response was YES. [2024-06-04 16:09:56,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10213 conditions, 1362 events. 772/1362 cut-off events. For 92330/92330 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 7185 event pairs, 174 based on Foata normal form. 1/1363 useless extension candidates. Maximal degree in co-relation 10070. Up to 1257 conditions per place. [2024-06-04 16:09:56,919 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 248 selfloop transitions, 35 changer transitions 0/285 dead transitions. [2024-06-04 16:09:56,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 285 transitions, 4116 flow [2024-06-04 16:09:56,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:09:56,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:09:56,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-04 16:09:56,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32996632996632996 [2024-06-04 16:09:56,920 INFO L175 Difference]: Start difference. First operand has 307 places, 274 transitions, 3514 flow. Second operand 9 states and 98 transitions. [2024-06-04 16:09:56,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 285 transitions, 4116 flow [2024-06-04 16:09:57,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 285 transitions, 3945 flow, removed 31 selfloop flow, removed 6 redundant places. [2024-06-04 16:09:57,264 INFO L231 Difference]: Finished difference. Result has 310 places, 274 transitions, 3423 flow [2024-06-04 16:09:57,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3343, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3423, PETRI_PLACES=310, PETRI_TRANSITIONS=274} [2024-06-04 16:09:57,265 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 278 predicate places. [2024-06-04 16:09:57,265 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 274 transitions, 3423 flow [2024-06-04 16:09:57,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:09:57,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:09:57,265 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 16:09:57,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-04 16:09:57,266 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 16:09:57,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:09:57,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1445113603, now seen corresponding path program 16 times [2024-06-04 16:09:57,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:09:57,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237786375] [2024-06-04 16:09:57,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:09:57,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:09:57,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:10:01,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:10:01,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:10:01,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237786375] [2024-06-04 16:10:01,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237786375] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:10:01,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:10:01,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:10:01,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126293087] [2024-06-04 16:10:01,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:10:01,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:10:01,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:10:01,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:10:01,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:10:01,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:10:01,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 274 transitions, 3423 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:10:01,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:10:01,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:10:01,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:10:02,166 INFO L124 PetriNetUnfolderBase]: 776/1370 cut-off events. [2024-06-04 16:10:02,167 INFO L125 PetriNetUnfolderBase]: For 97264/97264 co-relation queries the response was YES. [2024-06-04 16:10:02,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10242 conditions, 1370 events. 776/1370 cut-off events. For 97264/97264 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 7221 event pairs, 123 based on Foata normal form. 2/1372 useless extension candidates. Maximal degree in co-relation 10097. Up to 1213 conditions per place. [2024-06-04 16:10:02,181 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 243 selfloop transitions, 43 changer transitions 0/288 dead transitions. [2024-06-04 16:10:02,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 288 transitions, 4073 flow [2024-06-04 16:10:02,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:10:02,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:10:02,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2024-06-04 16:10:02,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-04 16:10:02,182 INFO L175 Difference]: Start difference. First operand has 310 places, 274 transitions, 3423 flow. Second operand 9 states and 99 transitions. [2024-06-04 16:10:02,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 288 transitions, 4073 flow [2024-06-04 16:10:02,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 288 transitions, 3933 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-04 16:10:02,596 INFO L231 Difference]: Finished difference. Result has 311 places, 275 transitions, 3407 flow [2024-06-04 16:10:02,596 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3283, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3407, PETRI_PLACES=311, PETRI_TRANSITIONS=275} [2024-06-04 16:10:02,596 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 279 predicate places. [2024-06-04 16:10:02,596 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 275 transitions, 3407 flow [2024-06-04 16:10:02,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:10:02,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:10:02,597 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 16:10:02,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-06-04 16:10:02,597 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 16:10:02,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:10:02,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1382629367, now seen corresponding path program 13 times [2024-06-04 16:10:02,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:10:02,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395212396] [2024-06-04 16:10:02,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:10:02,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:10:02,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:10:08,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 16:10:08,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:10:08,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395212396] [2024-06-04 16:10:08,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395212396] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:10:08,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:10:08,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:10:08,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424055271] [2024-06-04 16:10:08,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:10:08,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:10:08,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:10:08,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:10:08,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:10:08,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:10:08,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 275 transitions, 3407 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:10:08,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:10:08,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:10:08,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:10:09,523 INFO L124 PetriNetUnfolderBase]: 804/1416 cut-off events. [2024-06-04 16:10:09,523 INFO L125 PetriNetUnfolderBase]: For 104538/104538 co-relation queries the response was YES. [2024-06-04 16:10:09,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10719 conditions, 1416 events. 804/1416 cut-off events. For 104538/104538 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 7517 event pairs, 119 based on Foata normal form. 2/1418 useless extension candidates. Maximal degree in co-relation 10573. Up to 1210 conditions per place. [2024-06-04 16:10:09,537 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 245 selfloop transitions, 55 changer transitions 0/302 dead transitions. [2024-06-04 16:10:09,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 302 transitions, 4389 flow [2024-06-04 16:10:09,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:10:09,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:10:09,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2024-06-04 16:10:09,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3515151515151515 [2024-06-04 16:10:09,538 INFO L175 Difference]: Start difference. First operand has 311 places, 275 transitions, 3407 flow. Second operand 10 states and 116 transitions. [2024-06-04 16:10:09,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 302 transitions, 4389 flow [2024-06-04 16:10:09,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 302 transitions, 4275 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-04 16:10:09,976 INFO L231 Difference]: Finished difference. Result has 315 places, 283 transitions, 3563 flow [2024-06-04 16:10:09,976 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3293, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3563, PETRI_PLACES=315, PETRI_TRANSITIONS=283} [2024-06-04 16:10:09,977 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 283 predicate places. [2024-06-04 16:10:09,977 INFO L495 AbstractCegarLoop]: Abstraction has has 315 places, 283 transitions, 3563 flow [2024-06-04 16:10:09,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:10:09,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:10:09,977 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 16:10:09,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-06-04 16:10:09,977 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 16:10:09,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:10:09,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1228491131, now seen corresponding path program 14 times [2024-06-04 16:10:09,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:10:09,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456798958] [2024-06-04 16:10:09,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:10:09,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:10:10,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:10:16,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:10:16,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:10:16,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456798958] [2024-06-04 16:10:16,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456798958] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:10:16,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:10:16,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:10:16,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555855968] [2024-06-04 16:10:16,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:10:16,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:10:16,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:10:16,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:10:16,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:10:16,217 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:10:16,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 283 transitions, 3563 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:10:16,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:10:16,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:10:16,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:10:16,901 INFO L124 PetriNetUnfolderBase]: 810/1426 cut-off events. [2024-06-04 16:10:16,901 INFO L125 PetriNetUnfolderBase]: For 107186/107186 co-relation queries the response was YES. [2024-06-04 16:10:16,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10884 conditions, 1426 events. 810/1426 cut-off events. For 107186/107186 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 7569 event pairs, 80 based on Foata normal form. 2/1428 useless extension candidates. Maximal degree in co-relation 10736. Up to 1101 conditions per place. [2024-06-04 16:10:16,918 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 215 selfloop transitions, 88 changer transitions 0/305 dead transitions. [2024-06-04 16:10:16,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 305 transitions, 4475 flow [2024-06-04 16:10:16,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:10:16,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:10:16,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-04 16:10:16,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-04 16:10:16,919 INFO L175 Difference]: Start difference. First operand has 315 places, 283 transitions, 3563 flow. Second operand 10 states and 120 transitions. [2024-06-04 16:10:16,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 305 transitions, 4475 flow [2024-06-04 16:10:17,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 305 transitions, 4353 flow, removed 33 selfloop flow, removed 5 redundant places. [2024-06-04 16:10:17,416 INFO L231 Difference]: Finished difference. Result has 320 places, 285 transitions, 3672 flow [2024-06-04 16:10:17,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3441, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3672, PETRI_PLACES=320, PETRI_TRANSITIONS=285} [2024-06-04 16:10:17,416 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 288 predicate places. [2024-06-04 16:10:17,416 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 285 transitions, 3672 flow [2024-06-04 16:10:17,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:10:17,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:10:17,417 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 16:10:17,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-06-04 16:10:17,417 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 16:10:17,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:10:17,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1382621927, now seen corresponding path program 15 times [2024-06-04 16:10:17,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:10:17,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69234835] [2024-06-04 16:10:17,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:10:17,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:10:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:10:23,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:10:23,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:10:23,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69234835] [2024-06-04 16:10:23,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69234835] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:10:23,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:10:23,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:10:23,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723982027] [2024-06-04 16:10:23,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:10:23,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:10:23,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:10:23,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:10:23,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:10:23,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:10:23,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 285 transitions, 3672 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:10:23,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:10:23,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:10:23,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:10:24,690 INFO L124 PetriNetUnfolderBase]: 816/1436 cut-off events. [2024-06-04 16:10:24,690 INFO L125 PetriNetUnfolderBase]: For 109672/109672 co-relation queries the response was YES. [2024-06-04 16:10:24,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11122 conditions, 1436 events. 816/1436 cut-off events. For 109672/109672 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 7632 event pairs, 121 based on Foata normal form. 2/1438 useless extension candidates. Maximal degree in co-relation 10972. Up to 1226 conditions per place. [2024-06-04 16:10:24,707 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 247 selfloop transitions, 56 changer transitions 0/305 dead transitions. [2024-06-04 16:10:24,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 305 transitions, 4572 flow [2024-06-04 16:10:24,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:10:24,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:10:24,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2024-06-04 16:10:24,708 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3515151515151515 [2024-06-04 16:10:24,708 INFO L175 Difference]: Start difference. First operand has 320 places, 285 transitions, 3672 flow. Second operand 10 states and 116 transitions. [2024-06-04 16:10:24,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 305 transitions, 4572 flow [2024-06-04 16:10:25,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 305 transitions, 4365 flow, removed 21 selfloop flow, removed 7 redundant places. [2024-06-04 16:10:25,213 INFO L231 Difference]: Finished difference. Result has 323 places, 287 transitions, 3632 flow [2024-06-04 16:10:25,213 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3465, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3632, PETRI_PLACES=323, PETRI_TRANSITIONS=287} [2024-06-04 16:10:25,213 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 291 predicate places. [2024-06-04 16:10:25,213 INFO L495 AbstractCegarLoop]: Abstraction has has 323 places, 287 transitions, 3632 flow [2024-06-04 16:10:25,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:10:25,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:10:25,213 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 16:10:25,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-06-04 16:10:25,214 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 16:10:25,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:10:25,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1228698893, now seen corresponding path program 17 times [2024-06-04 16:10:25,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:10:25,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416717400] [2024-06-04 16:10:25,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:10:25,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:10:25,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:10:29,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 16:10:29,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:10:29,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416717400] [2024-06-04 16:10:29,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416717400] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:10:29,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:10:29,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:10:29,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855093085] [2024-06-04 16:10:29,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:10:29,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:10:29,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:10:29,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:10:29,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:10:29,704 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:10:29,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 287 transitions, 3632 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:10:29,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:10:29,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:10:29,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:10:30,323 INFO L124 PetriNetUnfolderBase]: 820/1444 cut-off events. [2024-06-04 16:10:30,323 INFO L125 PetriNetUnfolderBase]: For 112352/112352 co-relation queries the response was YES. [2024-06-04 16:10:30,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11101 conditions, 1444 events. 820/1444 cut-off events. For 112352/112352 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 7677 event pairs, 81 based on Foata normal form. 2/1446 useless extension candidates. Maximal degree in co-relation 10950. Up to 1168 conditions per place. [2024-06-04 16:10:30,338 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 223 selfloop transitions, 78 changer transitions 0/303 dead transitions. [2024-06-04 16:10:30,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 303 transitions, 4332 flow [2024-06-04 16:10:30,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:10:30,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:10:30,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions. [2024-06-04 16:10:30,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3468013468013468 [2024-06-04 16:10:30,340 INFO L175 Difference]: Start difference. First operand has 323 places, 287 transitions, 3632 flow. Second operand 9 states and 103 transitions. [2024-06-04 16:10:30,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 303 transitions, 4332 flow [2024-06-04 16:10:30,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 303 transitions, 4195 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-06-04 16:10:30,822 INFO L231 Difference]: Finished difference. Result has 326 places, 288 transitions, 3691 flow [2024-06-04 16:10:30,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3495, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3691, PETRI_PLACES=326, PETRI_TRANSITIONS=288} [2024-06-04 16:10:30,822 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 294 predicate places. [2024-06-04 16:10:30,823 INFO L495 AbstractCegarLoop]: Abstraction has has 326 places, 288 transitions, 3691 flow [2024-06-04 16:10:30,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:10:30,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:10:30,823 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 16:10:30,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-06-04 16:10:30,823 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 16:10:30,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:10:30,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1183118327, now seen corresponding path program 16 times [2024-06-04 16:10:30,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:10:30,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870327575] [2024-06-04 16:10:30,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:10:30,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:10:30,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:10:36,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:10:36,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:10:36,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870327575] [2024-06-04 16:10:36,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870327575] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:10:36,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:10:36,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:10:36,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175215083] [2024-06-04 16:10:36,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:10:36,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:10:36,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:10:36,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:10:36,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:10:37,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:10:37,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 288 transitions, 3691 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:10:37,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:10:37,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:10:37,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:10:37,848 INFO L124 PetriNetUnfolderBase]: 826/1454 cut-off events. [2024-06-04 16:10:37,848 INFO L125 PetriNetUnfolderBase]: For 115349/115349 co-relation queries the response was YES. [2024-06-04 16:10:37,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11265 conditions, 1454 events. 826/1454 cut-off events. For 115349/115349 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 7772 event pairs, 136 based on Foata normal form. 2/1456 useless extension candidates. Maximal degree in co-relation 11113. Up to 1287 conditions per place. [2024-06-04 16:10:37,861 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 256 selfloop transitions, 47 changer transitions 0/305 dead transitions. [2024-06-04 16:10:37,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 305 transitions, 4427 flow [2024-06-04 16:10:37,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:10:37,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:10:37,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2024-06-04 16:10:37,862 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-04 16:10:37,862 INFO L175 Difference]: Start difference. First operand has 326 places, 288 transitions, 3691 flow. Second operand 10 states and 110 transitions. [2024-06-04 16:10:37,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 305 transitions, 4427 flow [2024-06-04 16:10:38,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 305 transitions, 4241 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-04 16:10:38,393 INFO L231 Difference]: Finished difference. Result has 329 places, 290 transitions, 3670 flow [2024-06-04 16:10:38,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3505, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3670, PETRI_PLACES=329, PETRI_TRANSITIONS=290} [2024-06-04 16:10:38,393 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 297 predicate places. [2024-06-04 16:10:38,394 INFO L495 AbstractCegarLoop]: Abstraction has has 329 places, 290 transitions, 3670 flow [2024-06-04 16:10:38,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:10:38,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:10:38,394 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 16:10:38,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-06-04 16:10:38,394 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 16:10:38,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:10:38,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1382420117, now seen corresponding path program 17 times [2024-06-04 16:10:38,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:10:38,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942874305] [2024-06-04 16:10:38,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:10:38,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:10:38,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:10:44,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:10:44,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:10:44,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942874305] [2024-06-04 16:10:44,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942874305] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:10:44,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:10:44,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:10:44,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281345769] [2024-06-04 16:10:44,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:10:44,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:10:44,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:10:44,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:10:44,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:10:44,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:10:44,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 290 transitions, 3670 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:10:44,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:10:44,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:10:44,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:10:45,165 INFO L124 PetriNetUnfolderBase]: 822/1448 cut-off events. [2024-06-04 16:10:45,166 INFO L125 PetriNetUnfolderBase]: For 110425/110425 co-relation queries the response was YES. [2024-06-04 16:10:45,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10960 conditions, 1448 events. 822/1448 cut-off events. For 110425/110425 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 7744 event pairs, 129 based on Foata normal form. 2/1450 useless extension candidates. Maximal degree in co-relation 10807. Up to 1277 conditions per place. [2024-06-04 16:10:45,182 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 254 selfloop transitions, 49 changer transitions 0/305 dead transitions. [2024-06-04 16:10:45,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 305 transitions, 4342 flow [2024-06-04 16:10:45,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:10:45,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:10:45,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2024-06-04 16:10:45,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3303030303030303 [2024-06-04 16:10:45,183 INFO L175 Difference]: Start difference. First operand has 329 places, 290 transitions, 3670 flow. Second operand 10 states and 109 transitions. [2024-06-04 16:10:45,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 305 transitions, 4342 flow [2024-06-04 16:10:45,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 305 transitions, 4153 flow, removed 49 selfloop flow, removed 8 redundant places. [2024-06-04 16:10:45,730 INFO L231 Difference]: Finished difference. Result has 331 places, 290 transitions, 3584 flow [2024-06-04 16:10:45,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3481, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3584, PETRI_PLACES=331, PETRI_TRANSITIONS=290} [2024-06-04 16:10:45,730 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 299 predicate places. [2024-06-04 16:10:45,730 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 290 transitions, 3584 flow [2024-06-04 16:10:45,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:10:45,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:10:45,730 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 16:10:45,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-06-04 16:10:45,731 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 16:10:45,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:10:45,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1188474755, now seen corresponding path program 18 times [2024-06-04 16:10:45,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:10:45,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358282400] [2024-06-04 16:10:45,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:10:45,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:10:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:10:49,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 16:10:49,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:10:49,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358282400] [2024-06-04 16:10:49,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358282400] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:10:49,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:10:49,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:10:49,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311578474] [2024-06-04 16:10:49,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:10:49,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:10:49,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:10:49,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:10:49,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:10:49,772 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:10:49,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 290 transitions, 3584 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:10:49,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:10:49,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:10:49,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:10:50,351 INFO L124 PetriNetUnfolderBase]: 819/1443 cut-off events. [2024-06-04 16:10:50,351 INFO L125 PetriNetUnfolderBase]: For 104976/104976 co-relation queries the response was YES. [2024-06-04 16:10:50,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10653 conditions, 1443 events. 819/1443 cut-off events. For 104976/104976 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 7701 event pairs, 128 based on Foata normal form. 2/1445 useless extension candidates. Maximal degree in co-relation 10499. Up to 1259 conditions per place. [2024-06-04 16:10:50,367 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 251 selfloop transitions, 52 changer transitions 0/305 dead transitions. [2024-06-04 16:10:50,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 305 transitions, 4256 flow [2024-06-04 16:10:50,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:10:50,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:10:50,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2024-06-04 16:10:50,369 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3501683501683502 [2024-06-04 16:10:50,369 INFO L175 Difference]: Start difference. First operand has 331 places, 290 transitions, 3584 flow. Second operand 9 states and 104 transitions. [2024-06-04 16:10:50,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 305 transitions, 4256 flow [2024-06-04 16:10:50,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 305 transitions, 4145 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-04 16:10:50,884 INFO L231 Difference]: Finished difference. Result has 331 places, 290 transitions, 3583 flow [2024-06-04 16:10:50,885 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3473, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3583, PETRI_PLACES=331, PETRI_TRANSITIONS=290} [2024-06-04 16:10:50,885 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 299 predicate places. [2024-06-04 16:10:50,885 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 290 transitions, 3583 flow [2024-06-04 16:10:50,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:10:50,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:10:50,885 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 16:10:50,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-06-04 16:10:50,885 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 16:10:50,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:10:50,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1390048597, now seen corresponding path program 3 times [2024-06-04 16:10:50,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:10:50,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743523421] [2024-06-04 16:10:50,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:10:50,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:10:50,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:10:57,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:10:57,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:10:57,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743523421] [2024-06-04 16:10:57,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743523421] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:10:57,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:10:57,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:10:57,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814983369] [2024-06-04 16:10:57,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:10:57,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:10:57,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:10:57,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:10:57,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:10:57,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:10:57,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 290 transitions, 3583 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:10:57,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:10:57,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:10:57,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:10:58,080 INFO L124 PetriNetUnfolderBase]: 827/1459 cut-off events. [2024-06-04 16:10:58,080 INFO L125 PetriNetUnfolderBase]: For 114723/114723 co-relation queries the response was YES. [2024-06-04 16:10:58,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10758 conditions, 1459 events. 827/1459 cut-off events. For 114723/114723 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 7850 event pairs, 183 based on Foata normal form. 4/1463 useless extension candidates. Maximal degree in co-relation 10603. Up to 1350 conditions per place. [2024-06-04 16:10:58,097 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 272 selfloop transitions, 34 changer transitions 0/308 dead transitions. [2024-06-04 16:10:58,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 308 transitions, 4278 flow [2024-06-04 16:10:58,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 16:10:58,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 16:10:58,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 122 transitions. [2024-06-04 16:10:58,097 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30808080808080807 [2024-06-04 16:10:58,097 INFO L175 Difference]: Start difference. First operand has 331 places, 290 transitions, 3583 flow. Second operand 12 states and 122 transitions. [2024-06-04 16:10:58,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 308 transitions, 4278 flow [2024-06-04 16:10:58,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 308 transitions, 4080 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-04 16:10:58,576 INFO L231 Difference]: Finished difference. Result has 335 places, 291 transitions, 3479 flow [2024-06-04 16:10:58,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3385, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3479, PETRI_PLACES=335, PETRI_TRANSITIONS=291} [2024-06-04 16:10:58,576 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 303 predicate places. [2024-06-04 16:10:58,576 INFO L495 AbstractCegarLoop]: Abstraction has has 335 places, 291 transitions, 3479 flow [2024-06-04 16:10:58,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:10:58,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:10:58,577 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 16:10:58,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-06-04 16:10:58,577 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 16:10:58,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:10:58,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1188480707, now seen corresponding path program 18 times [2024-06-04 16:10:58,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:10:58,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959730701] [2024-06-04 16:10:58,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:10:58,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:10:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:11:03,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:11:03,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:11:03,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959730701] [2024-06-04 16:11:03,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959730701] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:11:03,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:11:03,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:11:03,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160102015] [2024-06-04 16:11:03,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:11:03,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:11:03,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:11:03,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:11:03,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:11:04,112 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:11:04,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 291 transitions, 3479 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:11:04,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:11:04,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:11:04,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:11:04,799 INFO L124 PetriNetUnfolderBase]: 833/1469 cut-off events. [2024-06-04 16:11:04,799 INFO L125 PetriNetUnfolderBase]: For 107301/107301 co-relation queries the response was YES. [2024-06-04 16:11:04,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10687 conditions, 1469 events. 833/1469 cut-off events. For 107301/107301 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 7886 event pairs, 128 based on Foata normal form. 2/1471 useless extension candidates. Maximal degree in co-relation 10531. Up to 1265 conditions per place. [2024-06-04 16:11:04,814 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 250 selfloop transitions, 58 changer transitions 0/310 dead transitions. [2024-06-04 16:11:04,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 310 transitions, 4243 flow [2024-06-04 16:11:04,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:11:04,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:11:04,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2024-06-04 16:11:04,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34545454545454546 [2024-06-04 16:11:04,815 INFO L175 Difference]: Start difference. First operand has 335 places, 291 transitions, 3479 flow. Second operand 10 states and 114 transitions. [2024-06-04 16:11:04,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 310 transitions, 4243 flow [2024-06-04 16:11:05,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 310 transitions, 4076 flow, removed 15 selfloop flow, removed 12 redundant places. [2024-06-04 16:11:05,310 INFO L231 Difference]: Finished difference. Result has 333 places, 293 transitions, 3506 flow [2024-06-04 16:11:05,310 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3314, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3506, PETRI_PLACES=333, PETRI_TRANSITIONS=293} [2024-06-04 16:11:05,311 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 301 predicate places. [2024-06-04 16:11:05,311 INFO L495 AbstractCegarLoop]: Abstraction has has 333 places, 293 transitions, 3506 flow [2024-06-04 16:11:05,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:11:05,311 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:11:05,311 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 16:11:05,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-06-04 16:11:05,311 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 16:11:05,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:11:05,311 INFO L85 PathProgramCache]: Analyzing trace with hash -966543843, now seen corresponding path program 19 times [2024-06-04 16:11:05,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:11:05,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849606233] [2024-06-04 16:11:05,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:11:05,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:11:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:11:11,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:11:11,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:11:11,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849606233] [2024-06-04 16:11:11,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849606233] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:11:11,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:11:11,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:11:11,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304911747] [2024-06-04 16:11:11,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:11:11,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:11:11,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:11:11,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:11:11,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:11:11,670 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:11:11,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 293 transitions, 3506 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:11:11,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:11:11,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:11:11,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:11:12,264 INFO L124 PetriNetUnfolderBase]: 829/1465 cut-off events. [2024-06-04 16:11:12,264 INFO L125 PetriNetUnfolderBase]: For 102067/102067 co-relation queries the response was YES. [2024-06-04 16:11:12,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10341 conditions, 1465 events. 829/1465 cut-off events. For 102067/102067 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 7870 event pairs, 81 based on Foata normal form. 2/1467 useless extension candidates. Maximal degree in co-relation 10187. Up to 1177 conditions per place. [2024-06-04 16:11:12,279 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 227 selfloop transitions, 81 changer transitions 0/310 dead transitions. [2024-06-04 16:11:12,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 310 transitions, 4202 flow [2024-06-04 16:11:12,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:11:12,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:11:12,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2024-06-04 16:11:12,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3424242424242424 [2024-06-04 16:11:12,280 INFO L175 Difference]: Start difference. First operand has 333 places, 293 transitions, 3506 flow. Second operand 10 states and 113 transitions. [2024-06-04 16:11:12,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 310 transitions, 4202 flow [2024-06-04 16:11:12,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 310 transitions, 3991 flow, removed 49 selfloop flow, removed 9 redundant places. [2024-06-04 16:11:12,734 INFO L231 Difference]: Finished difference. Result has 334 places, 293 transitions, 3462 flow [2024-06-04 16:11:12,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3295, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3462, PETRI_PLACES=334, PETRI_TRANSITIONS=293} [2024-06-04 16:11:12,735 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 302 predicate places. [2024-06-04 16:11:12,735 INFO L495 AbstractCegarLoop]: Abstraction has has 334 places, 293 transitions, 3462 flow [2024-06-04 16:11:12,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:11:12,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:11:12,735 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:11:12,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2024-06-04 16:11:12,735 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 16:11:12,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:11:12,735 INFO L85 PathProgramCache]: Analyzing trace with hash -958915363, now seen corresponding path program 4 times [2024-06-04 16:11:12,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:11:12,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184540197] [2024-06-04 16:11:12,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:11:12,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:11:12,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:11:20,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:11:20,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:11:20,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184540197] [2024-06-04 16:11:20,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184540197] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:11:20,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:11:20,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:11:20,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512684304] [2024-06-04 16:11:20,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:11:20,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:11:20,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:11:20,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:11:20,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:11:20,741 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:11:20,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 293 transitions, 3462 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:11:20,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:11:20,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:11:20,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:11:21,494 INFO L124 PetriNetUnfolderBase]: 837/1481 cut-off events. [2024-06-04 16:11:21,494 INFO L125 PetriNetUnfolderBase]: For 108755/108755 co-relation queries the response was YES. [2024-06-04 16:11:21,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10353 conditions, 1481 events. 837/1481 cut-off events. For 108755/108755 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 8028 event pairs, 156 based on Foata normal form. 4/1485 useless extension candidates. Maximal degree in co-relation 10199. Up to 1340 conditions per place. [2024-06-04 16:11:21,511 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 266 selfloop transitions, 43 changer transitions 0/311 dead transitions. [2024-06-04 16:11:21,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 311 transitions, 4160 flow [2024-06-04 16:11:21,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:11:21,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:11:21,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 116 transitions. [2024-06-04 16:11:21,512 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31955922865013775 [2024-06-04 16:11:21,512 INFO L175 Difference]: Start difference. First operand has 334 places, 293 transitions, 3462 flow. Second operand 11 states and 116 transitions. [2024-06-04 16:11:21,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 311 transitions, 4160 flow [2024-06-04 16:11:21,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 311 transitions, 3982 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-06-04 16:11:21,975 INFO L231 Difference]: Finished difference. Result has 335 places, 294 transitions, 3396 flow [2024-06-04 16:11:21,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3284, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3396, PETRI_PLACES=335, PETRI_TRANSITIONS=294} [2024-06-04 16:11:21,975 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 303 predicate places. [2024-06-04 16:11:21,975 INFO L495 AbstractCegarLoop]: Abstraction has has 335 places, 294 transitions, 3396 flow [2024-06-04 16:11:21,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:11:21,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:11:21,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 16:11:21,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2024-06-04 16:11:21,976 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 16:11:21,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:11:21,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1450839055, now seen corresponding path program 20 times [2024-06-04 16:11:21,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:11:21,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191520125] [2024-06-04 16:11:21,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:11:21,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:11:22,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:11:28,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:11:28,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:11:28,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191520125] [2024-06-04 16:11:28,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191520125] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:11:28,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:11:28,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:11:28,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182151410] [2024-06-04 16:11:28,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:11:28,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:11:28,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:11:28,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:11:28,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:11:28,216 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:11:28,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 294 transitions, 3396 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:11:28,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:11:28,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:11:28,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:11:29,031 INFO L124 PetriNetUnfolderBase]: 853/1507 cut-off events. [2024-06-04 16:11:29,031 INFO L125 PetriNetUnfolderBase]: For 112530/112530 co-relation queries the response was YES. [2024-06-04 16:11:29,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10728 conditions, 1507 events. 853/1507 cut-off events. For 112530/112530 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 8148 event pairs, 125 based on Foata normal form. 2/1509 useless extension candidates. Maximal degree in co-relation 10573. Up to 1220 conditions per place. [2024-06-04 16:11:29,049 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 238 selfloop transitions, 78 changer transitions 0/318 dead transitions. [2024-06-04 16:11:29,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 318 transitions, 4436 flow [2024-06-04 16:11:29,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:11:29,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:11:29,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2024-06-04 16:11:29,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3606060606060606 [2024-06-04 16:11:29,050 INFO L175 Difference]: Start difference. First operand has 335 places, 294 transitions, 3396 flow. Second operand 10 states and 119 transitions. [2024-06-04 16:11:29,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 318 transitions, 4436 flow [2024-06-04 16:11:29,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 318 transitions, 4334 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-04 16:11:29,601 INFO L231 Difference]: Finished difference. Result has 336 places, 298 transitions, 3598 flow [2024-06-04 16:11:29,602 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3294, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3598, PETRI_PLACES=336, PETRI_TRANSITIONS=298} [2024-06-04 16:11:29,602 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 304 predicate places. [2024-06-04 16:11:29,602 INFO L495 AbstractCegarLoop]: Abstraction has has 336 places, 298 transitions, 3598 flow [2024-06-04 16:11:29,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:11:29,602 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:11:29,602 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:11:29,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2024-06-04 16:11:29,603 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 16:11:29,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:11:29,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1450831615, now seen corresponding path program 21 times [2024-06-04 16:11:29,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:11:29,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796069711] [2024-06-04 16:11:29,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:11:29,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:11:29,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:11:35,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:11:35,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:11:35,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796069711] [2024-06-04 16:11:35,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796069711] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:11:35,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:11:35,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:11:35,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128912754] [2024-06-04 16:11:35,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:11:35,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:11:35,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:11:35,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:11:35,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:11:36,033 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:11:36,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 298 transitions, 3598 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:11:36,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:11:36,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:11:36,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:11:36,856 INFO L124 PetriNetUnfolderBase]: 849/1501 cut-off events. [2024-06-04 16:11:36,857 INFO L125 PetriNetUnfolderBase]: For 107461/107461 co-relation queries the response was YES. [2024-06-04 16:11:36,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10629 conditions, 1501 events. 849/1501 cut-off events. For 107461/107461 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 8129 event pairs, 125 based on Foata normal form. 2/1503 useless extension candidates. Maximal degree in co-relation 10473. Up to 1217 conditions per place. [2024-06-04 16:11:36,870 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 239 selfloop transitions, 75 changer transitions 0/316 dead transitions. [2024-06-04 16:11:36,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 316 transitions, 4314 flow [2024-06-04 16:11:36,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:11:36,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:11:36,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-04 16:11:36,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3575757575757576 [2024-06-04 16:11:36,871 INFO L175 Difference]: Start difference. First operand has 336 places, 298 transitions, 3598 flow. Second operand 10 states and 118 transitions. [2024-06-04 16:11:36,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 316 transitions, 4314 flow [2024-06-04 16:11:37,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 316 transitions, 4117 flow, removed 58 selfloop flow, removed 7 redundant places. [2024-06-04 16:11:37,376 INFO L231 Difference]: Finished difference. Result has 339 places, 298 transitions, 3559 flow [2024-06-04 16:11:37,376 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3401, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3559, PETRI_PLACES=339, PETRI_TRANSITIONS=298} [2024-06-04 16:11:37,376 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 307 predicate places. [2024-06-04 16:11:37,376 INFO L495 AbstractCegarLoop]: Abstraction has has 339 places, 298 transitions, 3559 flow [2024-06-04 16:11:37,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:11:37,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:11:37,377 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 16:11:37,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2024-06-04 16:11:37,377 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 16:11:37,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:11:37,377 INFO L85 PathProgramCache]: Analyzing trace with hash -709834083, now seen corresponding path program 22 times [2024-06-04 16:11:37,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:11:37,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369835578] [2024-06-04 16:11:37,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:11:37,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:11:37,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:11:42,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:11:42,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:11:42,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369835578] [2024-06-04 16:11:42,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369835578] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:11:42,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:11:42,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:11:42,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688457367] [2024-06-04 16:11:42,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:11:42,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:11:42,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:11:42,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:11:42,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:11:42,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:11:42,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 298 transitions, 3559 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:11:42,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:11:42,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:11:42,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:11:43,627 INFO L124 PetriNetUnfolderBase]: 875/1543 cut-off events. [2024-06-04 16:11:43,627 INFO L125 PetriNetUnfolderBase]: For 123449/123449 co-relation queries the response was YES. [2024-06-04 16:11:43,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11367 conditions, 1543 events. 875/1543 cut-off events. For 123449/123449 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 8377 event pairs, 76 based on Foata normal form. 2/1545 useless extension candidates. Maximal degree in co-relation 11210. Up to 625 conditions per place. [2024-06-04 16:11:43,645 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 183 selfloop transitions, 145 changer transitions 0/330 dead transitions. [2024-06-04 16:11:43,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 330 transitions, 5113 flow [2024-06-04 16:11:43,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:11:43,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:11:43,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-04 16:11:43,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38484848484848483 [2024-06-04 16:11:43,646 INFO L175 Difference]: Start difference. First operand has 339 places, 298 transitions, 3559 flow. Second operand 10 states and 127 transitions. [2024-06-04 16:11:43,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 330 transitions, 5113 flow [2024-06-04 16:11:44,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 330 transitions, 4927 flow, removed 9 selfloop flow, removed 10 redundant places. [2024-06-04 16:11:44,164 INFO L231 Difference]: Finished difference. Result has 339 places, 307 transitions, 3938 flow [2024-06-04 16:11:44,164 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3379, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3938, PETRI_PLACES=339, PETRI_TRANSITIONS=307} [2024-06-04 16:11:44,164 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 307 predicate places. [2024-06-04 16:11:44,164 INFO L495 AbstractCegarLoop]: Abstraction has has 339 places, 307 transitions, 3938 flow [2024-06-04 16:11:44,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:11:44,164 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:11:44,165 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 16:11:44,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2024-06-04 16:11:44,165 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 16:11:44,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:11:44,165 INFO L85 PathProgramCache]: Analyzing trace with hash -711030815, now seen corresponding path program 23 times [2024-06-04 16:11:44,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:11:44,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206274151] [2024-06-04 16:11:44,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:11:44,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:11:44,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:11:49,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:11:49,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:11:49,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206274151] [2024-06-04 16:11:49,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206274151] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:11:49,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:11:49,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:11:49,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164739371] [2024-06-04 16:11:49,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:11:49,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:11:49,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:11:49,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:11:49,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:11:49,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:11:49,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 307 transitions, 3938 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:11:49,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:11:49,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:11:49,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:11:50,509 INFO L124 PetriNetUnfolderBase]: 871/1537 cut-off events. [2024-06-04 16:11:50,509 INFO L125 PetriNetUnfolderBase]: For 116126/116126 co-relation queries the response was YES. [2024-06-04 16:11:50,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11299 conditions, 1537 events. 871/1537 cut-off events. For 116126/116126 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 8349 event pairs, 78 based on Foata normal form. 2/1539 useless extension candidates. Maximal degree in co-relation 11142. Up to 624 conditions per place. [2024-06-04 16:11:50,528 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 181 selfloop transitions, 144 changer transitions 0/327 dead transitions. [2024-06-04 16:11:50,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 327 transitions, 5034 flow [2024-06-04 16:11:50,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:11:50,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:11:50,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-04 16:11:50,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37575757575757573 [2024-06-04 16:11:50,529 INFO L175 Difference]: Start difference. First operand has 339 places, 307 transitions, 3938 flow. Second operand 10 states and 124 transitions. [2024-06-04 16:11:50,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 327 transitions, 5034 flow [2024-06-04 16:11:51,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 327 transitions, 4780 flow, removed 77 selfloop flow, removed 4 redundant places. [2024-06-04 16:11:51,046 INFO L231 Difference]: Finished difference. Result has 345 places, 307 transitions, 3977 flow [2024-06-04 16:11:51,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3684, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=144, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3977, PETRI_PLACES=345, PETRI_TRANSITIONS=307} [2024-06-04 16:11:51,047 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 313 predicate places. [2024-06-04 16:11:51,047 INFO L495 AbstractCegarLoop]: Abstraction has has 345 places, 307 transitions, 3977 flow [2024-06-04 16:11:51,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:11:51,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:11:51,047 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:11:51,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2024-06-04 16:11:51,047 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 16:11:51,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:11:51,048 INFO L85 PathProgramCache]: Analyzing trace with hash -386012865, now seen corresponding path program 5 times [2024-06-04 16:11:51,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:11:51,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711352544] [2024-06-04 16:11:51,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:11:51,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:11:51,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:11:55,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:11:55,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:11:55,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711352544] [2024-06-04 16:11:55,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711352544] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:11:55,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:11:55,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:11:55,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930342986] [2024-06-04 16:11:55,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:11:55,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:11:55,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:11:55,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:11:55,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:11:55,802 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:11:55,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 307 transitions, 3977 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:11:55,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:11:55,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:11:55,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:11:56,352 INFO L124 PetriNetUnfolderBase]: 879/1551 cut-off events. [2024-06-04 16:11:56,352 INFO L125 PetriNetUnfolderBase]: For 125192/125192 co-relation queries the response was YES. [2024-06-04 16:11:56,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11459 conditions, 1551 events. 879/1551 cut-off events. For 125192/125192 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 8464 event pairs, 290 based on Foata normal form. 4/1555 useless extension candidates. Maximal degree in co-relation 11300. Up to 1487 conditions per place. [2024-06-04 16:11:56,368 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 299 selfloop transitions, 21 changer transitions 0/322 dead transitions. [2024-06-04 16:11:56,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 322 transitions, 4681 flow [2024-06-04 16:11:56,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:11:56,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:11:56,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 110 transitions. [2024-06-04 16:11:56,369 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30303030303030304 [2024-06-04 16:11:56,369 INFO L175 Difference]: Start difference. First operand has 345 places, 307 transitions, 3977 flow. Second operand 11 states and 110 transitions. [2024-06-04 16:11:56,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 322 transitions, 4681 flow [2024-06-04 16:11:56,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 322 transitions, 4382 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-04 16:11:56,846 INFO L231 Difference]: Finished difference. Result has 347 places, 308 transitions, 3748 flow [2024-06-04 16:11:56,846 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3678, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3748, PETRI_PLACES=347, PETRI_TRANSITIONS=308} [2024-06-04 16:11:56,847 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 315 predicate places. [2024-06-04 16:11:56,847 INFO L495 AbstractCegarLoop]: Abstraction has has 347 places, 308 transitions, 3748 flow [2024-06-04 16:11:56,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:11:56,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:11:56,847 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 16:11:56,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2024-06-04 16:11:56,847 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 16:11:56,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:11:56,848 INFO L85 PathProgramCache]: Analyzing trace with hash -710753985, now seen corresponding path program 6 times [2024-06-04 16:11:56,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:11:56,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621824477] [2024-06-04 16:11:56,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:11:56,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:11:56,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:12:02,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:12:02,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:12:02,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621824477] [2024-06-04 16:12:02,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621824477] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:12:02,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:12:02,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:12:02,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490427200] [2024-06-04 16:12:02,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:12:02,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:12:02,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:12:02,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:12:02,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:12:02,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:12:02,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 308 transitions, 3748 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:12:02,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:12:02,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:12:02,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:12:03,025 INFO L124 PetriNetUnfolderBase]: 887/1569 cut-off events. [2024-06-04 16:12:03,025 INFO L125 PetriNetUnfolderBase]: For 126945/126945 co-relation queries the response was YES. [2024-06-04 16:12:03,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11239 conditions, 1569 events. 887/1569 cut-off events. For 126945/126945 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 8610 event pairs, 151 based on Foata normal form. 4/1573 useless extension candidates. Maximal degree in co-relation 11079. Up to 1279 conditions per place. [2024-06-04 16:12:03,039 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 247 selfloop transitions, 77 changer transitions 0/326 dead transitions. [2024-06-04 16:12:03,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 326 transitions, 4480 flow [2024-06-04 16:12:03,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:12:03,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:12:03,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 121 transitions. [2024-06-04 16:12:03,040 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-04 16:12:03,040 INFO L175 Difference]: Start difference. First operand has 347 places, 308 transitions, 3748 flow. Second operand 11 states and 121 transitions. [2024-06-04 16:12:03,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 326 transitions, 4480 flow [2024-06-04 16:12:03,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 326 transitions, 4420 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-04 16:12:03,564 INFO L231 Difference]: Finished difference. Result has 349 places, 309 transitions, 3872 flow [2024-06-04 16:12:03,564 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3688, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3872, PETRI_PLACES=349, PETRI_TRANSITIONS=309} [2024-06-04 16:12:03,564 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 317 predicate places. [2024-06-04 16:12:03,564 INFO L495 AbstractCegarLoop]: Abstraction has has 349 places, 309 transitions, 3872 flow [2024-06-04 16:12:03,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:12:03,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:12:03,565 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 16:12:03,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2024-06-04 16:12:03,565 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 16:12:03,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:12:03,565 INFO L85 PathProgramCache]: Analyzing trace with hash -385626915, now seen corresponding path program 7 times [2024-06-04 16:12:03,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:12:03,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456264013] [2024-06-04 16:12:03,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:12:03,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:12:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:12:08,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:12:08,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:12:08,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456264013] [2024-06-04 16:12:08,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456264013] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:12:08,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:12:08,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:12:08,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859137627] [2024-06-04 16:12:08,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:12:08,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:12:08,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:12:08,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:12:08,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:12:08,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:12:08,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 309 transitions, 3872 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:12:08,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:12:08,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:12:08,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:12:09,347 INFO L124 PetriNetUnfolderBase]: 902/1596 cut-off events. [2024-06-04 16:12:09,347 INFO L125 PetriNetUnfolderBase]: For 138945/138945 co-relation queries the response was YES. [2024-06-04 16:12:09,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11743 conditions, 1596 events. 902/1596 cut-off events. For 138945/138945 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 8788 event pairs, 297 based on Foata normal form. 4/1600 useless extension candidates. Maximal degree in co-relation 11582. Up to 1486 conditions per place. [2024-06-04 16:12:09,366 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 303 selfloop transitions, 22 changer transitions 0/327 dead transitions. [2024-06-04 16:12:09,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 327 transitions, 4804 flow [2024-06-04 16:12:09,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:12:09,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:12:09,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 111 transitions. [2024-06-04 16:12:09,366 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30578512396694213 [2024-06-04 16:12:09,366 INFO L175 Difference]: Start difference. First operand has 349 places, 309 transitions, 3872 flow. Second operand 11 states and 111 transitions. [2024-06-04 16:12:09,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 327 transitions, 4804 flow [2024-06-04 16:12:09,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 327 transitions, 4630 flow, removed 11 selfloop flow, removed 9 redundant places. [2024-06-04 16:12:09,927 INFO L231 Difference]: Finished difference. Result has 351 places, 311 transitions, 3800 flow [2024-06-04 16:12:09,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3698, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3800, PETRI_PLACES=351, PETRI_TRANSITIONS=311} [2024-06-04 16:12:09,927 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 319 predicate places. [2024-06-04 16:12:09,927 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 311 transitions, 3800 flow [2024-06-04 16:12:09,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:12:09,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:12:09,927 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 16:12:09,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2024-06-04 16:12:09,928 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 16:12:09,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:12:09,928 INFO L85 PathProgramCache]: Analyzing trace with hash -659213773, now seen corresponding path program 24 times [2024-06-04 16:12:09,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:12:09,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300139162] [2024-06-04 16:12:09,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:12:09,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:12:09,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:12:14,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:12:14,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:12:14,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300139162] [2024-06-04 16:12:14,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300139162] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:12:14,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:12:14,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:12:14,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003345011] [2024-06-04 16:12:14,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:12:14,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:12:14,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:12:14,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:12:14,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:12:15,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:12:15,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 311 transitions, 3800 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:12:15,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:12:15,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:12:15,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:12:15,622 INFO L124 PetriNetUnfolderBase]: 904/1600 cut-off events. [2024-06-04 16:12:15,622 INFO L125 PetriNetUnfolderBase]: For 133412/133412 co-relation queries the response was YES. [2024-06-04 16:12:15,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11461 conditions, 1600 events. 904/1600 cut-off events. For 133412/133412 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 8813 event pairs, 304 based on Foata normal form. 4/1604 useless extension candidates. Maximal degree in co-relation 11299. Up to 1527 conditions per place. [2024-06-04 16:12:15,643 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 302 selfloop transitions, 23 changer transitions 0/327 dead transitions. [2024-06-04 16:12:15,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 327 transitions, 4736 flow [2024-06-04 16:12:15,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:12:15,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:12:15,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-04 16:12:15,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3242424242424242 [2024-06-04 16:12:15,644 INFO L175 Difference]: Start difference. First operand has 351 places, 311 transitions, 3800 flow. Second operand 10 states and 107 transitions. [2024-06-04 16:12:15,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 327 transitions, 4736 flow [2024-06-04 16:12:16,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 327 transitions, 4629 flow, removed 41 selfloop flow, removed 7 redundant places. [2024-06-04 16:12:16,232 INFO L231 Difference]: Finished difference. Result has 355 places, 313 transitions, 3808 flow [2024-06-04 16:12:16,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3693, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3808, PETRI_PLACES=355, PETRI_TRANSITIONS=313} [2024-06-04 16:12:16,233 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 323 predicate places. [2024-06-04 16:12:16,233 INFO L495 AbstractCegarLoop]: Abstraction has has 355 places, 313 transitions, 3808 flow [2024-06-04 16:12:16,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:12:16,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:12:16,233 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 16:12:16,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2024-06-04 16:12:16,233 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 16:12:16,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:12:16,234 INFO L85 PathProgramCache]: Analyzing trace with hash -397054755, now seen corresponding path program 8 times [2024-06-04 16:12:16,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:12:16,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173528076] [2024-06-04 16:12:16,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:12:16,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:12:16,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:12:23,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:12:23,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:12:23,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173528076] [2024-06-04 16:12:23,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173528076] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:12:23,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:12:23,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:12:23,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573593475] [2024-06-04 16:12:23,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:12:23,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:12:23,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:12:23,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:12:23,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:12:23,371 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:12:23,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 313 transitions, 3808 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:12:23,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:12:23,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:12:23,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:12:24,053 INFO L124 PetriNetUnfolderBase]: 898/1590 cut-off events. [2024-06-04 16:12:24,053 INFO L125 PetriNetUnfolderBase]: For 117275/117275 co-relation queries the response was YES. [2024-06-04 16:12:24,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10990 conditions, 1590 events. 898/1590 cut-off events. For 117275/117275 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 8752 event pairs, 296 based on Foata normal form. 4/1594 useless extension candidates. Maximal degree in co-relation 10825. Up to 1510 conditions per place. [2024-06-04 16:12:24,074 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 304 selfloop transitions, 21 changer transitions 0/327 dead transitions. [2024-06-04 16:12:24,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 327 transitions, 4500 flow [2024-06-04 16:12:24,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:12:24,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:12:24,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 110 transitions. [2024-06-04 16:12:24,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30303030303030304 [2024-06-04 16:12:24,076 INFO L175 Difference]: Start difference. First operand has 355 places, 313 transitions, 3808 flow. Second operand 11 states and 110 transitions. [2024-06-04 16:12:24,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 327 transitions, 4500 flow [2024-06-04 16:12:24,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 327 transitions, 4434 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-04 16:12:24,610 INFO L231 Difference]: Finished difference. Result has 358 places, 313 transitions, 3790 flow [2024-06-04 16:12:24,610 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3742, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3790, PETRI_PLACES=358, PETRI_TRANSITIONS=313} [2024-06-04 16:12:24,611 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 326 predicate places. [2024-06-04 16:12:24,611 INFO L495 AbstractCegarLoop]: Abstraction has has 358 places, 313 transitions, 3790 flow [2024-06-04 16:12:24,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 16:12:24,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:12:24,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 16:12:24,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2024-06-04 16:12:24,611 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 16:12:24,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:12:24,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1017222327, now seen corresponding path program 1 times [2024-06-04 16:12:24,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:12:24,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462229213] [2024-06-04 16:12:24,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:12:24,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:12:24,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:12:29,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:12:29,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:12:29,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462229213] [2024-06-04 16:12:29,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462229213] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:12:29,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:12:29,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:12:29,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388095568] [2024-06-04 16:12:29,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:12:29,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:12:29,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:12:29,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:12:29,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:12:29,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:12:29,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 313 transitions, 3790 flow. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:12:29,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:12:29,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:12:29,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:12:30,552 INFO L124 PetriNetUnfolderBase]: 940/1669 cut-off events. [2024-06-04 16:12:30,552 INFO L125 PetriNetUnfolderBase]: For 111473/111473 co-relation queries the response was YES. [2024-06-04 16:12:30,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11379 conditions, 1669 events. 940/1669 cut-off events. For 111473/111473 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 9334 event pairs, 157 based on Foata normal form. 2/1671 useless extension candidates. Maximal degree in co-relation 11213. Up to 1481 conditions per place. [2024-06-04 16:12:30,573 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 286 selfloop transitions, 60 changer transitions 0/348 dead transitions. [2024-06-04 16:12:30,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 348 transitions, 4723 flow [2024-06-04 16:12:30,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:12:30,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:12:30,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 122 transitions. [2024-06-04 16:12:30,573 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33608815426997246 [2024-06-04 16:12:30,574 INFO L175 Difference]: Start difference. First operand has 358 places, 313 transitions, 3790 flow. Second operand 11 states and 122 transitions. [2024-06-04 16:12:30,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 348 transitions, 4723 flow [2024-06-04 16:12:31,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 348 transitions, 4674 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-06-04 16:12:31,112 INFO L231 Difference]: Finished difference. Result has 364 places, 329 transitions, 4102 flow [2024-06-04 16:12:31,112 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3741, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4102, PETRI_PLACES=364, PETRI_TRANSITIONS=329} [2024-06-04 16:12:31,112 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 332 predicate places. [2024-06-04 16:12:31,112 INFO L495 AbstractCegarLoop]: Abstraction has has 364 places, 329 transitions, 4102 flow [2024-06-04 16:12:31,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:12:31,113 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:12:31,113 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:12:31,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2024-06-04 16:12:31,113 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 16:12:31,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:12:31,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1941588105, now seen corresponding path program 2 times [2024-06-04 16:12:31,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:12:31,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952366503] [2024-06-04 16:12:31,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:12:31,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:12:31,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:12:36,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:12:36,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:12:36,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952366503] [2024-06-04 16:12:36,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952366503] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:12:36,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:12:36,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 16:12:36,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512460156] [2024-06-04 16:12:36,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:12:36,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 16:12:36,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:12:36,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 16:12:36,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-06-04 16:12:36,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:12:36,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 329 transitions, 4102 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:12:36,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:12:36,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:12:36,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:12:37,715 INFO L124 PetriNetUnfolderBase]: 944/1679 cut-off events. [2024-06-04 16:12:37,716 INFO L125 PetriNetUnfolderBase]: For 114043/114043 co-relation queries the response was YES. [2024-06-04 16:12:37,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11796 conditions, 1679 events. 944/1679 cut-off events. For 114043/114043 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 9404 event pairs, 202 based on Foata normal form. 2/1681 useless extension candidates. Maximal degree in co-relation 11624. Up to 1525 conditions per place. [2024-06-04 16:12:37,737 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 301 selfloop transitions, 48 changer transitions 0/351 dead transitions. [2024-06-04 16:12:37,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 351 transitions, 4907 flow [2024-06-04 16:12:37,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 16:12:37,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 16:12:37,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 127 transitions. [2024-06-04 16:12:37,738 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3207070707070707 [2024-06-04 16:12:37,738 INFO L175 Difference]: Start difference. First operand has 364 places, 329 transitions, 4102 flow. Second operand 12 states and 127 transitions. [2024-06-04 16:12:37,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 351 transitions, 4907 flow [2024-06-04 16:12:38,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 351 transitions, 4816 flow, removed 22 selfloop flow, removed 4 redundant places. [2024-06-04 16:12:38,280 INFO L231 Difference]: Finished difference. Result has 372 places, 330 transitions, 4144 flow [2024-06-04 16:12:38,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4017, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4144, PETRI_PLACES=372, PETRI_TRANSITIONS=330} [2024-06-04 16:12:38,280 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 340 predicate places. [2024-06-04 16:12:38,280 INFO L495 AbstractCegarLoop]: Abstraction has has 372 places, 330 transitions, 4144 flow [2024-06-04 16:12:38,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:12:38,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:12:38,281 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 16:12:38,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2024-06-04 16:12:38,281 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 16:12:38,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:12:38,281 INFO L85 PathProgramCache]: Analyzing trace with hash -702364809, now seen corresponding path program 3 times [2024-06-04 16:12:38,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:12:38,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229573145] [2024-06-04 16:12:38,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:12:38,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:12:38,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:12:43,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:12:43,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:12:43,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229573145] [2024-06-04 16:12:43,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229573145] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:12:43,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:12:43,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 16:12:43,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266501381] [2024-06-04 16:12:43,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:12:43,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 16:12:43,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:12:43,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 16:12:43,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-06-04 16:12:43,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:12:43,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 330 transitions, 4144 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:12:43,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:12:43,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:12:43,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:12:44,101 INFO L124 PetriNetUnfolderBase]: 948/1687 cut-off events. [2024-06-04 16:12:44,101 INFO L125 PetriNetUnfolderBase]: For 118105/118105 co-relation queries the response was YES. [2024-06-04 16:12:44,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11841 conditions, 1687 events. 948/1687 cut-off events. For 118105/118105 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 9488 event pairs, 206 based on Foata normal form. 2/1689 useless extension candidates. Maximal degree in co-relation 11669. Up to 1536 conditions per place. [2024-06-04 16:12:44,123 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 305 selfloop transitions, 45 changer transitions 0/352 dead transitions. [2024-06-04 16:12:44,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 352 transitions, 4939 flow [2024-06-04 16:12:44,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 16:12:44,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 16:12:44,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 126 transitions. [2024-06-04 16:12:44,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3181818181818182 [2024-06-04 16:12:44,124 INFO L175 Difference]: Start difference. First operand has 372 places, 330 transitions, 4144 flow. Second operand 12 states and 126 transitions. [2024-06-04 16:12:44,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 352 transitions, 4939 flow [2024-06-04 16:12:44,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 352 transitions, 4794 flow, removed 11 selfloop flow, removed 11 redundant places. [2024-06-04 16:12:44,680 INFO L231 Difference]: Finished difference. Result has 373 places, 331 transitions, 4121 flow [2024-06-04 16:12:44,680 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3999, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4121, PETRI_PLACES=373, PETRI_TRANSITIONS=331} [2024-06-04 16:12:44,680 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 341 predicate places. [2024-06-04 16:12:44,680 INFO L495 AbstractCegarLoop]: Abstraction has has 373 places, 331 transitions, 4121 flow [2024-06-04 16:12:44,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:12:44,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:12:44,681 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 16:12:44,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2024-06-04 16:12:44,681 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 16:12:44,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:12:44,681 INFO L85 PathProgramCache]: Analyzing trace with hash -706775799, now seen corresponding path program 4 times [2024-06-04 16:12:44,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:12:44,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289446762] [2024-06-04 16:12:44,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:12:44,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:12:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:12:50,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:12:50,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:12:50,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289446762] [2024-06-04 16:12:50,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289446762] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:12:50,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:12:50,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 16:12:50,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035683270] [2024-06-04 16:12:50,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:12:50,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 16:12:50,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:12:50,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 16:12:50,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-06-04 16:12:50,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:12:50,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 331 transitions, 4121 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:12:50,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:12:50,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:12:50,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:12:51,002 INFO L124 PetriNetUnfolderBase]: 952/1695 cut-off events. [2024-06-04 16:12:51,002 INFO L125 PetriNetUnfolderBase]: For 120452/120452 co-relation queries the response was YES. [2024-06-04 16:12:51,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11862 conditions, 1695 events. 952/1695 cut-off events. For 120452/120452 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 9514 event pairs, 209 based on Foata normal form. 2/1697 useless extension candidates. Maximal degree in co-relation 11689. Up to 1539 conditions per place. [2024-06-04 16:12:51,019 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 308 selfloop transitions, 43 changer transitions 0/353 dead transitions. [2024-06-04 16:12:51,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 353 transitions, 4912 flow [2024-06-04 16:12:51,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 16:12:51,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 16:12:51,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 125 transitions. [2024-06-04 16:12:51,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31565656565656564 [2024-06-04 16:12:51,021 INFO L175 Difference]: Start difference. First operand has 373 places, 331 transitions, 4121 flow. Second operand 12 states and 125 transitions. [2024-06-04 16:12:51,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 353 transitions, 4912 flow [2024-06-04 16:12:51,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 353 transitions, 4800 flow, removed 12 selfloop flow, removed 10 redundant places. [2024-06-04 16:12:51,648 INFO L231 Difference]: Finished difference. Result has 375 places, 332 transitions, 4129 flow [2024-06-04 16:12:51,649 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4009, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4129, PETRI_PLACES=375, PETRI_TRANSITIONS=332} [2024-06-04 16:12:51,649 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 343 predicate places. [2024-06-04 16:12:51,649 INFO L495 AbstractCegarLoop]: Abstraction has has 375 places, 332 transitions, 4129 flow [2024-06-04 16:12:51,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:12:51,649 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:12:51,649 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 16:12:51,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2024-06-04 16:12:51,649 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 16:12:51,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:12:51,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1142134637, now seen corresponding path program 5 times [2024-06-04 16:12:51,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:12:51,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306368322] [2024-06-04 16:12:51,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:12:51,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:12:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:12:56,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:12:56,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:12:56,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306368322] [2024-06-04 16:12:56,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306368322] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:12:56,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:12:56,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 16:12:56,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96540334] [2024-06-04 16:12:56,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:12:56,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 16:12:56,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:12:56,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 16:12:56,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-06-04 16:12:56,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:12:56,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 332 transitions, 4129 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:12:56,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:12:56,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:12:56,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:12:57,220 INFO L124 PetriNetUnfolderBase]: 969/1730 cut-off events. [2024-06-04 16:12:57,220 INFO L125 PetriNetUnfolderBase]: For 122974/122974 co-relation queries the response was YES. [2024-06-04 16:12:57,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12011 conditions, 1730 events. 969/1730 cut-off events. For 122974/122974 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 9798 event pairs, 174 based on Foata normal form. 2/1732 useless extension candidates. Maximal degree in co-relation 11837. Up to 1482 conditions per place. [2024-06-04 16:12:57,237 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 306 selfloop transitions, 50 changer transitions 0/358 dead transitions. [2024-06-04 16:12:57,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 358 transitions, 4953 flow [2024-06-04 16:12:57,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 16:12:57,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 16:12:57,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 123 transitions. [2024-06-04 16:12:57,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3106060606060606 [2024-06-04 16:12:57,238 INFO L175 Difference]: Start difference. First operand has 375 places, 332 transitions, 4129 flow. Second operand 12 states and 123 transitions. [2024-06-04 16:12:57,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 358 transitions, 4953 flow [2024-06-04 16:12:57,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 358 transitions, 4843 flow, removed 13 selfloop flow, removed 10 redundant places. [2024-06-04 16:12:57,902 INFO L231 Difference]: Finished difference. Result has 379 places, 336 transitions, 4185 flow [2024-06-04 16:12:57,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4019, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4185, PETRI_PLACES=379, PETRI_TRANSITIONS=336} [2024-06-04 16:12:57,902 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 347 predicate places. [2024-06-04 16:12:57,902 INFO L495 AbstractCegarLoop]: Abstraction has has 379 places, 336 transitions, 4185 flow [2024-06-04 16:12:57,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:12:57,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:12:57,902 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 16:12:57,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2024-06-04 16:12:57,903 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 16:12:57,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:12:57,903 INFO L85 PathProgramCache]: Analyzing trace with hash 925522797, now seen corresponding path program 6 times [2024-06-04 16:12:57,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:12:57,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786652349] [2024-06-04 16:12:57,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:12:57,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:12:57,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:13:03,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:13:03,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:13:03,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786652349] [2024-06-04 16:13:03,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786652349] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:13:03,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:13:03,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 16:13:03,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760645893] [2024-06-04 16:13:03,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:13:03,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 16:13:03,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:13:03,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 16:13:03,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-06-04 16:13:03,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:13:03,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 336 transitions, 4185 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:13:03,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:13:03,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:13:03,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:13:03,975 INFO L124 PetriNetUnfolderBase]: 986/1765 cut-off events. [2024-06-04 16:13:03,975 INFO L125 PetriNetUnfolderBase]: For 125817/125817 co-relation queries the response was YES. [2024-06-04 16:13:03,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12220 conditions, 1765 events. 986/1765 cut-off events. For 125817/125817 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 10110 event pairs, 204 based on Foata normal form. 2/1767 useless extension candidates. Maximal degree in co-relation 12043. Up to 1569 conditions per place. [2024-06-04 16:13:03,998 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 314 selfloop transitions, 48 changer transitions 0/364 dead transitions. [2024-06-04 16:13:03,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 364 transitions, 5038 flow [2024-06-04 16:13:03,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-04 16:13:03,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-04 16:13:03,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 135 transitions. [2024-06-04 16:13:03,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3146853146853147 [2024-06-04 16:13:03,999 INFO L175 Difference]: Start difference. First operand has 379 places, 336 transitions, 4185 flow. Second operand 13 states and 135 transitions. [2024-06-04 16:13:03,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 364 transitions, 5038 flow [2024-06-04 16:13:04,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 364 transitions, 4919 flow, removed 20 selfloop flow, removed 7 redundant places. [2024-06-04 16:13:04,602 INFO L231 Difference]: Finished difference. Result has 388 places, 340 transitions, 4253 flow [2024-06-04 16:13:04,602 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4067, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4253, PETRI_PLACES=388, PETRI_TRANSITIONS=340} [2024-06-04 16:13:04,602 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 356 predicate places. [2024-06-04 16:13:04,602 INFO L495 AbstractCegarLoop]: Abstraction has has 388 places, 340 transitions, 4253 flow [2024-06-04 16:13:04,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:13:04,602 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:13:04,602 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 16:13:04,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2024-06-04 16:13:04,603 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 16:13:04,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:13:04,603 INFO L85 PathProgramCache]: Analyzing trace with hash 2002353617, now seen corresponding path program 1 times [2024-06-04 16:13:04,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:13:04,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183338067] [2024-06-04 16:13:04,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:13:04,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:13:04,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:13:11,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:13:11,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:13:11,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183338067] [2024-06-04 16:13:11,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183338067] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:13:11,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:13:11,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 16:13:11,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774830365] [2024-06-04 16:13:11,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:13:11,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 16:13:11,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:13:11,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 16:13:11,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-06-04 16:13:11,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-04 16:13:11,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 340 transitions, 4253 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 16:13:11,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:13:11,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-04 16:13:11,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:13:12,330 INFO L124 PetriNetUnfolderBase]: 992/1775 cut-off events. [2024-06-04 16:13:12,330 INFO L125 PetriNetUnfolderBase]: For 127134/127134 co-relation queries the response was YES. [2024-06-04 16:13:12,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12338 conditions, 1775 events. 992/1775 cut-off events. For 127134/127134 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 10183 event pairs, 229 based on Foata normal form. 2/1777 useless extension candidates. Maximal degree in co-relation 12158. Up to 1572 conditions per place. [2024-06-04 16:13:12,354 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 303 selfloop transitions, 56 changer transitions 0/361 dead transitions. [2024-06-04 16:13:12,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 361 transitions, 5109 flow [2024-06-04 16:13:12,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:13:12,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:13:12,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 129 transitions. [2024-06-04 16:13:12,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35537190082644626 [2024-06-04 16:13:12,356 INFO L175 Difference]: Start difference. First operand has 388 places, 340 transitions, 4253 flow. Second operand 11 states and 129 transitions. [2024-06-04 16:13:12,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 361 transitions, 5109 flow [2024-06-04 16:13:12,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 361 transitions, 4988 flow, removed 23 selfloop flow, removed 8 redundant places. [2024-06-04 16:13:12,962 INFO L231 Difference]: Finished difference. Result has 391 places, 342 transitions, 4309 flow [2024-06-04 16:13:12,962 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4132, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4309, PETRI_PLACES=391, PETRI_TRANSITIONS=342} [2024-06-04 16:13:12,962 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 359 predicate places. [2024-06-04 16:13:12,962 INFO L495 AbstractCegarLoop]: Abstraction has has 391 places, 342 transitions, 4309 flow [2024-06-04 16:13:12,962 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 16:13:12,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:13:12,962 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 16:13:12,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2024-06-04 16:13:12,962 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 16:13:12,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:13:12,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1859177079, now seen corresponding path program 1 times [2024-06-04 16:13:12,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:13:12,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768682576] [2024-06-04 16:13:12,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:13:12,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:13:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:13:19,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:13:19,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:13:19,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768682576] [2024-06-04 16:13:19,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768682576] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:13:19,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:13:19,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 16:13:19,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33413632] [2024-06-04 16:13:19,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:13:19,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 16:13:19,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:13:19,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 16:13:19,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-06-04 16:13:19,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:13:19,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 342 transitions, 4309 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:13:19,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:13:19,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:13:19,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:13:20,463 INFO L124 PetriNetUnfolderBase]: 995/1780 cut-off events. [2024-06-04 16:13:20,463 INFO L125 PetriNetUnfolderBase]: For 122952/122952 co-relation queries the response was YES. [2024-06-04 16:13:20,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12382 conditions, 1780 events. 995/1780 cut-off events. For 122952/122952 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 10227 event pairs, 226 based on Foata normal form. 1/1781 useless extension candidates. Maximal degree in co-relation 12201. Up to 1581 conditions per place. [2024-06-04 16:13:20,483 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 301 selfloop transitions, 62 changer transitions 0/365 dead transitions. [2024-06-04 16:13:20,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 365 transitions, 5182 flow [2024-06-04 16:13:20,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 16:13:20,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 16:13:20,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 128 transitions. [2024-06-04 16:13:20,484 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32323232323232326 [2024-06-04 16:13:20,484 INFO L175 Difference]: Start difference. First operand has 391 places, 342 transitions, 4309 flow. Second operand 12 states and 128 transitions. [2024-06-04 16:13:20,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 365 transitions, 5182 flow [2024-06-04 16:13:21,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 365 transitions, 5029 flow, removed 23 selfloop flow, removed 9 redundant places. [2024-06-04 16:13:21,158 INFO L231 Difference]: Finished difference. Result has 394 places, 344 transitions, 4360 flow [2024-06-04 16:13:21,158 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4156, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4360, PETRI_PLACES=394, PETRI_TRANSITIONS=344} [2024-06-04 16:13:21,158 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 362 predicate places. [2024-06-04 16:13:21,158 INFO L495 AbstractCegarLoop]: Abstraction has has 394 places, 344 transitions, 4360 flow [2024-06-04 16:13:21,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:13:21,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:13:21,159 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 16:13:21,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2024-06-04 16:13:21,159 INFO L420 AbstractCegarLoop]: === Iteration 137 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:13:21,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:13:21,159 INFO L85 PathProgramCache]: Analyzing trace with hash 177348825, now seen corresponding path program 7 times [2024-06-04 16:13:21,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:13:21,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224323104] [2024-06-04 16:13:21,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:13:21,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:13:21,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:13:26,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:13:26,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:13:26,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224323104] [2024-06-04 16:13:26,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224323104] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:13:26,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:13:26,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 16:13:26,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826676237] [2024-06-04 16:13:26,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:13:26,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 16:13:26,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:13:26,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 16:13:26,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-06-04 16:13:26,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:13:26,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 344 transitions, 4360 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:13:26,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:13:26,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:13:26,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:13:27,504 INFO L124 PetriNetUnfolderBase]: 1003/1796 cut-off events. [2024-06-04 16:13:27,505 INFO L125 PetriNetUnfolderBase]: For 129675/129675 co-relation queries the response was YES. [2024-06-04 16:13:27,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12505 conditions, 1796 events. 1003/1796 cut-off events. For 129675/129675 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 10364 event pairs, 184 based on Foata normal form. 2/1798 useless extension candidates. Maximal degree in co-relation 12323. Up to 1653 conditions per place. [2024-06-04 16:13:27,530 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 333 selfloop transitions, 34 changer transitions 0/369 dead transitions. [2024-06-04 16:13:27,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 369 transitions, 5208 flow [2024-06-04 16:13:27,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 16:13:27,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 16:13:27,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 128 transitions. [2024-06-04 16:13:27,531 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32323232323232326 [2024-06-04 16:13:27,531 INFO L175 Difference]: Start difference. First operand has 394 places, 344 transitions, 4360 flow. Second operand 12 states and 128 transitions. [2024-06-04 16:13:27,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 369 transitions, 5208 flow [2024-06-04 16:13:28,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 369 transitions, 5058 flow, removed 19 selfloop flow, removed 10 redundant places. [2024-06-04 16:13:28,256 INFO L231 Difference]: Finished difference. Result has 397 places, 346 transitions, 4327 flow [2024-06-04 16:13:28,257 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4210, PETRI_DIFFERENCE_MINUEND_PLACES=384, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4327, PETRI_PLACES=397, PETRI_TRANSITIONS=346} [2024-06-04 16:13:28,257 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 365 predicate places. [2024-06-04 16:13:28,257 INFO L495 AbstractCegarLoop]: Abstraction has has 397 places, 346 transitions, 4327 flow [2024-06-04 16:13:28,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:13:28,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:13:28,257 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 16:13:28,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2024-06-04 16:13:28,257 INFO L420 AbstractCegarLoop]: === Iteration 138 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:13:28,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:13:28,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1482782461, now seen corresponding path program 8 times [2024-06-04 16:13:28,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:13:28,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954049762] [2024-06-04 16:13:28,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:13:28,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:13:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:13:33,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:13:33,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:13:33,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954049762] [2024-06-04 16:13:33,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954049762] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:13:33,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:13:33,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 16:13:33,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374482007] [2024-06-04 16:13:33,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:13:33,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 16:13:33,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:13:33,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 16:13:33,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-06-04 16:13:33,299 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:13:33,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 346 transitions, 4327 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:13:33,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:13:33,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:13:33,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:13:34,059 INFO L124 PetriNetUnfolderBase]: 1007/1804 cut-off events. [2024-06-04 16:13:34,059 INFO L125 PetriNetUnfolderBase]: For 133167/133167 co-relation queries the response was YES. [2024-06-04 16:13:34,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12532 conditions, 1804 events. 1007/1804 cut-off events. For 133167/133167 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 10394 event pairs, 194 based on Foata normal form. 2/1806 useless extension candidates. Maximal degree in co-relation 12348. Up to 1671 conditions per place. [2024-06-04 16:13:34,082 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 327 selfloop transitions, 38 changer transitions 0/367 dead transitions. [2024-06-04 16:13:34,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 367 transitions, 5174 flow [2024-06-04 16:13:34,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:13:34,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:13:34,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 120 transitions. [2024-06-04 16:13:34,083 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3305785123966942 [2024-06-04 16:13:34,083 INFO L175 Difference]: Start difference. First operand has 397 places, 346 transitions, 4327 flow. Second operand 11 states and 120 transitions. [2024-06-04 16:13:34,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 367 transitions, 5174 flow [2024-06-04 16:13:34,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 367 transitions, 5076 flow, removed 17 selfloop flow, removed 9 redundant places. [2024-06-04 16:13:34,814 INFO L231 Difference]: Finished difference. Result has 399 places, 347 transitions, 4346 flow [2024-06-04 16:13:34,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4229, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4346, PETRI_PLACES=399, PETRI_TRANSITIONS=347} [2024-06-04 16:13:34,815 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 367 predicate places. [2024-06-04 16:13:34,815 INFO L495 AbstractCegarLoop]: Abstraction has has 399 places, 347 transitions, 4346 flow [2024-06-04 16:13:34,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:13:34,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:13:34,815 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 16:13:34,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2024-06-04 16:13:34,816 INFO L420 AbstractCegarLoop]: === Iteration 139 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:13:34,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:13:34,816 INFO L85 PathProgramCache]: Analyzing trace with hash 235556595, now seen corresponding path program 9 times [2024-06-04 16:13:34,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:13:34,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036416323] [2024-06-04 16:13:34,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:13:34,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:13:34,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:13:40,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:13:40,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:13:40,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036416323] [2024-06-04 16:13:40,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036416323] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:13:40,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:13:40,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 16:13:40,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56662048] [2024-06-04 16:13:40,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:13:40,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 16:13:40,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:13:40,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 16:13:40,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-06-04 16:13:40,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:13:40,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 347 transitions, 4346 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:13:40,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:13:40,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:13:40,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:13:41,189 INFO L124 PetriNetUnfolderBase]: 1021/1830 cut-off events. [2024-06-04 16:13:41,189 INFO L125 PetriNetUnfolderBase]: For 135923/135923 co-relation queries the response was YES. [2024-06-04 16:13:41,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12689 conditions, 1830 events. 1021/1830 cut-off events. For 135923/135923 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 10601 event pairs, 178 based on Foata normal form. 2/1832 useless extension candidates. Maximal degree in co-relation 12504. Up to 1598 conditions per place. [2024-06-04 16:13:41,272 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 301 selfloop transitions, 69 changer transitions 0/372 dead transitions. [2024-06-04 16:13:41,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 372 transitions, 5253 flow [2024-06-04 16:13:41,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:13:41,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:13:41,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2024-06-04 16:13:41,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3415977961432507 [2024-06-04 16:13:41,273 INFO L175 Difference]: Start difference. First operand has 399 places, 347 transitions, 4346 flow. Second operand 11 states and 124 transitions. [2024-06-04 16:13:41,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 372 transitions, 5253 flow [2024-06-04 16:13:42,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 372 transitions, 5148 flow, removed 16 selfloop flow, removed 9 redundant places. [2024-06-04 16:13:42,026 INFO L231 Difference]: Finished difference. Result has 404 places, 353 transitions, 4541 flow [2024-06-04 16:13:42,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4241, PETRI_DIFFERENCE_MINUEND_PLACES=390, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4541, PETRI_PLACES=404, PETRI_TRANSITIONS=353} [2024-06-04 16:13:42,026 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 372 predicate places. [2024-06-04 16:13:42,026 INFO L495 AbstractCegarLoop]: Abstraction has has 404 places, 353 transitions, 4541 flow [2024-06-04 16:13:42,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:13:42,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:13:42,027 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 16:13:42,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2024-06-04 16:13:42,027 INFO L420 AbstractCegarLoop]: === Iteration 140 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:13:42,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:13:42,028 INFO L85 PathProgramCache]: Analyzing trace with hash 183729545, now seen corresponding path program 10 times [2024-06-04 16:13:42,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:13:42,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815856081] [2024-06-04 16:13:42,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:13:42,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:13:42,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:13:47,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:13:47,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:13:47,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815856081] [2024-06-04 16:13:47,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815856081] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:13:47,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:13:47,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 16:13:47,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803346779] [2024-06-04 16:13:47,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:13:47,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 16:13:47,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:13:47,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 16:13:47,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-06-04 16:13:47,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:13:47,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 353 transitions, 4541 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:13:47,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:13:47,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:13:47,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:13:47,943 INFO L124 PetriNetUnfolderBase]: 1033/1854 cut-off events. [2024-06-04 16:13:47,943 INFO L125 PetriNetUnfolderBase]: For 139003/139003 co-relation queries the response was YES. [2024-06-04 16:13:47,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12971 conditions, 1854 events. 1033/1854 cut-off events. For 139003/139003 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 10799 event pairs, 194 based on Foata normal form. 2/1856 useless extension candidates. Maximal degree in co-relation 12782. Up to 1642 conditions per place. [2024-06-04 16:13:47,967 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 317 selfloop transitions, 55 changer transitions 0/374 dead transitions. [2024-06-04 16:13:47,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 374 transitions, 5395 flow [2024-06-04 16:13:47,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:13:47,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:13:47,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 121 transitions. [2024-06-04 16:13:47,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-04 16:13:47,968 INFO L175 Difference]: Start difference. First operand has 404 places, 353 transitions, 4541 flow. Second operand 11 states and 121 transitions. [2024-06-04 16:13:47,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 374 transitions, 5395 flow [2024-06-04 16:13:48,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 374 transitions, 5268 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-06-04 16:13:48,656 INFO L231 Difference]: Finished difference. Result has 411 places, 356 transitions, 4606 flow [2024-06-04 16:13:48,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4416, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4606, PETRI_PLACES=411, PETRI_TRANSITIONS=356} [2024-06-04 16:13:48,656 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 379 predicate places. [2024-06-04 16:13:48,656 INFO L495 AbstractCegarLoop]: Abstraction has has 411 places, 356 transitions, 4606 flow [2024-06-04 16:13:48,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:13:48,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:13:48,657 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 16:13:48,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139 [2024-06-04 16:13:48,657 INFO L420 AbstractCegarLoop]: === Iteration 141 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:13:48,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:13:48,657 INFO L85 PathProgramCache]: Analyzing trace with hash 194771693, now seen corresponding path program 2 times [2024-06-04 16:13:48,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:13:48,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424688562] [2024-06-04 16:13:48,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:13:48,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:13:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:13:55,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:13:55,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:13:55,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424688562] [2024-06-04 16:13:55,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424688562] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:13:55,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:13:55,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 16:13:55,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458562829] [2024-06-04 16:13:55,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:13:55,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 16:13:55,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:13:55,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 16:13:55,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-06-04 16:13:55,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:13:55,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 356 transitions, 4606 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:13:55,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:13:55,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:13:55,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:13:56,558 INFO L124 PetriNetUnfolderBase]: 1031/1851 cut-off events. [2024-06-04 16:13:56,558 INFO L125 PetriNetUnfolderBase]: For 127510/127510 co-relation queries the response was YES. [2024-06-04 16:13:56,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12831 conditions, 1851 events. 1031/1851 cut-off events. For 127510/127510 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 10794 event pairs, 198 based on Foata normal form. 1/1852 useless extension candidates. Maximal degree in co-relation 12639. Up to 1715 conditions per place. [2024-06-04 16:13:56,582 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 333 selfloop transitions, 41 changer transitions 0/376 dead transitions. [2024-06-04 16:13:56,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 376 transitions, 5445 flow [2024-06-04 16:13:56,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:13:56,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:13:56,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 121 transitions. [2024-06-04 16:13:56,583 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-04 16:13:56,583 INFO L175 Difference]: Start difference. First operand has 411 places, 356 transitions, 4606 flow. Second operand 11 states and 121 transitions. [2024-06-04 16:13:56,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 421 places, 376 transitions, 5445 flow [2024-06-04 16:13:57,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 376 transitions, 5287 flow, removed 35 selfloop flow, removed 7 redundant places. [2024-06-04 16:13:57,285 INFO L231 Difference]: Finished difference. Result has 415 places, 356 transitions, 4538 flow [2024-06-04 16:13:57,286 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4448, PETRI_DIFFERENCE_MINUEND_PLACES=404, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4538, PETRI_PLACES=415, PETRI_TRANSITIONS=356} [2024-06-04 16:13:57,286 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 383 predicate places. [2024-06-04 16:13:57,286 INFO L495 AbstractCegarLoop]: Abstraction has has 415 places, 356 transitions, 4538 flow [2024-06-04 16:13:57,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:13:57,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:13:57,286 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 16:13:57,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2024-06-04 16:13:57,286 INFO L420 AbstractCegarLoop]: === Iteration 142 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:13:57,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:13:57,287 INFO L85 PathProgramCache]: Analyzing trace with hash 851505425, now seen corresponding path program 11 times [2024-06-04 16:13:57,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:13:57,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040848354] [2024-06-04 16:13:57,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:13:57,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:13:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:14:02,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:14:02,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:14:02,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040848354] [2024-06-04 16:14:02,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040848354] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:14:02,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:14:02,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 16:14:02,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749554721] [2024-06-04 16:14:02,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:14:02,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 16:14:02,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:14:02,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 16:14:02,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-04 16:14:02,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:14:02,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 356 transitions, 4538 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:14:02,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:14:02,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:14:02,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:14:03,522 INFO L124 PetriNetUnfolderBase]: 1035/1859 cut-off events. [2024-06-04 16:14:03,522 INFO L125 PetriNetUnfolderBase]: For 132755/132755 co-relation queries the response was YES. [2024-06-04 16:14:03,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12816 conditions, 1859 events. 1035/1859 cut-off events. For 132755/132755 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 10855 event pairs, 175 based on Foata normal form. 2/1861 useless extension candidates. Maximal degree in co-relation 12623. Up to 1619 conditions per place. [2024-06-04 16:14:03,548 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 307 selfloop transitions, 69 changer transitions 0/378 dead transitions. [2024-06-04 16:14:03,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 378 transitions, 5426 flow [2024-06-04 16:14:03,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:14:03,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:14:03,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 125 transitions. [2024-06-04 16:14:03,549 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3443526170798898 [2024-06-04 16:14:03,550 INFO L175 Difference]: Start difference. First operand has 415 places, 356 transitions, 4538 flow. Second operand 11 states and 125 transitions. [2024-06-04 16:14:03,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 425 places, 378 transitions, 5426 flow [2024-06-04 16:14:04,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 416 places, 378 transitions, 5336 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-04 16:14:04,215 INFO L231 Difference]: Finished difference. Result has 417 places, 357 transitions, 4628 flow [2024-06-04 16:14:04,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4448, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4628, PETRI_PLACES=417, PETRI_TRANSITIONS=357} [2024-06-04 16:14:04,215 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 385 predicate places. [2024-06-04 16:14:04,215 INFO L495 AbstractCegarLoop]: Abstraction has has 417 places, 357 transitions, 4628 flow [2024-06-04 16:14:04,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:14:04,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:14:04,215 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 16:14:04,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141 [2024-06-04 16:14:04,215 INFO L420 AbstractCegarLoop]: === Iteration 143 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:14:04,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:14:04,216 INFO L85 PathProgramCache]: Analyzing trace with hash -2075597487, now seen corresponding path program 12 times [2024-06-04 16:14:04,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:14:04,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831432665] [2024-06-04 16:14:04,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:14:04,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:14:04,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:14:08,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:14:08,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:14:08,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831432665] [2024-06-04 16:14:08,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831432665] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:14:08,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:14:08,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 16:14:08,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873914016] [2024-06-04 16:14:08,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:14:08,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 16:14:08,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:14:08,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 16:14:08,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-04 16:14:08,874 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:14:08,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 357 transitions, 4628 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:14:08,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:14:08,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:14:08,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:14:09,574 INFO L124 PetriNetUnfolderBase]: 1039/1867 cut-off events. [2024-06-04 16:14:09,574 INFO L125 PetriNetUnfolderBase]: For 136185/136185 co-relation queries the response was YES. [2024-06-04 16:14:09,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12996 conditions, 1867 events. 1039/1867 cut-off events. For 136185/136185 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 10942 event pairs, 173 based on Foata normal form. 2/1869 useless extension candidates. Maximal degree in co-relation 12802. Up to 1627 conditions per place. [2024-06-04 16:14:09,599 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 309 selfloop transitions, 68 changer transitions 0/379 dead transitions. [2024-06-04 16:14:09,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 427 places, 379 transitions, 5512 flow [2024-06-04 16:14:09,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:14:09,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:14:09,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2024-06-04 16:14:09,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3415977961432507 [2024-06-04 16:14:09,600 INFO L175 Difference]: Start difference. First operand has 417 places, 357 transitions, 4628 flow. Second operand 11 states and 124 transitions. [2024-06-04 16:14:09,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 427 places, 379 transitions, 5512 flow [2024-06-04 16:14:10,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 416 places, 379 transitions, 5332 flow, removed 19 selfloop flow, removed 11 redundant places. [2024-06-04 16:14:10,407 INFO L231 Difference]: Finished difference. Result has 417 places, 358 transitions, 4628 flow [2024-06-04 16:14:10,407 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4448, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4628, PETRI_PLACES=417, PETRI_TRANSITIONS=358} [2024-06-04 16:14:10,407 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 385 predicate places. [2024-06-04 16:14:10,407 INFO L495 AbstractCegarLoop]: Abstraction has has 417 places, 358 transitions, 4628 flow [2024-06-04 16:14:10,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:14:10,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:14:10,408 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 16:14:10,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142 [2024-06-04 16:14:10,408 INFO L420 AbstractCegarLoop]: === Iteration 144 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:14:10,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:14:10,408 INFO L85 PathProgramCache]: Analyzing trace with hash -2068917483, now seen corresponding path program 1 times [2024-06-04 16:14:10,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:14:10,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362420938] [2024-06-04 16:14:10,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:14:10,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:14:10,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:14:16,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:14:16,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:14:16,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362420938] [2024-06-04 16:14:16,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362420938] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:14:16,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:14:16,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 16:14:16,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173485874] [2024-06-04 16:14:16,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:14:16,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 16:14:16,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:14:16,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 16:14:16,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-06-04 16:14:16,987 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:14:16,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 358 transitions, 4628 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:14:16,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:14:16,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:14:16,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:14:17,919 INFO L124 PetriNetUnfolderBase]: 1046/1880 cut-off events. [2024-06-04 16:14:17,919 INFO L125 PetriNetUnfolderBase]: For 133892/133892 co-relation queries the response was YES. [2024-06-04 16:14:17,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13000 conditions, 1880 events. 1046/1880 cut-off events. For 133892/133892 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 11061 event pairs, 277 based on Foata normal form. 2/1882 useless extension candidates. Maximal degree in co-relation 12807. Up to 1743 conditions per place. [2024-06-04 16:14:17,938 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 334 selfloop transitions, 45 changer transitions 0/381 dead transitions. [2024-06-04 16:14:17,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 381 transitions, 5498 flow [2024-06-04 16:14:17,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 16:14:17,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 16:14:17,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 127 transitions. [2024-06-04 16:14:17,939 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3207070707070707 [2024-06-04 16:14:17,939 INFO L175 Difference]: Start difference. First operand has 417 places, 358 transitions, 4628 flow. Second operand 12 states and 127 transitions. [2024-06-04 16:14:17,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 381 transitions, 5498 flow [2024-06-04 16:14:18,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 419 places, 381 transitions, 5328 flow, removed 18 selfloop flow, removed 9 redundant places. [2024-06-04 16:14:18,621 INFO L231 Difference]: Finished difference. Result has 421 places, 361 transitions, 4612 flow [2024-06-04 16:14:18,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4458, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4612, PETRI_PLACES=421, PETRI_TRANSITIONS=361} [2024-06-04 16:14:18,622 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 389 predicate places. [2024-06-04 16:14:18,622 INFO L495 AbstractCegarLoop]: Abstraction has has 421 places, 361 transitions, 4612 flow [2024-06-04 16:14:18,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:14:18,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:14:18,622 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 16:14:18,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143 [2024-06-04 16:14:18,622 INFO L420 AbstractCegarLoop]: === Iteration 145 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:14:18,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:14:18,622 INFO L85 PathProgramCache]: Analyzing trace with hash 857934515, now seen corresponding path program 13 times [2024-06-04 16:14:18,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:14:18,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202477109] [2024-06-04 16:14:18,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:14:18,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:14:18,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:14:23,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 16:14:23,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:14:23,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202477109] [2024-06-04 16:14:23,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202477109] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:14:23,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:14:23,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-04 16:14:23,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807055659] [2024-06-04 16:14:23,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:14:23,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-04 16:14:23,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:14:23,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-04 16:14:23,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-04 16:14:23,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-06-04 16:14:23,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 421 places, 361 transitions, 4612 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:14:23,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:14:23,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-06-04 16:14:23,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:14:24,355 INFO L124 PetriNetUnfolderBase]: 1050/1888 cut-off events. [2024-06-04 16:14:24,355 INFO L125 PetriNetUnfolderBase]: For 136125/136125 co-relation queries the response was YES. [2024-06-04 16:14:24,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13012 conditions, 1888 events. 1050/1888 cut-off events. For 136125/136125 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 11077 event pairs, 173 based on Foata normal form. 2/1890 useless extension candidates. Maximal degree in co-relation 12817. Up to 1599 conditions per place. [2024-06-04 16:14:24,380 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 299 selfloop transitions, 83 changer transitions 0/384 dead transitions. [2024-06-04 16:14:24,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 384 transitions, 5522 flow [2024-06-04 16:14:24,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:14:24,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:14:24,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 127 transitions. [2024-06-04 16:14:24,380 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.349862258953168 [2024-06-04 16:14:24,380 INFO L175 Difference]: Start difference. First operand has 421 places, 361 transitions, 4612 flow. Second operand 11 states and 127 transitions. [2024-06-04 16:14:24,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 431 places, 384 transitions, 5522 flow [2024-06-04 16:14:25,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 422 places, 384 transitions, 5418 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-06-04 16:14:25,085 INFO L231 Difference]: Finished difference. Result has 423 places, 362 transitions, 4720 flow [2024-06-04 16:14:25,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4508, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4720, PETRI_PLACES=423, PETRI_TRANSITIONS=362} [2024-06-04 16:14:25,086 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 391 predicate places. [2024-06-04 16:14:25,086 INFO L495 AbstractCegarLoop]: Abstraction has has 423 places, 362 transitions, 4720 flow [2024-06-04 16:14:25,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:14:25,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:14:25,086 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 16:14:25,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable144 [2024-06-04 16:14:25,086 INFO L420 AbstractCegarLoop]: === Iteration 146 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:14:25,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:14:25,086 INFO L85 PathProgramCache]: Analyzing trace with hash -2075412913, now seen corresponding path program 2 times [2024-06-04 16:14:25,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:14:25,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438085103] [2024-06-04 16:14:25,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:14:25,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:14:25,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15