./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix009.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix009.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix009.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix009.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-03 21:17:55,996 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-03 21:17:56,069 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-03 21:17:56,078 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-03 21:17:56,079 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-03 21:17:56,103 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-03 21:17:56,103 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-03 21:17:56,104 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-03 21:17:56,104 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-03 21:17:56,109 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-03 21:17:56,109 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-03 21:17:56,109 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-03 21:17:56,110 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-03 21:17:56,111 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-03 21:17:56,111 INFO L153 SettingsManager]: * Use SBE=true [2024-06-03 21:17:56,112 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-03 21:17:56,112 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-03 21:17:56,112 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-03 21:17:56,112 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-03 21:17:56,112 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-03 21:17:56,113 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-03 21:17:56,113 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-03 21:17:56,113 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-03 21:17:56,113 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-03 21:17:56,114 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-03 21:17:56,114 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-03 21:17:56,114 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-03 21:17:56,114 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-03 21:17:56,115 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-03 21:17:56,115 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-03 21:17:56,116 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-03 21:17:56,116 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-03 21:17:56,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 21:17:56,117 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-03 21:17:56,117 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-03 21:17:56,117 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-03 21:17:56,117 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-03 21:17:56,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-03 21:17:56,118 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-03 21:17:56,118 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-03 21:17:56,118 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-03 21:17:56,118 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-03 21:17:56,118 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-03 21:17:56,119 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-03 21:17:56,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-03 21:17:56,387 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-03 21:17:56,389 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-03 21:17:56,390 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-03 21:17:56,391 INFO L274 PluginConnector]: CDTParser initialized [2024-06-03 21:17:56,391 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix009.opt.i [2024-06-03 21:17:57,511 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-03 21:17:57,733 INFO L384 CDTParser]: Found 1 translation units. [2024-06-03 21:17:57,737 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix009.opt.i [2024-06-03 21:17:57,757 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/461b8b354/fbae21145ee64fb6b5f4b4ab586a3eba/FLAG43890004f [2024-06-03 21:17:57,774 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/461b8b354/fbae21145ee64fb6b5f4b4ab586a3eba [2024-06-03 21:17:57,776 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-03 21:17:57,776 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-03 21:17:57,777 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/mix009.opt.yml/witness.yml [2024-06-03 21:17:57,922 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-03 21:17:57,923 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-03 21:17:57,925 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-03 21:17:57,925 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-03 21:17:57,929 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-03 21:17:57,929 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 09:17:57" (1/2) ... [2024-06-03 21:17:57,930 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7651d629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:17:57, skipping insertion in model container [2024-06-03 21:17:57,931 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 09:17:57" (1/2) ... [2024-06-03 21:17:57,932 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@31cc7cb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:17:57, skipping insertion in model container [2024-06-03 21:17:57,932 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 09:17:57" (2/2) ... [2024-06-03 21:17:57,933 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7651d629 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:17:57, skipping insertion in model container [2024-06-03 21:17:57,933 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 09:17:57" (2/2) ... [2024-06-03 21:17:57,933 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-03 21:17:58,070 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-03 21:17:58,071 INFO L97 edCorrectnessWitness]: Location invariant before [L834-L834] ((((((((((((((((((! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p1_EBX) + (long long )z >= 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_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_thd0) + (long long )z >= 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_buff0_thd1) + (long long )z >= 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_thd0) + (long long )z >= 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$r_buff1_thd1) + (long long )z >= 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) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p0_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p1_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )x) + (long long )y >= 0LL) && (1LL - (long long )x) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )x) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 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 )z >= 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_p0_EBX >= 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 )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (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 )z >= 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 )z >= 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 )z >= 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 )x + (long long )z >= 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 + (long long )z >= 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$flush_delayed + (long long )z >= 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$mem_tmp + (long long )z >= 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_thd0 + (long long )z >= 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_buff0_thd1 + (long long )z >= 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_thd0 + (long long )z >= 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$r_buff1_thd1 + (long long )z >= 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$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 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 )z >= 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) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p0_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 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) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )x) - (long long )z >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )x >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )z >= 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_p0_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (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 || (((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 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)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || y$read_delayed == (_Bool)0) [2024-06-03 21:17:58,072 INFO L97 edCorrectnessWitness]: Location invariant before [L835-L835] ((((((((((((((((((! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p1_EBX) + (long long )z >= 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_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_thd0) + (long long )z >= 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_buff0_thd1) + (long long )z >= 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_thd0) + (long long )z >= 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$r_buff1_thd1) + (long long )z >= 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) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p0_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p1_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )x) + (long long )y >= 0LL) && (1LL - (long long )x) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )x) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 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 )z >= 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_p0_EBX >= 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 )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (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 )z >= 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 )z >= 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 )z >= 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 )x + (long long )z >= 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 + (long long )z >= 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$flush_delayed + (long long )z >= 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$mem_tmp + (long long )z >= 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_thd0 + (long long )z >= 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_buff0_thd1 + (long long )z >= 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_thd0 + (long long )z >= 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$r_buff1_thd1 + (long long )z >= 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$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 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 )z >= 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) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p0_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 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) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )x) - (long long )z >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )x >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )z >= 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_p0_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (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 || (((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 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)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || y$read_delayed == (_Bool)0) [2024-06-03 21:17:58,073 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-03 21:17:58,073 INFO L106 edCorrectnessWitness]: ghost_update [L832-L832] multithreaded = 1; [2024-06-03 21:17:58,118 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-03 21:17:58,427 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 21:17:58,436 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-03 21:17:58,747 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 21:17:58,772 INFO L206 MainTranslator]: Completed translation [2024-06-03 21:17:58,773 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:17:58 WrapperNode [2024-06-03 21:17:58,773 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-03 21:17:58,774 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-03 21:17:58,774 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-03 21:17:58,774 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-03 21:17:58,779 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 03.06 09:17:58" (1/1) ... [2024-06-03 21:17:58,821 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 03.06 09:17:58" (1/1) ... [2024-06-03 21:17:58,927 INFO L138 Inliner]: procedures = 174, calls = 40, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 138 [2024-06-03 21:17:58,927 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-03 21:17:58,927 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-03 21:17:58,928 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-03 21:17:58,928 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-03 21:17:58,936 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:17:58" (1/1) ... [2024-06-03 21:17:58,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:17:58" (1/1) ... [2024-06-03 21:17:58,964 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:17:58" (1/1) ... [2024-06-03 21:17:58,987 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-03 21:17:58,988 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:17:58" (1/1) ... [2024-06-03 21:17:58,988 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:17:58" (1/1) ... [2024-06-03 21:17:59,021 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:17:58" (1/1) ... [2024-06-03 21:17:59,033 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:17:58" (1/1) ... [2024-06-03 21:17:59,039 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:17:58" (1/1) ... [2024-06-03 21:17:59,052 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:17:58" (1/1) ... [2024-06-03 21:17:59,069 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-03 21:17:59,070 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-03 21:17:59,070 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-03 21:17:59,070 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-03 21:17:59,071 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:17:58" (1/1) ... [2024-06-03 21:17:59,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 21:17:59,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 21:17:59,121 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-03 21:17:59,157 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-03 21:17:59,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-03 21:17:59,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-03 21:17:59,168 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-03 21:17:59,169 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-03 21:17:59,169 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-03 21:17:59,169 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-03 21:17:59,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-03 21:17:59,169 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-03 21:17:59,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-03 21:17:59,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-03 21:17:59,171 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-03 21:17:59,313 INFO L244 CfgBuilder]: Building ICFG [2024-06-03 21:17:59,314 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-03 21:18:00,301 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-03 21:18:00,301 INFO L293 CfgBuilder]: Performing block encoding [2024-06-03 21:18:00,496 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-03 21:18:00,497 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-03 21:18:00,498 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 09:18:00 BoogieIcfgContainer [2024-06-03 21:18:00,498 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-03 21:18:00,500 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-03 21:18:00,500 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-03 21:18:00,502 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-03 21:18:00,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 09:17:57" (1/4) ... [2024-06-03 21:18:00,503 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1624be05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 09:18:00, skipping insertion in model container [2024-06-03 21:18:00,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 09:17:57" (2/4) ... [2024-06-03 21:18:00,503 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1624be05 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 09:18:00, skipping insertion in model container [2024-06-03 21:18:00,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:17:58" (3/4) ... [2024-06-03 21:18:00,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1624be05 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 09:18:00, skipping insertion in model container [2024-06-03 21:18:00,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 09:18:00" (4/4) ... [2024-06-03 21:18:00,505 INFO L112 eAbstractionObserver]: Analyzing ICFG mix009.opt.i [2024-06-03 21:18:00,517 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-03 21:18:00,517 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-03 21:18:00,518 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-03 21:18:00,594 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-03 21:18:00,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 33 transitions, 74 flow [2024-06-03 21:18:00,656 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2024-06-03 21:18:00,657 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 21:18:00,658 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 47 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-03 21:18:00,658 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 33 transitions, 74 flow [2024-06-03 21:18:00,660 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 25 transitions, 56 flow [2024-06-03 21:18:00,666 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-03 21:18:00,671 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;@57ff6f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-03 21:18:00,671 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-03 21:18:00,711 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-03 21:18:00,711 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-06-03 21:18:00,711 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 21:18:00,711 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:18:00,712 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-03 21:18:00,712 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-03 21:18:00,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:18:00,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1580010432, now seen corresponding path program 1 times [2024-06-03 21:18:00,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:18:00,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322551798] [2024-06-03 21:18:00,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:18:00,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:18:00,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:18:05,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:18:05,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:18:05,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322551798] [2024-06-03 21:18:05,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322551798] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:18:05,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:18:05,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-03 21:18:05,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919685648] [2024-06-03 21:18:05,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:18:05,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-03 21:18:05,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:18:05,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-03 21:18:05,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-03 21:18:05,766 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-06-03 21:18:05,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:18:05,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:18:05,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-06-03 21:18:05,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:18:06,048 INFO L124 PetriNetUnfolderBase]: 162/317 cut-off events. [2024-06-03 21:18:06,048 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-03 21:18:06,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 630 conditions, 317 events. 162/317 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1277 event pairs, 97 based on Foata normal form. 1/304 useless extension candidates. Maximal degree in co-relation 616. Up to 288 conditions per place. [2024-06-03 21:18:06,053 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 23 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2024-06-03 21:18:06,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 31 transitions, 123 flow [2024-06-03 21:18:06,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-03 21:18:06,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-03 21:18:06,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2024-06-03 21:18:06,062 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5858585858585859 [2024-06-03 21:18:06,063 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 56 flow. Second operand 3 states and 58 transitions. [2024-06-03 21:18:06,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 31 transitions, 123 flow [2024-06-03 21:18:06,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 31 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-03 21:18:06,066 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 75 flow [2024-06-03 21:18:06,068 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-03 21:18:06,070 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2024-06-03 21:18:06,070 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 75 flow [2024-06-03 21:18:06,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:18:06,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:18:06,071 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:18:06,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-03 21:18:06,071 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-03 21:18:06,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:18:06,072 INFO L85 PathProgramCache]: Analyzing trace with hash 2028483035, now seen corresponding path program 1 times [2024-06-03 21:18:06,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:18:06,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124149760] [2024-06-03 21:18:06,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:18:06,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:18:06,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:18:09,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:18:09,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:18:09,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124149760] [2024-06-03 21:18:09,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124149760] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:18:09,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:18:09,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-03 21:18:09,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345703972] [2024-06-03 21:18:09,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:18:09,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-03 21:18:09,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:18:09,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-03 21:18:09,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-03 21:18:09,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-03 21:18:09,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:18:09,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:18:09,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-03 21:18:09,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:18:10,048 INFO L124 PetriNetUnfolderBase]: 186/347 cut-off events. [2024-06-03 21:18:10,048 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2024-06-03 21:18:10,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 791 conditions, 347 events. 186/347 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1360 event pairs, 94 based on Foata normal form. 2/346 useless extension candidates. Maximal degree in co-relation 776. Up to 319 conditions per place. [2024-06-03 21:18:10,051 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 28 selfloop transitions, 5 changer transitions 0/37 dead transitions. [2024-06-03 21:18:10,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 37 transitions, 167 flow [2024-06-03 21:18:10,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-03 21:18:10,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-03 21:18:10,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2024-06-03 21:18:10,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5378787878787878 [2024-06-03 21:18:10,053 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 75 flow. Second operand 4 states and 71 transitions. [2024-06-03 21:18:10,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 37 transitions, 167 flow [2024-06-03 21:18:10,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 37 transitions, 164 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-03 21:18:10,054 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 99 flow [2024-06-03 21:18:10,055 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-03 21:18:10,055 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2024-06-03 21:18:10,055 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 99 flow [2024-06-03 21:18:10,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:18:10,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:18:10,056 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:18:10,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-03 21:18:10,056 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:18:10,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:18:10,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1543321887, now seen corresponding path program 1 times [2024-06-03 21:18:10,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:18:10,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755446952] [2024-06-03 21:18:10,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:18:10,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:18:10,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:18:13,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:18:13,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:18:13,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755446952] [2024-06-03 21:18:13,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755446952] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:18:13,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:18:13,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-03 21:18:13,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475556081] [2024-06-03 21:18:13,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:18:13,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-03 21:18:13,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:18:13,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-03 21:18:13,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-03 21:18:13,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 21:18:13,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 99 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:18:13,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:18:13,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 21:18:13,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:18:13,851 INFO L124 PetriNetUnfolderBase]: 219/398 cut-off events. [2024-06-03 21:18:13,852 INFO L125 PetriNetUnfolderBase]: For 228/228 co-relation queries the response was YES. [2024-06-03 21:18:13,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1006 conditions, 398 events. 219/398 cut-off events. For 228/228 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1500 event pairs, 99 based on Foata normal form. 2/397 useless extension candidates. Maximal degree in co-relation 989. Up to 366 conditions per place. [2024-06-03 21:18:13,856 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 33 selfloop transitions, 7 changer transitions 0/43 dead transitions. [2024-06-03 21:18:13,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 43 transitions, 217 flow [2024-06-03 21:18:13,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 21:18:13,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 21:18:13,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2024-06-03 21:18:13,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49696969696969695 [2024-06-03 21:18:13,859 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 99 flow. Second operand 5 states and 82 transitions. [2024-06-03 21:18:13,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 43 transitions, 217 flow [2024-06-03 21:18:13,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 43 transitions, 208 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-03 21:18:13,863 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 123 flow [2024-06-03 21:18:13,863 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=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2024-06-03 21:18:13,864 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2024-06-03 21:18:13,864 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 123 flow [2024-06-03 21:18:13,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:18:13,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:18:13,864 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:18:13,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-03 21:18:13,865 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-03 21:18:13,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:18:13,865 INFO L85 PathProgramCache]: Analyzing trace with hash -598337282, now seen corresponding path program 1 times [2024-06-03 21:18:13,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:18:13,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812780956] [2024-06-03 21:18:13,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:18:13,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:18:13,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:18:17,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:18:17,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:18:17,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812780956] [2024-06-03 21:18:17,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812780956] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:18:17,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:18:17,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 21:18:17,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133947608] [2024-06-03 21:18:17,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:18:17,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 21:18:17,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:18:17,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 21:18:17,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-03 21:18:17,588 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 21:18:17,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 123 flow. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:18:17,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:18:17,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 21:18:17,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:18:17,864 INFO L124 PetriNetUnfolderBase]: 216/393 cut-off events. [2024-06-03 21:18:17,864 INFO L125 PetriNetUnfolderBase]: For 386/386 co-relation queries the response was YES. [2024-06-03 21:18:17,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1085 conditions, 393 events. 216/393 cut-off events. For 386/386 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1495 event pairs, 78 based on Foata normal form. 2/393 useless extension candidates. Maximal degree in co-relation 1067. Up to 352 conditions per place. [2024-06-03 21:18:17,867 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 37 selfloop transitions, 9 changer transitions 0/49 dead transitions. [2024-06-03 21:18:17,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 49 transitions, 265 flow [2024-06-03 21:18:17,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 21:18:17,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 21:18:17,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2024-06-03 21:18:17,869 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2024-06-03 21:18:17,869 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 123 flow. Second operand 6 states and 96 transitions. [2024-06-03 21:18:17,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 49 transitions, 265 flow [2024-06-03 21:18:17,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 49 transitions, 250 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-03 21:18:17,871 INFO L231 Difference]: Finished difference. Result has 42 places, 33 transitions, 147 flow [2024-06-03 21:18:17,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=147, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2024-06-03 21:18:17,872 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 10 predicate places. [2024-06-03 21:18:17,872 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 147 flow [2024-06-03 21:18:17,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:18:17,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:18:17,873 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:18:17,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-03 21:18:17,873 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:18:17,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:18:17,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1368585568, now seen corresponding path program 1 times [2024-06-03 21:18:17,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:18:17,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444878404] [2024-06-03 21:18:17,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:18:17,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:18:17,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:18:22,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:18:22,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:18:22,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444878404] [2024-06-03 21:18:22,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444878404] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:18:22,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:18:22,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 21:18:22,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041697313] [2024-06-03 21:18:22,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:18:22,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 21:18:22,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:18:22,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 21:18:22,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-03 21:18:23,053 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 21:18:23,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 147 flow. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:18:23,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:18:23,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 21:18:23,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:18:23,413 INFO L124 PetriNetUnfolderBase]: 213/388 cut-off events. [2024-06-03 21:18:23,413 INFO L125 PetriNetUnfolderBase]: For 580/580 co-relation queries the response was YES. [2024-06-03 21:18:23,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1154 conditions, 388 events. 213/388 cut-off events. For 580/580 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1452 event pairs, 57 based on Foata normal form. 2/388 useless extension candidates. Maximal degree in co-relation 1135. Up to 338 conditions per place. [2024-06-03 21:18:23,416 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 41 selfloop transitions, 11 changer transitions 0/55 dead transitions. [2024-06-03 21:18:23,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 55 transitions, 313 flow [2024-06-03 21:18:23,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:18:23,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:18:23,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2024-06-03 21:18:23,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-06-03 21:18:23,419 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 147 flow. Second operand 7 states and 110 transitions. [2024-06-03 21:18:23,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 55 transitions, 313 flow [2024-06-03 21:18:23,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 55 transitions, 292 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-03 21:18:23,424 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 171 flow [2024-06-03 21:18:23,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=171, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2024-06-03 21:18:23,426 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 13 predicate places. [2024-06-03 21:18:23,428 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 171 flow [2024-06-03 21:18:23,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:18:23,428 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:18:23,429 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:18:23,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-03 21:18:23,434 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-03 21:18:23,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:18:23,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1810801090, now seen corresponding path program 1 times [2024-06-03 21:18:23,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:18:23,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161420728] [2024-06-03 21:18:23,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:18:23,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:18:23,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:18:31,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:18:31,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:18:31,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161420728] [2024-06-03 21:18:31,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161420728] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:18:31,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:18:31,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 21:18:31,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571887442] [2024-06-03 21:18:31,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:18:31,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 21:18:31,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:18:31,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 21:18:31,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-03 21:18:31,177 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-03 21:18:31,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 171 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:18:31,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:18:31,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-03 21:18:31,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:18:31,453 INFO L124 PetriNetUnfolderBase]: 165/334 cut-off events. [2024-06-03 21:18:31,453 INFO L125 PetriNetUnfolderBase]: For 675/675 co-relation queries the response was YES. [2024-06-03 21:18:31,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1036 conditions, 334 events. 165/334 cut-off events. For 675/675 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1315 event pairs, 46 based on Foata normal form. 1/333 useless extension candidates. Maximal degree in co-relation 1016. Up to 291 conditions per place. [2024-06-03 21:18:31,456 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 30 selfloop transitions, 6 changer transitions 0/42 dead transitions. [2024-06-03 21:18:31,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 42 transitions, 261 flow [2024-06-03 21:18:31,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 21:18:31,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 21:18:31,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2024-06-03 21:18:31,457 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2024-06-03 21:18:31,458 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 171 flow. Second operand 5 states and 75 transitions. [2024-06-03 21:18:31,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 42 transitions, 261 flow [2024-06-03 21:18:31,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 42 transitions, 234 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-03 21:18:31,460 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 171 flow [2024-06-03 21:18:31,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=171, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2024-06-03 21:18:31,462 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 13 predicate places. [2024-06-03 21:18:31,462 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 171 flow [2024-06-03 21:18:31,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:18:31,462 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:18:31,463 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:18:31,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-03 21:18:31,463 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-03 21:18:31,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:18:31,463 INFO L85 PathProgramCache]: Analyzing trace with hash -300257916, now seen corresponding path program 1 times [2024-06-03 21:18:31,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:18:31,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784272789] [2024-06-03 21:18:31,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:18:31,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:18:31,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:18:39,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:18:39,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:18:39,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784272789] [2024-06-03 21:18:39,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784272789] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:18:39,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:18:39,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 21:18:39,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30891126] [2024-06-03 21:18:39,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:18:39,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 21:18:39,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:18:39,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 21:18:39,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-03 21:18:39,922 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-03 21:18:39,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 171 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 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-03 21:18:39,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:18:39,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-03 21:18:39,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:18:40,179 INFO L124 PetriNetUnfolderBase]: 161/328 cut-off events. [2024-06-03 21:18:40,179 INFO L125 PetriNetUnfolderBase]: For 826/826 co-relation queries the response was YES. [2024-06-03 21:18:40,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1053 conditions, 328 events. 161/328 cut-off events. For 826/826 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1281 event pairs, 44 based on Foata normal form. 2/328 useless extension candidates. Maximal degree in co-relation 1031. Up to 279 conditions per place. [2024-06-03 21:18:40,182 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 32 selfloop transitions, 8 changer transitions 0/46 dead transitions. [2024-06-03 21:18:40,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 46 transitions, 275 flow [2024-06-03 21:18:40,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 21:18:40,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 21:18:40,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2024-06-03 21:18:40,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-03 21:18:40,184 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 171 flow. Second operand 6 states and 88 transitions. [2024-06-03 21:18:40,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 46 transitions, 275 flow [2024-06-03 21:18:40,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 46 transitions, 264 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-03 21:18:40,186 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 193 flow [2024-06-03 21:18:40,187 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=193, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2024-06-03 21:18:40,187 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 16 predicate places. [2024-06-03 21:18:40,187 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 193 flow [2024-06-03 21:18:40,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 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-03 21:18:40,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:18:40,188 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:18:40,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-03 21:18:40,188 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-03 21:18:40,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:18:40,189 INFO L85 PathProgramCache]: Analyzing trace with hash -695099597, now seen corresponding path program 1 times [2024-06-03 21:18:40,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:18:40,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354059546] [2024-06-03 21:18:40,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:18:40,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:18:40,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:18:46,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:18:46,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:18:46,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354059546] [2024-06-03 21:18:46,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354059546] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:18:46,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:18:46,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 21:18:46,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966086592] [2024-06-03 21:18:46,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:18:46,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 21:18:46,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:18:46,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 21:18:46,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 21:18:46,900 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 21:18:46,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 193 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:18:46,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:18:46,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 21:18:46,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:18:47,210 INFO L124 PetriNetUnfolderBase]: 192/365 cut-off events. [2024-06-03 21:18:47,210 INFO L125 PetriNetUnfolderBase]: For 1180/1180 co-relation queries the response was YES. [2024-06-03 21:18:47,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1277 conditions, 365 events. 192/365 cut-off events. For 1180/1180 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1405 event pairs, 52 based on Foata normal form. 1/364 useless extension candidates. Maximal degree in co-relation 1254. Up to 328 conditions per place. [2024-06-03 21:18:47,212 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 37 selfloop transitions, 8 changer transitions 0/50 dead transitions. [2024-06-03 21:18:47,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 50 transitions, 313 flow [2024-06-03 21:18:47,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 21:18:47,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 21:18:47,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2024-06-03 21:18:47,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4292929292929293 [2024-06-03 21:18:47,214 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 193 flow. Second operand 6 states and 85 transitions. [2024-06-03 21:18:47,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 50 transitions, 313 flow [2024-06-03 21:18:47,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 50 transitions, 296 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-03 21:18:47,216 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 209 flow [2024-06-03 21:18:47,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=209, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2024-06-03 21:18:47,216 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 18 predicate places. [2024-06-03 21:18:47,216 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 209 flow [2024-06-03 21:18:47,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:18:47,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:18:47,217 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:18:47,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-03 21:18:47,217 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-03 21:18:47,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:18:47,218 INFO L85 PathProgramCache]: Analyzing trace with hash -718069667, now seen corresponding path program 2 times [2024-06-03 21:18:47,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:18:47,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292338941] [2024-06-03 21:18:47,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:18:47,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:18:47,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:18:54,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:18:54,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:18:54,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292338941] [2024-06-03 21:18:54,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292338941] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:18:54,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:18:54,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 21:18:54,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694318568] [2024-06-03 21:18:54,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:18:54,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 21:18:54,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:18:54,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 21:18:54,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 21:18:54,279 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 21:18:54,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 209 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:18:54,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:18:54,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 21:18:54,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:18:54,505 INFO L124 PetriNetUnfolderBase]: 190/363 cut-off events. [2024-06-03 21:18:54,506 INFO L125 PetriNetUnfolderBase]: For 1475/1481 co-relation queries the response was YES. [2024-06-03 21:18:54,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1330 conditions, 363 events. 190/363 cut-off events. For 1475/1481 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1388 event pairs, 56 based on Foata normal form. 5/365 useless extension candidates. Maximal degree in co-relation 1306. Up to 319 conditions per place. [2024-06-03 21:18:54,508 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 33 selfloop transitions, 11 changer transitions 0/49 dead transitions. [2024-06-03 21:18:54,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 49 transitions, 323 flow [2024-06-03 21:18:54,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 21:18:54,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 21:18:54,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2024-06-03 21:18:54,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-03 21:18:54,509 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 209 flow. Second operand 6 states and 84 transitions. [2024-06-03 21:18:54,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 49 transitions, 323 flow [2024-06-03 21:18:54,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 49 transitions, 306 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-03 21:18:54,512 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 235 flow [2024-06-03 21:18:54,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=235, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2024-06-03 21:18:54,512 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 20 predicate places. [2024-06-03 21:18:54,512 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 235 flow [2024-06-03 21:18:54,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:18:54,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:18:54,513 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:18:54,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-03 21:18:54,513 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:18:54,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:18:54,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1190347907, now seen corresponding path program 1 times [2024-06-03 21:18:54,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:18:54,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342946382] [2024-06-03 21:18:54,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:18:54,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:18:54,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:18:59,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:18:59,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:18:59,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342946382] [2024-06-03 21:18:59,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342946382] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:18:59,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:18:59,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:18:59,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99984613] [2024-06-03 21:18:59,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:18:59,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:18:59,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:18:59,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:18:59,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:18:59,369 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 21:18:59,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 235 flow. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:18:59,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:18:59,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 21:18:59,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:18:59,682 INFO L124 PetriNetUnfolderBase]: 202/370 cut-off events. [2024-06-03 21:18:59,682 INFO L125 PetriNetUnfolderBase]: For 1741/1741 co-relation queries the response was YES. [2024-06-03 21:18:59,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1407 conditions, 370 events. 202/370 cut-off events. For 1741/1741 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1340 event pairs, 30 based on Foata normal form. 4/372 useless extension candidates. Maximal degree in co-relation 1382. Up to 302 conditions per place. [2024-06-03 21:18:59,685 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 49 selfloop transitions, 12 changer transitions 0/64 dead transitions. [2024-06-03 21:18:59,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 64 transitions, 399 flow [2024-06-03 21:18:59,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:18:59,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:18:59,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 119 transitions. [2024-06-03 21:18:59,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45075757575757575 [2024-06-03 21:18:59,686 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 235 flow. Second operand 8 states and 119 transitions. [2024-06-03 21:18:59,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 64 transitions, 399 flow [2024-06-03 21:18:59,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 64 transitions, 372 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-03 21:18:59,688 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 224 flow [2024-06-03 21:18:59,688 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=224, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2024-06-03 21:18:59,689 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 23 predicate places. [2024-06-03 21:18:59,689 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 224 flow [2024-06-03 21:18:59,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:18:59,689 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:18:59,689 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:18:59,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-03 21:18:59,690 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-03 21:18:59,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:18:59,690 INFO L85 PathProgramCache]: Analyzing trace with hash 438863195, now seen corresponding path program 1 times [2024-06-03 21:18:59,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:18:59,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371489249] [2024-06-03 21:18:59,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:18:59,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:18:59,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:19:06,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:19:06,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:19:06,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371489249] [2024-06-03 21:19:06,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371489249] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:19:06,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:19:06,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:19:06,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036851716] [2024-06-03 21:19:06,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:19:06,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:19:06,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:19:06,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:19:06,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:19:07,059 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 21:19:07,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 224 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:19:07,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:19:07,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 21:19:07,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:19:07,397 INFO L124 PetriNetUnfolderBase]: 205/375 cut-off events. [2024-06-03 21:19:07,397 INFO L125 PetriNetUnfolderBase]: For 2049/2049 co-relation queries the response was YES. [2024-06-03 21:19:07,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1478 conditions, 375 events. 205/375 cut-off events. For 2049/2049 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1361 event pairs, 47 based on Foata normal form. 1/374 useless extension candidates. Maximal degree in co-relation 1453. Up to 340 conditions per place. [2024-06-03 21:19:07,399 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 44 selfloop transitions, 10 changer transitions 0/57 dead transitions. [2024-06-03 21:19:07,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 57 transitions, 376 flow [2024-06-03 21:19:07,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:19:07,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:19:07,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2024-06-03 21:19:07,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39826839826839827 [2024-06-03 21:19:07,401 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 224 flow. Second operand 7 states and 92 transitions. [2024-06-03 21:19:07,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 57 transitions, 376 flow [2024-06-03 21:19:07,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 57 transitions, 344 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-03 21:19:07,403 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 233 flow [2024-06-03 21:19:07,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=233, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2024-06-03 21:19:07,404 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 24 predicate places. [2024-06-03 21:19:07,404 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 233 flow [2024-06-03 21:19:07,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:19:07,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:19:07,404 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:19:07,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-03 21:19:07,405 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-03 21:19:07,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:19:07,405 INFO L85 PathProgramCache]: Analyzing trace with hash -158460479, now seen corresponding path program 1 times [2024-06-03 21:19:07,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:19:07,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438160549] [2024-06-03 21:19:07,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:19:07,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:19:07,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:19:15,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:19:15,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:19:15,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438160549] [2024-06-03 21:19:15,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438160549] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:19:15,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:19:15,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 21:19:15,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121088043] [2024-06-03 21:19:15,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:19:15,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 21:19:15,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:19:15,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 21:19:15,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-03 21:19:15,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-03 21:19:15,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 233 flow. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:19:15,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:19:15,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-03 21:19:15,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:19:15,525 INFO L124 PetriNetUnfolderBase]: 194/366 cut-off events. [2024-06-03 21:19:15,525 INFO L125 PetriNetUnfolderBase]: For 2430/2430 co-relation queries the response was YES. [2024-06-03 21:19:15,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1476 conditions, 366 events. 194/366 cut-off events. For 2430/2430 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1380 event pairs, 46 based on Foata normal form. 1/365 useless extension candidates. Maximal degree in co-relation 1449. Up to 322 conditions per place. [2024-06-03 21:19:15,528 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 40 selfloop transitions, 10 changer transitions 0/56 dead transitions. [2024-06-03 21:19:15,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 56 transitions, 367 flow [2024-06-03 21:19:15,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:19:15,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:19:15,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2024-06-03 21:19:15,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44155844155844154 [2024-06-03 21:19:15,529 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 233 flow. Second operand 7 states and 102 transitions. [2024-06-03 21:19:15,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 56 transitions, 367 flow [2024-06-03 21:19:15,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 56 transitions, 342 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-03 21:19:15,531 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 247 flow [2024-06-03 21:19:15,532 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=247, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2024-06-03 21:19:15,532 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 26 predicate places. [2024-06-03 21:19:15,532 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 247 flow [2024-06-03 21:19:15,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:19:15,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:19:15,533 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:19:15,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-03 21:19:15,533 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-03 21:19:15,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:19:15,533 INFO L85 PathProgramCache]: Analyzing trace with hash -158460727, now seen corresponding path program 2 times [2024-06-03 21:19:15,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:19:15,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095110935] [2024-06-03 21:19:15,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:19:15,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:19:15,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:19:22,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:19:22,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:19:22,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095110935] [2024-06-03 21:19:22,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095110935] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:19:22,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:19:22,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:19:22,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469372353] [2024-06-03 21:19:22,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:19:22,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:19:22,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:19:22,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:19:22,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:19:22,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 21:19:22,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 247 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:19:22,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:19:22,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 21:19:22,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:19:22,895 INFO L124 PetriNetUnfolderBase]: 211/385 cut-off events. [2024-06-03 21:19:22,895 INFO L125 PetriNetUnfolderBase]: For 2879/2879 co-relation queries the response was YES. [2024-06-03 21:19:22,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1631 conditions, 385 events. 211/385 cut-off events. For 2879/2879 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1401 event pairs, 46 based on Foata normal form. 1/384 useless extension candidates. Maximal degree in co-relation 1603. Up to 344 conditions per place. [2024-06-03 21:19:22,898 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 42 selfloop transitions, 13 changer transitions 0/58 dead transitions. [2024-06-03 21:19:22,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 58 transitions, 397 flow [2024-06-03 21:19:22,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:19:22,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:19:22,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2024-06-03 21:19:22,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2024-06-03 21:19:22,900 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 247 flow. Second operand 7 states and 91 transitions. [2024-06-03 21:19:22,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 58 transitions, 397 flow [2024-06-03 21:19:22,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 58 transitions, 374 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-03 21:19:22,902 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 275 flow [2024-06-03 21:19:22,903 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=275, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2024-06-03 21:19:22,903 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 28 predicate places. [2024-06-03 21:19:22,903 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 275 flow [2024-06-03 21:19:22,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:19:22,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:19:22,904 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:19:22,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-03 21:19:22,904 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-03 21:19:22,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:19:22,904 INFO L85 PathProgramCache]: Analyzing trace with hash 77714881, now seen corresponding path program 2 times [2024-06-03 21:19:22,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:19:22,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008447001] [2024-06-03 21:19:22,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:19:22,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:19:22,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:19:31,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:19:31,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:19:31,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008447001] [2024-06-03 21:19:31,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008447001] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:19:31,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:19:31,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 21:19:31,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18355892] [2024-06-03 21:19:31,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:19:31,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 21:19:31,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:19:31,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 21:19:31,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-03 21:19:31,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-03 21:19:31,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 275 flow. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:19:31,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:19:31,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-03 21:19:31,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:19:31,571 INFO L124 PetriNetUnfolderBase]: 200/377 cut-off events. [2024-06-03 21:19:31,572 INFO L125 PetriNetUnfolderBase]: For 3371/3374 co-relation queries the response was YES. [2024-06-03 21:19:31,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1652 conditions, 377 events. 200/377 cut-off events. For 3371/3374 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1420 event pairs, 50 based on Foata normal form. 3/377 useless extension candidates. Maximal degree in co-relation 1623. Up to 324 conditions per place. [2024-06-03 21:19:31,574 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 37 selfloop transitions, 13 changer transitions 0/57 dead transitions. [2024-06-03 21:19:31,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 57 transitions, 405 flow [2024-06-03 21:19:31,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:19:31,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:19:31,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2024-06-03 21:19:31,576 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43722943722943725 [2024-06-03 21:19:31,576 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 275 flow. Second operand 7 states and 101 transitions. [2024-06-03 21:19:31,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 57 transitions, 405 flow [2024-06-03 21:19:31,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 57 transitions, 370 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-03 21:19:31,578 INFO L231 Difference]: Finished difference. Result has 62 places, 50 transitions, 289 flow [2024-06-03 21:19:31,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=289, PETRI_PLACES=62, PETRI_TRANSITIONS=50} [2024-06-03 21:19:31,579 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 30 predicate places. [2024-06-03 21:19:31,579 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 50 transitions, 289 flow [2024-06-03 21:19:31,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:19:31,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:19:31,579 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:19:31,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-03 21:19:31,580 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-03 21:19:31,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:19:31,580 INFO L85 PathProgramCache]: Analyzing trace with hash 77714633, now seen corresponding path program 3 times [2024-06-03 21:19:31,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:19:31,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146627791] [2024-06-03 21:19:31,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:19:31,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:19:31,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:19:37,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:19:37,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:19:37,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146627791] [2024-06-03 21:19:37,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146627791] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:19:37,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:19:37,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:19:37,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953100096] [2024-06-03 21:19:37,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:19:37,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:19:37,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:19:37,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:19:37,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:19:38,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 21:19:38,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 50 transitions, 289 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:19:38,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:19:38,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 21:19:38,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:19:38,318 INFO L124 PetriNetUnfolderBase]: 212/388 cut-off events. [2024-06-03 21:19:38,319 INFO L125 PetriNetUnfolderBase]: For 3810/3813 co-relation queries the response was YES. [2024-06-03 21:19:38,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1765 conditions, 388 events. 212/388 cut-off events. For 3810/3813 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1430 event pairs, 54 based on Foata normal form. 1/386 useless extension candidates. Maximal degree in co-relation 1735. Up to 337 conditions per place. [2024-06-03 21:19:38,321 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 39 selfloop transitions, 17 changer transitions 0/59 dead transitions. [2024-06-03 21:19:38,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 59 transitions, 437 flow [2024-06-03 21:19:38,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:19:38,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:19:38,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2024-06-03 21:19:38,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38961038961038963 [2024-06-03 21:19:38,323 INFO L175 Difference]: Start difference. First operand has 62 places, 50 transitions, 289 flow. Second operand 7 states and 90 transitions. [2024-06-03 21:19:38,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 59 transitions, 437 flow [2024-06-03 21:19:38,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 59 transitions, 404 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-03 21:19:38,326 INFO L231 Difference]: Finished difference. Result has 64 places, 52 transitions, 319 flow [2024-06-03 21:19:38,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=319, PETRI_PLACES=64, PETRI_TRANSITIONS=52} [2024-06-03 21:19:38,326 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 32 predicate places. [2024-06-03 21:19:38,326 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 52 transitions, 319 flow [2024-06-03 21:19:38,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:19:38,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:19:38,327 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:19:38,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-03 21:19:38,327 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-03 21:19:38,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:19:38,328 INFO L85 PathProgramCache]: Analyzing trace with hash 77723251, now seen corresponding path program 3 times [2024-06-03 21:19:38,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:19:38,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312543548] [2024-06-03 21:19:38,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:19:38,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:19:38,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:19:46,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-03 21:19:46,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:19:46,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312543548] [2024-06-03 21:19:46,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312543548] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:19:46,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:19:46,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 21:19:46,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529251721] [2024-06-03 21:19:46,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:19:46,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 21:19:46,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:19:46,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 21:19:46,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-03 21:19:46,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-03 21:19:46,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 319 flow. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:19:46,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:19:46,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-03 21:19:46,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:19:47,152 INFO L124 PetriNetUnfolderBase]: 196/371 cut-off events. [2024-06-03 21:19:47,152 INFO L125 PetriNetUnfolderBase]: For 4146/4149 co-relation queries the response was YES. [2024-06-03 21:19:47,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1719 conditions, 371 events. 196/371 cut-off events. For 4146/4149 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1408 event pairs, 50 based on Foata normal form. 3/371 useless extension candidates. Maximal degree in co-relation 1688. Up to 310 conditions per place. [2024-06-03 21:19:47,155 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 37 selfloop transitions, 18 changer transitions 0/63 dead transitions. [2024-06-03 21:19:47,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 63 transitions, 473 flow [2024-06-03 21:19:47,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 21:19:47,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 21:19:47,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2024-06-03 21:19:47,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44155844155844154 [2024-06-03 21:19:47,156 INFO L175 Difference]: Start difference. First operand has 64 places, 52 transitions, 319 flow. Second operand 7 states and 102 transitions. [2024-06-03 21:19:47,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 63 transitions, 473 flow [2024-06-03 21:19:47,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 63 transitions, 426 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-03 21:19:47,159 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 356 flow [2024-06-03 21:19:47,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=356, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2024-06-03 21:19:47,160 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 35 predicate places. [2024-06-03 21:19:47,160 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 356 flow [2024-06-03 21:19:47,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:19:47,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:19:47,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:19:47,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-03 21:19:47,161 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-03 21:19:47,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:19:47,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1092068992, now seen corresponding path program 1 times [2024-06-03 21:19:47,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:19:47,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773422044] [2024-06-03 21:19:47,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:19:47,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:19:47,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:19:54,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:19:54,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:19:54,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773422044] [2024-06-03 21:19:54,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773422044] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:19:54,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:19:54,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:19:54,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421106174] [2024-06-03 21:19:54,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:19:54,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:19:54,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:19:54,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:19:54,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:19:54,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 21:19:54,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 356 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:19:54,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:19:54,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 21:19:54,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:19:55,319 INFO L124 PetriNetUnfolderBase]: 236/434 cut-off events. [2024-06-03 21:19:55,319 INFO L125 PetriNetUnfolderBase]: For 5069/5069 co-relation queries the response was YES. [2024-06-03 21:19:55,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2060 conditions, 434 events. 236/434 cut-off events. For 5069/5069 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1666 event pairs, 46 based on Foata normal form. 2/434 useless extension candidates. Maximal degree in co-relation 2027. Up to 363 conditions per place. [2024-06-03 21:19:55,322 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 61 selfloop transitions, 20 changer transitions 0/84 dead transitions. [2024-06-03 21:19:55,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 84 transitions, 640 flow [2024-06-03 21:19:55,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:19:55,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:19:55,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-03 21:19:55,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2024-06-03 21:19:55,324 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 356 flow. Second operand 9 states and 117 transitions. [2024-06-03 21:19:55,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 84 transitions, 640 flow [2024-06-03 21:19:55,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 84 transitions, 610 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-03 21:19:55,330 INFO L231 Difference]: Finished difference. Result has 76 places, 68 transitions, 470 flow [2024-06-03 21:19:55,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=470, PETRI_PLACES=76, PETRI_TRANSITIONS=68} [2024-06-03 21:19:55,331 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 44 predicate places. [2024-06-03 21:19:55,331 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 68 transitions, 470 flow [2024-06-03 21:19:55,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:19:55,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:19:55,331 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:19:55,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-03 21:19:55,332 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-03 21:19:55,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:19:55,332 INFO L85 PathProgramCache]: Analyzing trace with hash -623028352, now seen corresponding path program 2 times [2024-06-03 21:19:55,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:19:55,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338293215] [2024-06-03 21:19:55,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:19:55,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:19:55,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:20:02,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:20:02,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:20:02,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338293215] [2024-06-03 21:20:02,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338293215] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:20:02,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:20:02,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:20:02,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003270368] [2024-06-03 21:20:02,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:20:02,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:20:02,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:20:02,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:20:02,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:20:02,485 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 21:20:02,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 68 transitions, 470 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:20:02,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:20:02,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 21:20:02,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:20:02,924 INFO L124 PetriNetUnfolderBase]: 242/445 cut-off events. [2024-06-03 21:20:02,924 INFO L125 PetriNetUnfolderBase]: For 5832/5832 co-relation queries the response was YES. [2024-06-03 21:20:02,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2268 conditions, 445 events. 242/445 cut-off events. For 5832/5832 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1717 event pairs, 45 based on Foata normal form. 2/445 useless extension candidates. Maximal degree in co-relation 2230. Up to 365 conditions per place. [2024-06-03 21:20:02,927 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 61 selfloop transitions, 23 changer transitions 0/87 dead transitions. [2024-06-03 21:20:02,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 87 transitions, 714 flow [2024-06-03 21:20:02,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:20:02,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:20:02,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 106 transitions. [2024-06-03 21:20:02,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4015151515151515 [2024-06-03 21:20:02,929 INFO L175 Difference]: Start difference. First operand has 76 places, 68 transitions, 470 flow. Second operand 8 states and 106 transitions. [2024-06-03 21:20:02,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 87 transitions, 714 flow [2024-06-03 21:20:02,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 87 transitions, 681 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-03 21:20:02,935 INFO L231 Difference]: Finished difference. Result has 81 places, 70 transitions, 518 flow [2024-06-03 21:20:02,935 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=518, PETRI_PLACES=81, PETRI_TRANSITIONS=70} [2024-06-03 21:20:02,936 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 49 predicate places. [2024-06-03 21:20:02,936 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 70 transitions, 518 flow [2024-06-03 21:20:02,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:20:02,936 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:20:02,936 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:20:02,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-03 21:20:02,937 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-03 21:20:02,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:20:02,937 INFO L85 PathProgramCache]: Analyzing trace with hash -622878622, now seen corresponding path program 3 times [2024-06-03 21:20:02,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:20:02,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153024476] [2024-06-03 21:20:02,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:20:02,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:20:02,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:20:09,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:20:09,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:20:09,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153024476] [2024-06-03 21:20:09,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153024476] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:20:09,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:20:09,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:20:09,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369587988] [2024-06-03 21:20:09,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:20:09,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:20:09,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:20:09,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:20:09,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:20:09,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 21:20:09,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 70 transitions, 518 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:20:10,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:20:10,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 21:20:10,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:20:10,420 INFO L124 PetriNetUnfolderBase]: 248/458 cut-off events. [2024-06-03 21:20:10,420 INFO L125 PetriNetUnfolderBase]: For 6664/6664 co-relation queries the response was YES. [2024-06-03 21:20:10,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2415 conditions, 458 events. 248/458 cut-off events. For 6664/6664 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1810 event pairs, 48 based on Foata normal form. 2/458 useless extension candidates. Maximal degree in co-relation 2376. Up to 362 conditions per place. [2024-06-03 21:20:10,423 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 59 selfloop transitions, 25 changer transitions 0/87 dead transitions. [2024-06-03 21:20:10,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 87 transitions, 758 flow [2024-06-03 21:20:10,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:20:10,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:20:10,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 106 transitions. [2024-06-03 21:20:10,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4015151515151515 [2024-06-03 21:20:10,425 INFO L175 Difference]: Start difference. First operand has 81 places, 70 transitions, 518 flow. Second operand 8 states and 106 transitions. [2024-06-03 21:20:10,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 87 transitions, 758 flow [2024-06-03 21:20:10,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 87 transitions, 695 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-03 21:20:10,431 INFO L231 Difference]: Finished difference. Result has 83 places, 72 transitions, 540 flow [2024-06-03 21:20:10,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=540, PETRI_PLACES=83, PETRI_TRANSITIONS=72} [2024-06-03 21:20:10,432 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 51 predicate places. [2024-06-03 21:20:10,432 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 72 transitions, 540 flow [2024-06-03 21:20:10,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:20:10,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:20:10,433 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:20:10,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-03 21:20:10,433 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-03 21:20:10,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:20:10,433 INFO L85 PathProgramCache]: Analyzing trace with hash -622878405, now seen corresponding path program 1 times [2024-06-03 21:20:10,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:20:10,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987098678] [2024-06-03 21:20:10,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:20:10,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:20:10,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:20:19,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:20:19,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:20:19,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987098678] [2024-06-03 21:20:19,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987098678] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:20:19,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:20:19,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:20:19,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399180053] [2024-06-03 21:20:19,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:20:19,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:20:19,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:20:19,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:20:19,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:20:19,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 21:20:19,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 72 transitions, 540 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:20:19,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:20:19,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 21:20:19,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:20:19,497 INFO L124 PetriNetUnfolderBase]: 251/462 cut-off events. [2024-06-03 21:20:19,497 INFO L125 PetriNetUnfolderBase]: For 6524/6524 co-relation queries the response was YES. [2024-06-03 21:20:19,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2418 conditions, 462 events. 251/462 cut-off events. For 6524/6524 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1821 event pairs, 44 based on Foata normal form. 1/461 useless extension candidates. Maximal degree in co-relation 2378. Up to 403 conditions per place. [2024-06-03 21:20:19,509 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 68 selfloop transitions, 17 changer transitions 0/88 dead transitions. [2024-06-03 21:20:19,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 88 transitions, 772 flow [2024-06-03 21:20:19,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:20:19,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:20:19,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2024-06-03 21:20:19,512 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2024-06-03 21:20:19,512 INFO L175 Difference]: Start difference. First operand has 83 places, 72 transitions, 540 flow. Second operand 8 states and 102 transitions. [2024-06-03 21:20:19,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 88 transitions, 772 flow [2024-06-03 21:20:19,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 88 transitions, 707 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-03 21:20:19,517 INFO L231 Difference]: Finished difference. Result has 85 places, 74 transitions, 536 flow [2024-06-03 21:20:19,517 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=536, PETRI_PLACES=85, PETRI_TRANSITIONS=74} [2024-06-03 21:20:19,518 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 53 predicate places. [2024-06-03 21:20:19,518 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 74 transitions, 536 flow [2024-06-03 21:20:19,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:20:19,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:20:19,518 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:20:19,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-03 21:20:19,519 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-03 21:20:19,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:20:19,519 INFO L85 PathProgramCache]: Analyzing trace with hash -617314215, now seen corresponding path program 2 times [2024-06-03 21:20:19,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:20:19,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661689418] [2024-06-03 21:20:19,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:20:19,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:20:19,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:20:28,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:20:28,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:20:28,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661689418] [2024-06-03 21:20:28,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661689418] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:20:28,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:20:28,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:20:28,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987103989] [2024-06-03 21:20:28,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:20:28,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:20:28,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:20:28,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:20:28,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:20:29,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 21:20:29,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 74 transitions, 536 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:20:29,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:20:29,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 21:20:29,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:20:29,350 INFO L124 PetriNetUnfolderBase]: 254/467 cut-off events. [2024-06-03 21:20:29,350 INFO L125 PetriNetUnfolderBase]: For 7015/7015 co-relation queries the response was YES. [2024-06-03 21:20:29,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2466 conditions, 467 events. 254/467 cut-off events. For 7015/7015 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1848 event pairs, 46 based on Foata normal form. 1/466 useless extension candidates. Maximal degree in co-relation 2425. Up to 400 conditions per place. [2024-06-03 21:20:29,354 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 65 selfloop transitions, 19 changer transitions 0/87 dead transitions. [2024-06-03 21:20:29,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 87 transitions, 758 flow [2024-06-03 21:20:29,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:20:29,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:20:29,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2024-06-03 21:20:29,355 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38257575757575757 [2024-06-03 21:20:29,355 INFO L175 Difference]: Start difference. First operand has 85 places, 74 transitions, 536 flow. Second operand 8 states and 101 transitions. [2024-06-03 21:20:29,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 87 transitions, 758 flow [2024-06-03 21:20:29,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 87 transitions, 713 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-03 21:20:29,360 INFO L231 Difference]: Finished difference. Result has 87 places, 76 transitions, 560 flow [2024-06-03 21:20:29,360 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=560, PETRI_PLACES=87, PETRI_TRANSITIONS=76} [2024-06-03 21:20:29,360 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 55 predicate places. [2024-06-03 21:20:29,361 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 76 transitions, 560 flow [2024-06-03 21:20:29,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:20:29,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:20:29,361 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:20:29,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-03 21:20:29,361 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-03 21:20:29,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:20:29,362 INFO L85 PathProgramCache]: Analyzing trace with hash -617314432, now seen corresponding path program 4 times [2024-06-03 21:20:29,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:20:29,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975938741] [2024-06-03 21:20:29,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:20:29,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:20:29,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:20:36,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-03 21:20:36,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:20:36,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975938741] [2024-06-03 21:20:36,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975938741] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:20:36,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:20:36,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:20:36,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849695888] [2024-06-03 21:20:36,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:20:36,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:20:36,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:20:36,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:20:36,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:20:36,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 21:20:36,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 76 transitions, 560 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:20:36,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:20:36,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 21:20:36,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:20:36,922 INFO L124 PetriNetUnfolderBase]: 260/480 cut-off events. [2024-06-03 21:20:36,923 INFO L125 PetriNetUnfolderBase]: For 8092/8092 co-relation queries the response was YES. [2024-06-03 21:20:36,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2587 conditions, 480 events. 260/480 cut-off events. For 8092/8092 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1917 event pairs, 51 based on Foata normal form. 2/480 useless extension candidates. Maximal degree in co-relation 2545. Up to 368 conditions per place. [2024-06-03 21:20:36,926 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 59 selfloop transitions, 28 changer transitions 0/90 dead transitions. [2024-06-03 21:20:36,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 90 transitions, 794 flow [2024-06-03 21:20:36,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:20:36,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:20:36,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2024-06-03 21:20:36,928 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3977272727272727 [2024-06-03 21:20:36,928 INFO L175 Difference]: Start difference. First operand has 87 places, 76 transitions, 560 flow. Second operand 8 states and 105 transitions. [2024-06-03 21:20:36,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 90 transitions, 794 flow [2024-06-03 21:20:36,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 90 transitions, 741 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-03 21:20:36,934 INFO L231 Difference]: Finished difference. Result has 89 places, 78 transitions, 598 flow [2024-06-03 21:20:36,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=598, PETRI_PLACES=89, PETRI_TRANSITIONS=78} [2024-06-03 21:20:36,934 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 57 predicate places. [2024-06-03 21:20:36,934 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 78 transitions, 598 flow [2024-06-03 21:20:36,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:20:36,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:20:36,935 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:20:36,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-03 21:20:36,935 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-03 21:20:36,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:20:36,936 INFO L85 PathProgramCache]: Analyzing trace with hash -617306775, now seen corresponding path program 3 times [2024-06-03 21:20:36,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:20:36,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864210430] [2024-06-03 21:20:36,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:20:36,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:20:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:20:46,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-03 21:20:46,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:20:46,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864210430] [2024-06-03 21:20:46,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864210430] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:20:46,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:20:46,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:20:46,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940016064] [2024-06-03 21:20:46,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:20:46,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:20:46,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:20:46,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:20:46,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:20:47,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 21:20:47,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 78 transitions, 598 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:20:47,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:20:47,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 21:20:47,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:20:47,332 INFO L124 PetriNetUnfolderBase]: 263/484 cut-off events. [2024-06-03 21:20:47,332 INFO L125 PetriNetUnfolderBase]: For 8744/8744 co-relation queries the response was YES. [2024-06-03 21:20:47,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2698 conditions, 484 events. 263/484 cut-off events. For 8744/8744 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1930 event pairs, 46 based on Foata normal form. 1/483 useless extension candidates. Maximal degree in co-relation 2655. Up to 406 conditions per place. [2024-06-03 21:20:47,335 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 64 selfloop transitions, 24 changer transitions 0/91 dead transitions. [2024-06-03 21:20:47,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 91 transitions, 832 flow [2024-06-03 21:20:47,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:20:47,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:20:47,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2024-06-03 21:20:47,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2024-06-03 21:20:47,337 INFO L175 Difference]: Start difference. First operand has 89 places, 78 transitions, 598 flow. Second operand 8 states and 102 transitions. [2024-06-03 21:20:47,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 91 transitions, 832 flow [2024-06-03 21:20:47,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 91 transitions, 757 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-03 21:20:47,343 INFO L231 Difference]: Finished difference. Result has 91 places, 80 transitions, 606 flow [2024-06-03 21:20:47,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=606, PETRI_PLACES=91, PETRI_TRANSITIONS=80} [2024-06-03 21:20:47,344 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 59 predicate places. [2024-06-03 21:20:47,344 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 80 transitions, 606 flow [2024-06-03 21:20:47,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:20:47,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:20:47,344 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:20:47,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-03 21:20:47,345 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-03 21:20:47,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:20:47,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1168317022, now seen corresponding path program 1 times [2024-06-03 21:20:47,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:20:47,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31272642] [2024-06-03 21:20:47,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:20:47,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:20:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:20:56,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:20:56,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:20:56,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31272642] [2024-06-03 21:20:56,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31272642] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:20:56,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:20:56,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:20:56,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845720254] [2024-06-03 21:20:56,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:20:56,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:20:56,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:20:56,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:20:56,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:20:56,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 21:20:56,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 80 transitions, 606 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:20:56,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:20:56,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 21:20:56,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:20:56,938 INFO L124 PetriNetUnfolderBase]: 250/472 cut-off events. [2024-06-03 21:20:56,938 INFO L125 PetriNetUnfolderBase]: For 9655/9659 co-relation queries the response was YES. [2024-06-03 21:20:56,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2617 conditions, 472 events. 250/472 cut-off events. For 9655/9659 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1961 event pairs, 43 based on Foata normal form. 6/476 useless extension candidates. Maximal degree in co-relation 2573. Up to 396 conditions per place. [2024-06-03 21:20:56,942 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 68 selfloop transitions, 14 changer transitions 0/94 dead transitions. [2024-06-03 21:20:56,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 94 transitions, 822 flow [2024-06-03 21:20:56,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:20:56,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:20:56,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2024-06-03 21:20:56,944 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4053030303030303 [2024-06-03 21:20:56,944 INFO L175 Difference]: Start difference. First operand has 91 places, 80 transitions, 606 flow. Second operand 8 states and 107 transitions. [2024-06-03 21:20:56,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 94 transitions, 822 flow [2024-06-03 21:20:56,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 94 transitions, 755 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-03 21:20:56,951 INFO L231 Difference]: Finished difference. Result has 93 places, 82 transitions, 594 flow [2024-06-03 21:20:56,951 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=594, PETRI_PLACES=93, PETRI_TRANSITIONS=82} [2024-06-03 21:20:56,951 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 61 predicate places. [2024-06-03 21:20:56,951 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 82 transitions, 594 flow [2024-06-03 21:20:56,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:20:56,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:20:56,952 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:20:56,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-03 21:20:56,952 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-03 21:20:56,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:20:56,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1876608158, now seen corresponding path program 2 times [2024-06-03 21:20:56,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:20:56,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836182071] [2024-06-03 21:20:56,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:20:56,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:20:57,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:21:06,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:21:06,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:21:06,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836182071] [2024-06-03 21:21:06,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836182071] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:21:06,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:21:06,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:21:06,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707960574] [2024-06-03 21:21:06,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:21:06,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:21:06,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:21:06,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:21:06,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:21:06,780 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 21:21:06,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 82 transitions, 594 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:21:06,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:21:06,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 21:21:06,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:21:07,066 INFO L124 PetriNetUnfolderBase]: 258/486 cut-off events. [2024-06-03 21:21:07,067 INFO L125 PetriNetUnfolderBase]: For 10446/10453 co-relation queries the response was YES. [2024-06-03 21:21:07,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2736 conditions, 486 events. 258/486 cut-off events. For 10446/10453 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2007 event pairs, 45 based on Foata normal form. 7/489 useless extension candidates. Maximal degree in co-relation 2691. Up to 383 conditions per place. [2024-06-03 21:21:07,070 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 64 selfloop transitions, 25 changer transitions 0/101 dead transitions. [2024-06-03 21:21:07,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 101 transitions, 971 flow [2024-06-03 21:21:07,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:21:07,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:21:07,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 110 transitions. [2024-06-03 21:21:07,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-03 21:21:07,073 INFO L175 Difference]: Start difference. First operand has 93 places, 82 transitions, 594 flow. Second operand 8 states and 110 transitions. [2024-06-03 21:21:07,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 101 transitions, 971 flow [2024-06-03 21:21:07,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 101 transitions, 919 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-03 21:21:07,080 INFO L231 Difference]: Finished difference. Result has 96 places, 90 transitions, 692 flow [2024-06-03 21:21:07,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=692, PETRI_PLACES=96, PETRI_TRANSITIONS=90} [2024-06-03 21:21:07,081 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 64 predicate places. [2024-06-03 21:21:07,081 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 90 transitions, 692 flow [2024-06-03 21:21:07,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:21:07,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:21:07,081 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:21:07,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-03 21:21:07,082 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-03 21:21:07,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:21:07,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1434014023, now seen corresponding path program 4 times [2024-06-03 21:21:07,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:21:07,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990422725] [2024-06-03 21:21:07,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:21:07,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:21:07,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:21:16,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:21:16,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:21:16,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990422725] [2024-06-03 21:21:16,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990422725] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:21:16,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:21:16,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:21:16,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749506208] [2024-06-03 21:21:16,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:21:16,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:21:16,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:21:16,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:21:16,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:21:16,137 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 21:21:16,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 90 transitions, 692 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:21:16,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:21:16,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 21:21:16,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:21:16,417 INFO L124 PetriNetUnfolderBase]: 280/513 cut-off events. [2024-06-03 21:21:16,418 INFO L125 PetriNetUnfolderBase]: For 11259/11262 co-relation queries the response was YES. [2024-06-03 21:21:16,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3007 conditions, 513 events. 280/513 cut-off events. For 11259/11262 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2072 event pairs, 51 based on Foata normal form. 1/509 useless extension candidates. Maximal degree in co-relation 2960. Up to 407 conditions per place. [2024-06-03 21:21:16,422 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 66 selfloop transitions, 35 changer transitions 0/104 dead transitions. [2024-06-03 21:21:16,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 104 transitions, 1030 flow [2024-06-03 21:21:16,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:21:16,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:21:16,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-06-03 21:21:16,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39015151515151514 [2024-06-03 21:21:16,424 INFO L175 Difference]: Start difference. First operand has 96 places, 90 transitions, 692 flow. Second operand 8 states and 103 transitions. [2024-06-03 21:21:16,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 104 transitions, 1030 flow [2024-06-03 21:21:16,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 104 transitions, 998 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-03 21:21:16,434 INFO L231 Difference]: Finished difference. Result has 101 places, 94 transitions, 799 flow [2024-06-03 21:21:16,434 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=799, PETRI_PLACES=101, PETRI_TRANSITIONS=94} [2024-06-03 21:21:16,434 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 69 predicate places. [2024-06-03 21:21:16,434 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 94 transitions, 799 flow [2024-06-03 21:21:16,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:21:16,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:21:16,435 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:21:16,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-03 21:21:16,435 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-03 21:21:16,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:21:16,435 INFO L85 PathProgramCache]: Analyzing trace with hash 63482011, now seen corresponding path program 5 times [2024-06-03 21:21:16,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:21:16,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288314534] [2024-06-03 21:21:16,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:21:16,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:21:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:21:25,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-03 21:21:25,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:21:25,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288314534] [2024-06-03 21:21:25,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288314534] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:21:25,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:21:25,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:21:25,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306416499] [2024-06-03 21:21:25,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:21:25,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:21:25,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:21:25,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:21:25,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:21:25,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 21:21:25,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 94 transitions, 799 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:21:25,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:21:25,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 21:21:25,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:21:25,449 INFO L124 PetriNetUnfolderBase]: 283/518 cut-off events. [2024-06-03 21:21:25,449 INFO L125 PetriNetUnfolderBase]: For 12315/12318 co-relation queries the response was YES. [2024-06-03 21:21:25,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3166 conditions, 518 events. 283/518 cut-off events. For 12315/12318 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2095 event pairs, 51 based on Foata normal form. 1/514 useless extension candidates. Maximal degree in co-relation 3117. Up to 432 conditions per place. [2024-06-03 21:21:25,459 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 77 selfloop transitions, 26 changer transitions 0/106 dead transitions. [2024-06-03 21:21:25,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 106 transitions, 1117 flow [2024-06-03 21:21:25,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:21:25,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:21:25,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-06-03 21:21:25,461 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39015151515151514 [2024-06-03 21:21:25,461 INFO L175 Difference]: Start difference. First operand has 101 places, 94 transitions, 799 flow. Second operand 8 states and 103 transitions. [2024-06-03 21:21:25,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 106 transitions, 1117 flow [2024-06-03 21:21:25,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 106 transitions, 1060 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-06-03 21:21:25,471 INFO L231 Difference]: Finished difference. Result has 105 places, 96 transitions, 833 flow [2024-06-03 21:21:25,472 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=833, PETRI_PLACES=105, PETRI_TRANSITIONS=96} [2024-06-03 21:21:25,472 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 73 predicate places. [2024-06-03 21:21:25,472 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 96 transitions, 833 flow [2024-06-03 21:21:25,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:21:25,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:21:25,473 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:21:25,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-03 21:21:25,473 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-03 21:21:25,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:21:25,473 INFO L85 PathProgramCache]: Analyzing trace with hash 63474571, now seen corresponding path program 6 times [2024-06-03 21:21:25,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:21:25,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13433147] [2024-06-03 21:21:25,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:21:25,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:21:25,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:21:33,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:21:33,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:21:33,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13433147] [2024-06-03 21:21:33,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13433147] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:21:33,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:21:33,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:21:33,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402406235] [2024-06-03 21:21:33,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:21:33,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:21:33,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:21:33,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:21:33,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:21:33,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 21:21:33,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 96 transitions, 833 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:21:33,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:21:33,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 21:21:33,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:21:33,768 INFO L124 PetriNetUnfolderBase]: 281/515 cut-off events. [2024-06-03 21:21:33,768 INFO L125 PetriNetUnfolderBase]: For 12719/12722 co-relation queries the response was YES. [2024-06-03 21:21:33,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3164 conditions, 515 events. 281/515 cut-off events. For 12719/12722 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2075 event pairs, 50 based on Foata normal form. 1/511 useless extension candidates. Maximal degree in co-relation 3113. Up to 436 conditions per place. [2024-06-03 21:21:33,772 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 79 selfloop transitions, 23 changer transitions 0/105 dead transitions. [2024-06-03 21:21:33,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 105 transitions, 1063 flow [2024-06-03 21:21:33,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:21:33,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:21:33,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2024-06-03 21:21:33,774 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3787878787878788 [2024-06-03 21:21:33,774 INFO L175 Difference]: Start difference. First operand has 105 places, 96 transitions, 833 flow. Second operand 8 states and 100 transitions. [2024-06-03 21:21:33,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 105 transitions, 1063 flow [2024-06-03 21:21:33,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 105 transitions, 952 flow, removed 24 selfloop flow, removed 6 redundant places. [2024-06-03 21:21:33,785 INFO L231 Difference]: Finished difference. Result has 107 places, 96 transitions, 773 flow [2024-06-03 21:21:33,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=773, PETRI_PLACES=107, PETRI_TRANSITIONS=96} [2024-06-03 21:21:33,791 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 75 predicate places. [2024-06-03 21:21:33,791 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 96 transitions, 773 flow [2024-06-03 21:21:33,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:21:33,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:21:33,791 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:21:33,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-03 21:21:33,792 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-03 21:21:33,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:21:33,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1876281728, now seen corresponding path program 3 times [2024-06-03 21:21:33,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:21:33,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423722383] [2024-06-03 21:21:33,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:21:33,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:21:33,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:21:43,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-03 21:21:43,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:21:43,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423722383] [2024-06-03 21:21:43,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423722383] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:21:43,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:21:43,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:21:43,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967624789] [2024-06-03 21:21:43,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:21:43,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:21:43,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:21:43,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:21:43,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:21:43,706 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 21:21:43,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 96 transitions, 773 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:21:43,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:21:43,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 21:21:43,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:21:44,007 INFO L124 PetriNetUnfolderBase]: 260/488 cut-off events. [2024-06-03 21:21:44,007 INFO L125 PetriNetUnfolderBase]: For 13184/13189 co-relation queries the response was YES. [2024-06-03 21:21:44,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2933 conditions, 488 events. 260/488 cut-off events. For 13184/13189 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2022 event pairs, 46 based on Foata normal form. 4/488 useless extension candidates. Maximal degree in co-relation 2881. Up to 423 conditions per place. [2024-06-03 21:21:44,011 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 78 selfloop transitions, 12 changer transitions 0/105 dead transitions. [2024-06-03 21:21:44,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 105 transitions, 978 flow [2024-06-03 21:21:44,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:21:44,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:21:44,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-06-03 21:21:44,013 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39015151515151514 [2024-06-03 21:21:44,013 INFO L175 Difference]: Start difference. First operand has 107 places, 96 transitions, 773 flow. Second operand 8 states and 103 transitions. [2024-06-03 21:21:44,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 105 transitions, 978 flow [2024-06-03 21:21:44,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 105 transitions, 901 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-03 21:21:44,025 INFO L231 Difference]: Finished difference. Result has 108 places, 97 transitions, 735 flow [2024-06-03 21:21:44,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=735, PETRI_PLACES=108, PETRI_TRANSITIONS=97} [2024-06-03 21:21:44,027 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 76 predicate places. [2024-06-03 21:21:44,028 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 97 transitions, 735 flow [2024-06-03 21:21:44,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:21:44,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:21:44,028 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:21:44,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-03 21:21:44,028 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-03 21:21:44,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:21:44,029 INFO L85 PathProgramCache]: Analyzing trace with hash 926519342, now seen corresponding path program 4 times [2024-06-03 21:21:44,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:21:44,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178985270] [2024-06-03 21:21:44,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:21:44,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:21:44,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:21:54,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:21:54,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:21:54,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178985270] [2024-06-03 21:21:54,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178985270] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:21:54,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:21:54,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:21:54,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54574851] [2024-06-03 21:21:54,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:21:54,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:21:54,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:21:54,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:21:54,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:21:54,526 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 21:21:54,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 97 transitions, 735 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:21:54,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:21:54,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 21:21:54,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:21:54,805 INFO L124 PetriNetUnfolderBase]: 258/487 cut-off events. [2024-06-03 21:21:54,806 INFO L125 PetriNetUnfolderBase]: For 13727/13734 co-relation queries the response was YES. [2024-06-03 21:21:54,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2876 conditions, 487 events. 258/487 cut-off events. For 13727/13734 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2019 event pairs, 45 based on Foata normal form. 7/490 useless extension candidates. Maximal degree in co-relation 2823. Up to 404 conditions per place. [2024-06-03 21:21:54,810 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 75 selfloop transitions, 17 changer transitions 0/107 dead transitions. [2024-06-03 21:21:54,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 107 transitions, 952 flow [2024-06-03 21:21:54,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:21:54,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:21:54,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2024-06-03 21:21:54,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3977272727272727 [2024-06-03 21:21:54,811 INFO L175 Difference]: Start difference. First operand has 108 places, 97 transitions, 735 flow. Second operand 8 states and 105 transitions. [2024-06-03 21:21:54,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 107 transitions, 952 flow [2024-06-03 21:21:54,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 107 transitions, 897 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-03 21:21:54,823 INFO L231 Difference]: Finished difference. Result has 109 places, 98 transitions, 728 flow [2024-06-03 21:21:54,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=728, PETRI_PLACES=109, PETRI_TRANSITIONS=98} [2024-06-03 21:21:54,823 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 77 predicate places. [2024-06-03 21:21:54,823 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 98 transitions, 728 flow [2024-06-03 21:21:54,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:21:54,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:21:54,824 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:21:54,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-03 21:21:54,824 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-03 21:21:54,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:21:54,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1885812864, now seen corresponding path program 5 times [2024-06-03 21:21:54,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:21:54,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988764518] [2024-06-03 21:21:54,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:21:54,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:21:54,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:22:02,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:22:02,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:22:02,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988764518] [2024-06-03 21:22:02,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988764518] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:22:02,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:22:02,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:22:02,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478804232] [2024-06-03 21:22:02,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:22:02,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:22:02,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:22:02,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:22:02,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:22:02,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 21:22:02,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 98 transitions, 728 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:22:02,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:22:02,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 21:22:02,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:22:02,432 INFO L124 PetriNetUnfolderBase]: 278/513 cut-off events. [2024-06-03 21:22:02,432 INFO L125 PetriNetUnfolderBase]: For 14467/14470 co-relation queries the response was YES. [2024-06-03 21:22:02,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3045 conditions, 513 events. 278/513 cut-off events. For 14467/14470 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2088 event pairs, 58 based on Foata normal form. 2/510 useless extension candidates. Maximal degree in co-relation 2992. Up to 384 conditions per place. [2024-06-03 21:22:02,436 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 74 selfloop transitions, 33 changer transitions 0/110 dead transitions. [2024-06-03 21:22:02,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 110 transitions, 1000 flow [2024-06-03 21:22:02,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:22:02,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:22:02,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2024-06-03 21:22:02,437 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2024-06-03 21:22:02,438 INFO L175 Difference]: Start difference. First operand has 109 places, 98 transitions, 728 flow. Second operand 8 states and 104 transitions. [2024-06-03 21:22:02,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 110 transitions, 1000 flow [2024-06-03 21:22:02,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 110 transitions, 961 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-03 21:22:02,478 INFO L231 Difference]: Finished difference. Result has 111 places, 100 transitions, 794 flow [2024-06-03 21:22:02,479 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=794, PETRI_PLACES=111, PETRI_TRANSITIONS=100} [2024-06-03 21:22:02,479 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 79 predicate places. [2024-06-03 21:22:02,479 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 100 transitions, 794 flow [2024-06-03 21:22:02,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:22:02,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:22:02,479 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:22:02,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-03 21:22:02,480 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-03 21:22:02,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:22:02,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1876269824, now seen corresponding path program 1 times [2024-06-03 21:22:02,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:22:02,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667103429] [2024-06-03 21:22:02,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:22:02,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:22:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:22:13,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:22:13,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:22:13,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667103429] [2024-06-03 21:22:13,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667103429] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:22:13,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:22:13,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:22:13,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611337236] [2024-06-03 21:22:13,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:22:13,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:22:13,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:22:13,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:22:13,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:22:13,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 21:22:13,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 100 transitions, 794 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:22:13,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:22:13,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 21:22:13,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:22:14,184 INFO L124 PetriNetUnfolderBase]: 257/485 cut-off events. [2024-06-03 21:22:14,185 INFO L125 PetriNetUnfolderBase]: For 14972/14977 co-relation queries the response was YES. [2024-06-03 21:22:14,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2916 conditions, 485 events. 257/485 cut-off events. For 14972/14977 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1997 event pairs, 45 based on Foata normal form. 5/486 useless extension candidates. Maximal degree in co-relation 2862. Up to 411 conditions per place. [2024-06-03 21:22:14,188 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 82 selfloop transitions, 12 changer transitions 0/109 dead transitions. [2024-06-03 21:22:14,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 109 transitions, 1004 flow [2024-06-03 21:22:14,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:22:14,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:22:14,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-06-03 21:22:14,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39015151515151514 [2024-06-03 21:22:14,189 INFO L175 Difference]: Start difference. First operand has 111 places, 100 transitions, 794 flow. Second operand 8 states and 103 transitions. [2024-06-03 21:22:14,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 109 transitions, 1004 flow [2024-06-03 21:22:14,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 109 transitions, 915 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-03 21:22:14,202 INFO L231 Difference]: Finished difference. Result has 113 places, 100 transitions, 733 flow [2024-06-03 21:22:14,202 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=733, PETRI_PLACES=113, PETRI_TRANSITIONS=100} [2024-06-03 21:22:14,202 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 81 predicate places. [2024-06-03 21:22:14,203 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 100 transitions, 733 flow [2024-06-03 21:22:14,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:22:14,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:22:14,203 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:22:14,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-03 21:22:14,203 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-03 21:22:14,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:22:14,204 INFO L85 PathProgramCache]: Analyzing trace with hash -2134128858, now seen corresponding path program 1 times [2024-06-03 21:22:14,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:22:14,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140494929] [2024-06-03 21:22:14,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:22:14,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:22:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:22:22,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:22:22,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:22:22,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140494929] [2024-06-03 21:22:22,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140494929] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:22:22,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:22:22,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:22:22,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634686429] [2024-06-03 21:22:22,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:22:22,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:22:22,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:22:22,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:22:22,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:22:22,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 21:22:22,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 100 transitions, 733 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:22:22,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:22:22,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 21:22:22,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:22:22,864 INFO L124 PetriNetUnfolderBase]: 273/504 cut-off events. [2024-06-03 21:22:22,864 INFO L125 PetriNetUnfolderBase]: For 14345/14345 co-relation queries the response was YES. [2024-06-03 21:22:22,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2960 conditions, 504 events. 273/504 cut-off events. For 14345/14345 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2047 event pairs, 40 based on Foata normal form. 1/503 useless extension candidates. Maximal degree in co-relation 2905. Up to 414 conditions per place. [2024-06-03 21:22:22,867 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 96 selfloop transitions, 23 changer transitions 0/122 dead transitions. [2024-06-03 21:22:22,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 122 transitions, 1067 flow [2024-06-03 21:22:22,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:22:22,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:22:22,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-03 21:22:22,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39730639730639733 [2024-06-03 21:22:22,892 INFO L175 Difference]: Start difference. First operand has 113 places, 100 transitions, 733 flow. Second operand 9 states and 118 transitions. [2024-06-03 21:22:22,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 122 transitions, 1067 flow [2024-06-03 21:22:22,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 122 transitions, 1038 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-03 21:22:22,908 INFO L231 Difference]: Finished difference. Result has 116 places, 102 transitions, 793 flow [2024-06-03 21:22:22,909 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=793, PETRI_PLACES=116, PETRI_TRANSITIONS=102} [2024-06-03 21:22:22,909 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 84 predicate places. [2024-06-03 21:22:22,909 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 102 transitions, 793 flow [2024-06-03 21:22:22,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:22:22,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:22:22,910 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:22:22,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-03 21:22:22,910 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-03 21:22:22,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:22:22,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1963306272, now seen corresponding path program 1 times [2024-06-03 21:22:22,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:22:22,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497764709] [2024-06-03 21:22:22,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:22:22,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:22:22,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:22:31,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:22:31,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:22:31,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497764709] [2024-06-03 21:22:31,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497764709] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:22:31,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:22:31,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:22:31,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000079500] [2024-06-03 21:22:31,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:22:31,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:22:31,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:22:31,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:22:31,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:22:31,495 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 21:22:31,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 102 transitions, 793 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:22:31,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:22:31,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 21:22:31,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:22:31,851 INFO L124 PetriNetUnfolderBase]: 279/514 cut-off events. [2024-06-03 21:22:31,852 INFO L125 PetriNetUnfolderBase]: For 15869/15869 co-relation queries the response was YES. [2024-06-03 21:22:31,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3102 conditions, 514 events. 279/514 cut-off events. For 15869/15869 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2100 event pairs, 39 based on Foata normal form. 2/514 useless extension candidates. Maximal degree in co-relation 3046. Up to 418 conditions per place. [2024-06-03 21:22:31,855 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 94 selfloop transitions, 26 changer transitions 0/123 dead transitions. [2024-06-03 21:22:31,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 123 transitions, 1121 flow [2024-06-03 21:22:31,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:22:31,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:22:31,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-03 21:22:31,856 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2024-06-03 21:22:31,856 INFO L175 Difference]: Start difference. First operand has 116 places, 102 transitions, 793 flow. Second operand 9 states and 117 transitions. [2024-06-03 21:22:31,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 123 transitions, 1121 flow [2024-06-03 21:22:31,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 123 transitions, 1048 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-03 21:22:31,870 INFO L231 Difference]: Finished difference. Result has 118 places, 105 transitions, 817 flow [2024-06-03 21:22:31,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=817, PETRI_PLACES=118, PETRI_TRANSITIONS=105} [2024-06-03 21:22:31,870 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 86 predicate places. [2024-06-03 21:22:31,871 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 105 transitions, 817 flow [2024-06-03 21:22:31,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:22:31,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:22:31,871 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:22:31,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-03 21:22:31,871 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-03 21:22:31,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:22:31,872 INFO L85 PathProgramCache]: Analyzing trace with hash -2129367072, now seen corresponding path program 2 times [2024-06-03 21:22:31,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:22:31,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184810833] [2024-06-03 21:22:31,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:22:31,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:22:31,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:22:39,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:22:39,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:22:39,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184810833] [2024-06-03 21:22:39,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184810833] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:22:39,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:22:39,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:22:39,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333972555] [2024-06-03 21:22:39,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:22:39,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:22:39,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:22:39,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:22:39,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:22:39,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 21:22:39,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 105 transitions, 817 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:22:39,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:22:39,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 21:22:39,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:22:40,080 INFO L124 PetriNetUnfolderBase]: 285/525 cut-off events. [2024-06-03 21:22:40,080 INFO L125 PetriNetUnfolderBase]: For 17206/17206 co-relation queries the response was YES. [2024-06-03 21:22:40,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3240 conditions, 525 events. 285/525 cut-off events. For 17206/17206 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2158 event pairs, 42 based on Foata normal form. 2/525 useless extension candidates. Maximal degree in co-relation 3183. Up to 419 conditions per place. [2024-06-03 21:22:40,083 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 93 selfloop transitions, 28 changer transitions 0/124 dead transitions. [2024-06-03 21:22:40,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 124 transitions, 1149 flow [2024-06-03 21:22:40,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:22:40,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:22:40,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-03 21:22:40,084 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2024-06-03 21:22:40,084 INFO L175 Difference]: Start difference. First operand has 118 places, 105 transitions, 817 flow. Second operand 9 states and 117 transitions. [2024-06-03 21:22:40,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 124 transitions, 1149 flow [2024-06-03 21:22:40,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 124 transitions, 1076 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-03 21:22:40,099 INFO L231 Difference]: Finished difference. Result has 120 places, 108 transitions, 850 flow [2024-06-03 21:22:40,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=850, PETRI_PLACES=120, PETRI_TRANSITIONS=108} [2024-06-03 21:22:40,100 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 88 predicate places. [2024-06-03 21:22:40,100 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 108 transitions, 850 flow [2024-06-03 21:22:40,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:22:40,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:22:40,100 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:22:40,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-03 21:22:40,101 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-03 21:22:40,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:22:40,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1851594724, now seen corresponding path program 3 times [2024-06-03 21:22:40,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:22:40,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706517599] [2024-06-03 21:22:40,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:22:40,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:22:40,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:22:49,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:22:49,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:22:49,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706517599] [2024-06-03 21:22:49,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706517599] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:22:49,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:22:49,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:22:49,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611134362] [2024-06-03 21:22:49,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:22:49,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:22:49,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:22:49,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:22:49,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:22:49,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 21:22:49,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 108 transitions, 850 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:22:49,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:22:49,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 21:22:49,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:22:49,710 INFO L124 PetriNetUnfolderBase]: 288/530 cut-off events. [2024-06-03 21:22:49,711 INFO L125 PetriNetUnfolderBase]: For 17880/17880 co-relation queries the response was YES. [2024-06-03 21:22:49,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3331 conditions, 530 events. 288/530 cut-off events. For 17880/17880 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2182 event pairs, 42 based on Foata normal form. 1/529 useless extension candidates. Maximal degree in co-relation 3273. Up to 408 conditions per place. [2024-06-03 21:22:49,715 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 88 selfloop transitions, 34 changer transitions 0/125 dead transitions. [2024-06-03 21:22:49,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 125 transitions, 1168 flow [2024-06-03 21:22:49,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:22:49,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:22:49,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-03 21:22:49,716 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2024-06-03 21:22:49,716 INFO L175 Difference]: Start difference. First operand has 120 places, 108 transitions, 850 flow. Second operand 9 states and 117 transitions. [2024-06-03 21:22:49,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 125 transitions, 1168 flow [2024-06-03 21:22:49,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 125 transitions, 1084 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-03 21:22:49,731 INFO L231 Difference]: Finished difference. Result has 122 places, 110 transitions, 869 flow [2024-06-03 21:22:49,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=869, PETRI_PLACES=122, PETRI_TRANSITIONS=110} [2024-06-03 21:22:49,731 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 90 predicate places. [2024-06-03 21:22:49,731 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 110 transitions, 869 flow [2024-06-03 21:22:49,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:22:49,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:22:49,732 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:22:49,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-03 21:22:49,732 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-03 21:22:49,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:22:49,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1851594972, now seen corresponding path program 1 times [2024-06-03 21:22:49,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:22:49,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153635241] [2024-06-03 21:22:49,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:22:49,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:22:49,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:22:58,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:22:58,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:22:58,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153635241] [2024-06-03 21:22:58,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153635241] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:22:58,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:22:58,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:22:58,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251666617] [2024-06-03 21:22:58,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:22:58,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:22:58,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:22:58,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:22:58,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:22:58,620 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 21:22:58,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 110 transitions, 869 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:22:58,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:22:58,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 21:22:58,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:22:58,890 INFO L124 PetriNetUnfolderBase]: 294/539 cut-off events. [2024-06-03 21:22:58,890 INFO L125 PetriNetUnfolderBase]: For 19538/19538 co-relation queries the response was YES. [2024-06-03 21:22:58,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3431 conditions, 539 events. 294/539 cut-off events. For 19538/19538 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2228 event pairs, 38 based on Foata normal form. 2/539 useless extension candidates. Maximal degree in co-relation 3372. Up to 470 conditions per place. [2024-06-03 21:22:58,894 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 106 selfloop transitions, 19 changer transitions 0/128 dead transitions. [2024-06-03 21:22:58,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 128 transitions, 1193 flow [2024-06-03 21:22:58,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:22:58,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:22:58,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 122 transitions. [2024-06-03 21:22:58,921 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4107744107744108 [2024-06-03 21:22:58,921 INFO L175 Difference]: Start difference. First operand has 122 places, 110 transitions, 869 flow. Second operand 9 states and 122 transitions. [2024-06-03 21:22:58,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 128 transitions, 1193 flow [2024-06-03 21:22:58,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 128 transitions, 1106 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-03 21:22:58,940 INFO L231 Difference]: Finished difference. Result has 124 places, 112 transitions, 853 flow [2024-06-03 21:22:58,941 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=853, PETRI_PLACES=124, PETRI_TRANSITIONS=112} [2024-06-03 21:22:58,941 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 92 predicate places. [2024-06-03 21:22:58,941 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 112 transitions, 853 flow [2024-06-03 21:22:58,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:22:58,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:22:58,942 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:22:58,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-03 21:22:58,942 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-03 21:22:58,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:22:58,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1956877182, now seen corresponding path program 4 times [2024-06-03 21:22:58,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:22:58,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886304604] [2024-06-03 21:22:58,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:22:58,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:22:58,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:23:08,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-03 21:23:08,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:23:08,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886304604] [2024-06-03 21:23:08,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886304604] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:23:08,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:23:08,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:23:08,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894444653] [2024-06-03 21:23:08,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:23:08,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:23:08,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:23:08,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:23:08,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:23:08,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 21:23:08,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 112 transitions, 853 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:23:08,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:23:08,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 21:23:08,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:23:08,744 INFO L124 PetriNetUnfolderBase]: 300/550 cut-off events. [2024-06-03 21:23:08,744 INFO L125 PetriNetUnfolderBase]: For 20594/20594 co-relation queries the response was YES. [2024-06-03 21:23:08,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3522 conditions, 550 events. 300/550 cut-off events. For 20594/20594 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2283 event pairs, 45 based on Foata normal form. 2/550 useless extension candidates. Maximal degree in co-relation 3462. Up to 430 conditions per place. [2024-06-03 21:23:08,748 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 94 selfloop transitions, 31 changer transitions 0/128 dead transitions. [2024-06-03 21:23:08,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 128 transitions, 1199 flow [2024-06-03 21:23:08,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:23:08,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:23:08,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-03 21:23:08,752 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39057239057239057 [2024-06-03 21:23:08,753 INFO L175 Difference]: Start difference. First operand has 124 places, 112 transitions, 853 flow. Second operand 9 states and 116 transitions. [2024-06-03 21:23:08,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 128 transitions, 1199 flow [2024-06-03 21:23:08,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 128 transitions, 1144 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-03 21:23:08,772 INFO L231 Difference]: Finished difference. Result has 126 places, 115 transitions, 920 flow [2024-06-03 21:23:08,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=920, PETRI_PLACES=126, PETRI_TRANSITIONS=115} [2024-06-03 21:23:08,772 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 94 predicate places. [2024-06-03 21:23:08,773 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 115 transitions, 920 flow [2024-06-03 21:23:08,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:23:08,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:23:08,773 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:23:08,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-03 21:23:08,773 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-03 21:23:08,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:23:08,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1956870672, now seen corresponding path program 5 times [2024-06-03 21:23:08,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:23:08,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668271950] [2024-06-03 21:23:08,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:23:08,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:23:08,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:23:17,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-03 21:23:17,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:23:17,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668271950] [2024-06-03 21:23:17,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668271950] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:23:17,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:23:17,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:23:17,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958420033] [2024-06-03 21:23:17,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:23:17,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:23:17,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:23:17,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:23:17,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:23:17,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 21:23:17,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 115 transitions, 920 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:23:17,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:23:17,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 21:23:17,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:23:17,841 INFO L124 PetriNetUnfolderBase]: 303/555 cut-off events. [2024-06-03 21:23:17,841 INFO L125 PetriNetUnfolderBase]: For 21255/21255 co-relation queries the response was YES. [2024-06-03 21:23:17,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3644 conditions, 555 events. 303/555 cut-off events. For 21255/21255 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2316 event pairs, 45 based on Foata normal form. 1/554 useless extension candidates. Maximal degree in co-relation 3583. Up to 429 conditions per place. [2024-06-03 21:23:17,845 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 93 selfloop transitions, 34 changer transitions 0/130 dead transitions. [2024-06-03 21:23:17,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 130 transitions, 1260 flow [2024-06-03 21:23:17,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:23:17,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:23:17,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-03 21:23:17,869 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39730639730639733 [2024-06-03 21:23:17,869 INFO L175 Difference]: Start difference. First operand has 126 places, 115 transitions, 920 flow. Second operand 9 states and 118 transitions. [2024-06-03 21:23:17,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 130 transitions, 1260 flow [2024-06-03 21:23:17,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 130 transitions, 1160 flow, removed 21 selfloop flow, removed 7 redundant places. [2024-06-03 21:23:17,889 INFO L231 Difference]: Finished difference. Result has 128 places, 117 transitions, 931 flow [2024-06-03 21:23:17,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=820, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=931, PETRI_PLACES=128, PETRI_TRANSITIONS=117} [2024-06-03 21:23:17,892 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 96 predicate places. [2024-06-03 21:23:17,892 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 117 transitions, 931 flow [2024-06-03 21:23:17,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:23:17,892 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:23:17,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:23:17,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-03 21:23:17,893 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-03 21:23:17,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:23:17,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1956870424, now seen corresponding path program 2 times [2024-06-03 21:23:17,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:23:17,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489837894] [2024-06-03 21:23:17,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:23:17,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:23:17,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:23:26,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:23:26,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:23:26,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489837894] [2024-06-03 21:23:26,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489837894] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:23:26,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:23:26,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:23:26,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076035062] [2024-06-03 21:23:26,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:23:26,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:23:26,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:23:26,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:23:26,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:23:26,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 21:23:26,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 117 transitions, 931 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:23:26,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:23:26,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 21:23:26,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:23:27,006 INFO L124 PetriNetUnfolderBase]: 309/564 cut-off events. [2024-06-03 21:23:27,006 INFO L125 PetriNetUnfolderBase]: For 23098/23098 co-relation queries the response was YES. [2024-06-03 21:23:27,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3728 conditions, 564 events. 309/564 cut-off events. For 23098/23098 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2366 event pairs, 40 based on Foata normal form. 2/564 useless extension candidates. Maximal degree in co-relation 3666. Up to 487 conditions per place. [2024-06-03 21:23:27,011 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 108 selfloop transitions, 21 changer transitions 0/132 dead transitions. [2024-06-03 21:23:27,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 132 transitions, 1255 flow [2024-06-03 21:23:27,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:23:27,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:23:27,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 121 transitions. [2024-06-03 21:23:27,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4074074074074074 [2024-06-03 21:23:27,014 INFO L175 Difference]: Start difference. First operand has 128 places, 117 transitions, 931 flow. Second operand 9 states and 121 transitions. [2024-06-03 21:23:27,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 132 transitions, 1255 flow [2024-06-03 21:23:27,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 132 transitions, 1160 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-03 21:23:27,035 INFO L231 Difference]: Finished difference. Result has 130 places, 119 transitions, 915 flow [2024-06-03 21:23:27,035 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=915, PETRI_PLACES=130, PETRI_TRANSITIONS=119} [2024-06-03 21:23:27,044 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 98 predicate places. [2024-06-03 21:23:27,045 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 119 transitions, 915 flow [2024-06-03 21:23:27,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:23:27,045 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:23:27,045 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:23:27,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-03 21:23:27,045 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-03 21:23:27,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:23:27,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1013488532, now seen corresponding path program 6 times [2024-06-03 21:23:27,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:23:27,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859820584] [2024-06-03 21:23:27,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:23:27,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:23:27,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:23:36,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:23:36,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:23:36,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859820584] [2024-06-03 21:23:36,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859820584] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:23:36,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:23:36,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:23:36,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540174503] [2024-06-03 21:23:36,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:23:36,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:23:36,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:23:36,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:23:36,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:23:36,426 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 21:23:36,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 119 transitions, 915 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:23:36,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:23:36,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 21:23:36,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:23:36,712 INFO L124 PetriNetUnfolderBase]: 312/570 cut-off events. [2024-06-03 21:23:36,712 INFO L125 PetriNetUnfolderBase]: For 23470/23470 co-relation queries the response was YES. [2024-06-03 21:23:36,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3779 conditions, 570 events. 312/570 cut-off events. For 23470/23470 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2405 event pairs, 45 based on Foata normal form. 1/569 useless extension candidates. Maximal degree in co-relation 3716. Up to 413 conditions per place. [2024-06-03 21:23:36,742 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 83 selfloop transitions, 47 changer transitions 0/133 dead transitions. [2024-06-03 21:23:36,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 133 transitions, 1255 flow [2024-06-03 21:23:36,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:23:36,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:23:36,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-03 21:23:36,744 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2024-06-03 21:23:36,744 INFO L175 Difference]: Start difference. First operand has 130 places, 119 transitions, 915 flow. Second operand 9 states and 117 transitions. [2024-06-03 21:23:36,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 133 transitions, 1255 flow [2024-06-03 21:23:36,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 133 transitions, 1192 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-03 21:23:36,766 INFO L231 Difference]: Finished difference. Result has 132 places, 121 transitions, 993 flow [2024-06-03 21:23:36,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=993, PETRI_PLACES=132, PETRI_TRANSITIONS=121} [2024-06-03 21:23:36,767 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 100 predicate places. [2024-06-03 21:23:36,767 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 121 transitions, 993 flow [2024-06-03 21:23:36,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:23:36,767 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:23:36,768 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:23:36,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-03 21:23:36,768 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-03 21:23:36,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:23:36,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1013488780, now seen corresponding path program 3 times [2024-06-03 21:23:36,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:23:36,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487915744] [2024-06-03 21:23:36,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:23:36,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:23:36,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:23:48,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:23:48,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:23:48,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487915744] [2024-06-03 21:23:48,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487915744] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:23:48,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:23:48,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:23:48,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340129179] [2024-06-03 21:23:48,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:23:48,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:23:48,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:23:48,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:23:48,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:23:48,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 21:23:48,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 121 transitions, 993 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:23:48,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:23:48,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 21:23:48,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:23:48,788 INFO L124 PetriNetUnfolderBase]: 320/582 cut-off events. [2024-06-03 21:23:48,788 INFO L125 PetriNetUnfolderBase]: For 25515/25515 co-relation queries the response was YES. [2024-06-03 21:23:48,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3992 conditions, 582 events. 320/582 cut-off events. For 25515/25515 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2452 event pairs, 39 based on Foata normal form. 1/581 useless extension candidates. Maximal degree in co-relation 3928. Up to 486 conditions per place. [2024-06-03 21:23:48,811 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 108 selfloop transitions, 30 changer transitions 0/141 dead transitions. [2024-06-03 21:23:48,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 141 transitions, 1449 flow [2024-06-03 21:23:48,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:23:48,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:23:48,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions. [2024-06-03 21:23:48,830 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3872053872053872 [2024-06-03 21:23:48,830 INFO L175 Difference]: Start difference. First operand has 132 places, 121 transitions, 993 flow. Second operand 9 states and 115 transitions. [2024-06-03 21:23:48,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 141 transitions, 1449 flow [2024-06-03 21:23:48,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 141 transitions, 1324 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-03 21:23:48,851 INFO L231 Difference]: Finished difference. Result has 135 places, 128 transitions, 1016 flow [2024-06-03 21:23:48,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=868, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1016, PETRI_PLACES=135, PETRI_TRANSITIONS=128} [2024-06-03 21:23:48,854 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 103 predicate places. [2024-06-03 21:23:48,854 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 128 transitions, 1016 flow [2024-06-03 21:23:48,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:23:48,854 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:23:48,854 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:23:48,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-03 21:23:48,858 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-03 21:23:48,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:23:48,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1013497150, now seen corresponding path program 4 times [2024-06-03 21:23:48,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:23:48,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164730473] [2024-06-03 21:23:48,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:23:48,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:23:48,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:23:59,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-03 21:23:59,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:23:59,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164730473] [2024-06-03 21:23:59,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164730473] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:23:59,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:23:59,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:23:59,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588565168] [2024-06-03 21:23:59,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:23:59,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:23:59,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:23:59,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:23:59,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:23:59,687 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 21:23:59,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 128 transitions, 1016 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:23:59,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:23:59,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 21:23:59,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:23:59,971 INFO L124 PetriNetUnfolderBase]: 318/579 cut-off events. [2024-06-03 21:23:59,971 INFO L125 PetriNetUnfolderBase]: For 25842/25842 co-relation queries the response was YES. [2024-06-03 21:23:59,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3943 conditions, 579 events. 318/579 cut-off events. For 25842/25842 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2443 event pairs, 39 based on Foata normal form. 1/578 useless extension candidates. Maximal degree in co-relation 3877. Up to 484 conditions per place. [2024-06-03 21:23:59,975 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 105 selfloop transitions, 32 changer transitions 0/140 dead transitions. [2024-06-03 21:23:59,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 140 transitions, 1324 flow [2024-06-03 21:23:59,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:23:59,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:23:59,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-03 21:23:59,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38047138047138046 [2024-06-03 21:23:59,978 INFO L175 Difference]: Start difference. First operand has 135 places, 128 transitions, 1016 flow. Second operand 9 states and 113 transitions. [2024-06-03 21:23:59,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 140 transitions, 1324 flow [2024-06-03 21:24:00,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 140 transitions, 1254 flow, removed 22 selfloop flow, removed 5 redundant places. [2024-06-03 21:24:00,004 INFO L231 Difference]: Finished difference. Result has 139 places, 128 transitions, 1015 flow [2024-06-03 21:24:00,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=946, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1015, PETRI_PLACES=139, PETRI_TRANSITIONS=128} [2024-06-03 21:24:00,006 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 107 predicate places. [2024-06-03 21:24:00,006 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 128 transitions, 1015 flow [2024-06-03 21:24:00,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:24:00,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:24:00,006 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:24:00,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-03 21:24:00,006 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-03 21:24:00,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:24:00,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1342916460, now seen corresponding path program 7 times [2024-06-03 21:24:00,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:24:00,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388400595] [2024-06-03 21:24:00,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:24:00,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:24:00,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:24:07,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:24:07,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:24:07,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388400595] [2024-06-03 21:24:07,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388400595] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:24:07,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:24:07,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:24:07,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629266703] [2024-06-03 21:24:07,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:24:07,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:24:07,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:24:07,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:24:07,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:24:07,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 21:24:07,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 128 transitions, 1015 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:24:07,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:24:07,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 21:24:07,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:24:07,812 INFO L124 PetriNetUnfolderBase]: 324/590 cut-off events. [2024-06-03 21:24:07,812 INFO L125 PetriNetUnfolderBase]: For 28133/28136 co-relation queries the response was YES. [2024-06-03 21:24:07,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4087 conditions, 590 events. 324/590 cut-off events. For 28133/28136 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2506 event pairs, 53 based on Foata normal form. 2/587 useless extension candidates. Maximal degree in co-relation 4020. Up to 455 conditions per place. [2024-06-03 21:24:07,817 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 103 selfloop transitions, 36 changer transitions 0/142 dead transitions. [2024-06-03 21:24:07,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 142 transitions, 1409 flow [2024-06-03 21:24:07,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:24:07,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:24:07,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions. [2024-06-03 21:24:07,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3872053872053872 [2024-06-03 21:24:07,818 INFO L175 Difference]: Start difference. First operand has 139 places, 128 transitions, 1015 flow. Second operand 9 states and 115 transitions. [2024-06-03 21:24:07,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 142 transitions, 1409 flow [2024-06-03 21:24:07,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 142 transitions, 1349 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-03 21:24:07,843 INFO L231 Difference]: Finished difference. Result has 141 places, 131 transitions, 1101 flow [2024-06-03 21:24:07,843 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=955, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1101, PETRI_PLACES=141, PETRI_TRANSITIONS=131} [2024-06-03 21:24:07,843 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 109 predicate places. [2024-06-03 21:24:07,843 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 131 transitions, 1101 flow [2024-06-03 21:24:07,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:24:07,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:24:07,844 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:24:07,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-03 21:24:07,844 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-03 21:24:07,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:24:07,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1669351144, now seen corresponding path program 5 times [2024-06-03 21:24:07,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:24:07,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349707175] [2024-06-03 21:24:07,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:24:07,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:24:07,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:24:16,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:24:16,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:24:16,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349707175] [2024-06-03 21:24:16,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349707175] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:24:16,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:24:16,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:24:16,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26923786] [2024-06-03 21:24:16,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:24:16,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:24:16,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:24:16,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:24:16,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:24:16,436 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 21:24:16,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 131 transitions, 1101 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:24:16,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:24:16,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 21:24:16,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:24:16,687 INFO L124 PetriNetUnfolderBase]: 330/600 cut-off events. [2024-06-03 21:24:16,687 INFO L125 PetriNetUnfolderBase]: For 29947/29950 co-relation queries the response was YES. [2024-06-03 21:24:16,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4268 conditions, 600 events. 330/600 cut-off events. For 29947/29950 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2566 event pairs, 45 based on Foata normal form. 2/597 useless extension candidates. Maximal degree in co-relation 4200. Up to 513 conditions per place. [2024-06-03 21:24:16,691 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 116 selfloop transitions, 25 changer transitions 0/144 dead transitions. [2024-06-03 21:24:16,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 144 transitions, 1451 flow [2024-06-03 21:24:16,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:24:16,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:24:16,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2024-06-03 21:24:16,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40404040404040403 [2024-06-03 21:24:16,693 INFO L175 Difference]: Start difference. First operand has 141 places, 131 transitions, 1101 flow. Second operand 9 states and 120 transitions. [2024-06-03 21:24:16,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 144 transitions, 1451 flow [2024-06-03 21:24:16,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 144 transitions, 1327 flow, removed 28 selfloop flow, removed 7 redundant places. [2024-06-03 21:24:16,720 INFO L231 Difference]: Finished difference. Result has 143 places, 133 transitions, 1070 flow [2024-06-03 21:24:16,720 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=977, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1070, PETRI_PLACES=143, PETRI_TRANSITIONS=133} [2024-06-03 21:24:16,721 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 111 predicate places. [2024-06-03 21:24:16,721 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 133 transitions, 1070 flow [2024-06-03 21:24:16,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:24:16,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:24:16,721 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:24:16,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-03 21:24:16,722 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-03 21:24:16,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:24:16,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1669590154, now seen corresponding path program 6 times [2024-06-03 21:24:16,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:24:16,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509698731] [2024-06-03 21:24:16,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:24:16,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:24:16,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:24:24,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:24:24,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:24:24,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509698731] [2024-06-03 21:24:24,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509698731] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:24:24,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:24:24,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:24:24,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106445808] [2024-06-03 21:24:24,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:24:24,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:24:24,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:24:24,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:24:24,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:24:24,540 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 21:24:24,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 133 transitions, 1070 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:24:24,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:24:24,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 21:24:24,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:24:24,818 INFO L124 PetriNetUnfolderBase]: 352/636 cut-off events. [2024-06-03 21:24:24,818 INFO L125 PetriNetUnfolderBase]: For 34402/34405 co-relation queries the response was YES. [2024-06-03 21:24:24,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4643 conditions, 636 events. 352/636 cut-off events. For 34402/34405 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2737 event pairs, 46 based on Foata normal form. 2/633 useless extension candidates. Maximal degree in co-relation 4574. Up to 518 conditions per place. [2024-06-03 21:24:24,822 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 115 selfloop transitions, 33 changer transitions 0/151 dead transitions. [2024-06-03 21:24:24,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 151 transitions, 1590 flow [2024-06-03 21:24:24,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:24:24,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:24:24,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-03 21:24:24,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39057239057239057 [2024-06-03 21:24:24,824 INFO L175 Difference]: Start difference. First operand has 143 places, 133 transitions, 1070 flow. Second operand 9 states and 116 transitions. [2024-06-03 21:24:24,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 151 transitions, 1590 flow [2024-06-03 21:24:24,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 151 transitions, 1515 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-03 21:24:24,858 INFO L231 Difference]: Finished difference. Result has 146 places, 138 transitions, 1176 flow [2024-06-03 21:24:24,859 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=995, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1176, PETRI_PLACES=146, PETRI_TRANSITIONS=138} [2024-06-03 21:24:24,859 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 114 predicate places. [2024-06-03 21:24:24,859 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 138 transitions, 1176 flow [2024-06-03 21:24:24,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:24:24,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:24:24,860 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:24:24,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-03 21:24:24,860 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-03 21:24:24,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:24:24,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1669350896, now seen corresponding path program 8 times [2024-06-03 21:24:24,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:24:24,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46070839] [2024-06-03 21:24:24,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:24:24,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:24:24,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:24:34,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:24:34,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:24:34,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46070839] [2024-06-03 21:24:34,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46070839] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:24:34,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:24:34,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:24:34,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782720793] [2024-06-03 21:24:34,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:24:34,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:24:34,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:24:34,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:24:34,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:24:34,822 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 21:24:34,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 138 transitions, 1176 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:24:34,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:24:34,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 21:24:34,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:24:35,151 INFO L124 PetriNetUnfolderBase]: 355/641 cut-off events. [2024-06-03 21:24:35,152 INFO L125 PetriNetUnfolderBase]: For 35148/35151 co-relation queries the response was YES. [2024-06-03 21:24:35,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4782 conditions, 641 events. 355/641 cut-off events. For 35148/35151 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2762 event pairs, 54 based on Foata normal form. 1/637 useless extension candidates. Maximal degree in co-relation 4711. Up to 500 conditions per place. [2024-06-03 21:24:35,157 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 109 selfloop transitions, 39 changer transitions 0/151 dead transitions. [2024-06-03 21:24:35,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 151 transitions, 1576 flow [2024-06-03 21:24:35,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:24:35,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:24:35,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-03 21:24:35,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2024-06-03 21:24:35,159 INFO L175 Difference]: Start difference. First operand has 146 places, 138 transitions, 1176 flow. Second operand 9 states and 117 transitions. [2024-06-03 21:24:35,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 151 transitions, 1576 flow [2024-06-03 21:24:35,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 151 transitions, 1507 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-03 21:24:35,200 INFO L231 Difference]: Finished difference. Result has 150 places, 140 transitions, 1240 flow [2024-06-03 21:24:35,200 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1107, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1240, PETRI_PLACES=150, PETRI_TRANSITIONS=140} [2024-06-03 21:24:35,201 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 118 predicate places. [2024-06-03 21:24:35,201 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 140 transitions, 1240 flow [2024-06-03 21:24:35,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:24:35,201 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:24:35,201 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:24:35,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-03 21:24:35,201 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-03 21:24:35,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:24:35,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1342670382, now seen corresponding path program 1 times [2024-06-03 21:24:35,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:24:35,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584870432] [2024-06-03 21:24:35,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:24:35,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:24:35,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:24:44,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:24:44,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:24:44,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584870432] [2024-06-03 21:24:44,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584870432] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:24:44,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:24:44,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:24:44,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701661740] [2024-06-03 21:24:44,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:24:44,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:24:44,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:24:44,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:24:44,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:24:44,874 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 21:24:44,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 140 transitions, 1240 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:24:44,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:24:44,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 21:24:44,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:24:45,165 INFO L124 PetriNetUnfolderBase]: 334/615 cut-off events. [2024-06-03 21:24:45,165 INFO L125 PetriNetUnfolderBase]: For 36548/36555 co-relation queries the response was YES. [2024-06-03 21:24:45,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4620 conditions, 615 events. 334/615 cut-off events. For 36548/36555 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2708 event pairs, 41 based on Foata normal form. 7/618 useless extension candidates. Maximal degree in co-relation 4547. Up to 495 conditions per place. [2024-06-03 21:24:45,170 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 108 selfloop transitions, 19 changer transitions 0/151 dead transitions. [2024-06-03 21:24:45,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 151 transitions, 1537 flow [2024-06-03 21:24:45,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:24:45,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:24:45,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-03 21:24:45,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39057239057239057 [2024-06-03 21:24:45,173 INFO L175 Difference]: Start difference. First operand has 150 places, 140 transitions, 1240 flow. Second operand 9 states and 116 transitions. [2024-06-03 21:24:45,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 151 transitions, 1537 flow [2024-06-03 21:24:45,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 151 transitions, 1420 flow, removed 21 selfloop flow, removed 7 redundant places. [2024-06-03 21:24:45,214 INFO L231 Difference]: Finished difference. Result has 152 places, 141 transitions, 1183 flow [2024-06-03 21:24:45,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1123, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1183, PETRI_PLACES=152, PETRI_TRANSITIONS=141} [2024-06-03 21:24:45,215 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 120 predicate places. [2024-06-03 21:24:45,215 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 141 transitions, 1183 flow [2024-06-03 21:24:45,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:24:45,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:24:45,215 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:24:45,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-03 21:24:45,216 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-03 21:24:45,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:24:45,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1669581784, now seen corresponding path program 7 times [2024-06-03 21:24:45,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:24:45,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629419772] [2024-06-03 21:24:45,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:24:45,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:24:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:24:54,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-03 21:24:54,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:24:54,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629419772] [2024-06-03 21:24:54,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629419772] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:24:54,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:24:54,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:24:54,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594938233] [2024-06-03 21:24:54,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:24:54,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:24:54,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:24:54,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:24:54,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:24:54,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 21:24:54,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 141 transitions, 1183 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:24:54,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:24:54,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 21:24:54,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:24:54,477 INFO L124 PetriNetUnfolderBase]: 348/630 cut-off events. [2024-06-03 21:24:54,477 INFO L125 PetriNetUnfolderBase]: For 35397/35400 co-relation queries the response was YES. [2024-06-03 21:24:54,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4580 conditions, 630 events. 348/630 cut-off events. For 35397/35400 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2724 event pairs, 45 based on Foata normal form. 2/627 useless extension candidates. Maximal degree in co-relation 4506. Up to 517 conditions per place. [2024-06-03 21:24:54,482 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 118 selfloop transitions, 33 changer transitions 0/154 dead transitions. [2024-06-03 21:24:54,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 154 transitions, 1531 flow [2024-06-03 21:24:54,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:24:54,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:24:54,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 126 transitions. [2024-06-03 21:24:54,483 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-03 21:24:54,483 INFO L175 Difference]: Start difference. First operand has 152 places, 141 transitions, 1183 flow. Second operand 9 states and 126 transitions. [2024-06-03 21:24:54,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 154 transitions, 1531 flow [2024-06-03 21:24:54,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 154 transitions, 1444 flow, removed 26 selfloop flow, removed 7 redundant places. [2024-06-03 21:24:54,528 INFO L231 Difference]: Finished difference. Result has 154 places, 141 transitions, 1167 flow [2024-06-03 21:24:54,529 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1096, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1167, PETRI_PLACES=154, PETRI_TRANSITIONS=141} [2024-06-03 21:24:54,529 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 122 predicate places. [2024-06-03 21:24:54,529 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 141 transitions, 1167 flow [2024-06-03 21:24:54,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:24:54,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:24:54,529 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:24:54,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-03 21:24:54,530 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-03 21:24:54,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:24:54,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1669581536, now seen corresponding path program 9 times [2024-06-03 21:24:54,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:24:54,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13942122] [2024-06-03 21:24:54,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:24:54,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:24:54,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:25:03,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:25:03,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:25:03,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13942122] [2024-06-03 21:25:03,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13942122] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:25:03,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:25:03,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:25:03,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456442486] [2024-06-03 21:25:03,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:25:03,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:25:03,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:25:03,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:25:03,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:25:03,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 21:25:03,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 141 transitions, 1167 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:25:03,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:25:03,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 21:25:03,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:25:03,588 INFO L124 PetriNetUnfolderBase]: 351/635 cut-off events. [2024-06-03 21:25:03,588 INFO L125 PetriNetUnfolderBase]: For 35542/35545 co-relation queries the response was YES. [2024-06-03 21:25:03,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4641 conditions, 635 events. 351/635 cut-off events. For 35542/35545 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2742 event pairs, 53 based on Foata normal form. 1/631 useless extension candidates. Maximal degree in co-relation 4566. Up to 485 conditions per place. [2024-06-03 21:25:03,593 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 108 selfloop transitions, 43 changer transitions 0/154 dead transitions. [2024-06-03 21:25:03,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 154 transitions, 1581 flow [2024-06-03 21:25:03,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:25:03,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:25:03,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-03 21:25:03,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4006734006734007 [2024-06-03 21:25:03,595 INFO L175 Difference]: Start difference. First operand has 154 places, 141 transitions, 1167 flow. Second operand 9 states and 119 transitions. [2024-06-03 21:25:03,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 154 transitions, 1581 flow [2024-06-03 21:25:03,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 154 transitions, 1502 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-03 21:25:03,637 INFO L231 Difference]: Finished difference. Result has 155 places, 143 transitions, 1233 flow [2024-06-03 21:25:03,637 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1088, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1233, PETRI_PLACES=155, PETRI_TRANSITIONS=143} [2024-06-03 21:25:03,637 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 123 predicate places. [2024-06-03 21:25:03,638 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 143 transitions, 1233 flow [2024-06-03 21:25:03,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:25:03,638 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:25:03,638 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:25:03,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-03 21:25:03,638 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-03 21:25:03,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:25:03,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1965165854, now seen corresponding path program 2 times [2024-06-03 21:25:03,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:25:03,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626280051] [2024-06-03 21:25:03,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:25:03,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:25:03,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:25:12,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:25:12,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:25:12,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626280051] [2024-06-03 21:25:12,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626280051] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:25:12,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:25:12,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:25:12,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049549700] [2024-06-03 21:25:12,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:25:12,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:25:12,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:25:12,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:25:12,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:25:12,835 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 21:25:12,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 143 transitions, 1233 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:25:12,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:25:12,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 21:25:12,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:25:13,215 INFO L124 PetriNetUnfolderBase]: 340/624 cut-off events. [2024-06-03 21:25:13,215 INFO L125 PetriNetUnfolderBase]: For 39054/39059 co-relation queries the response was YES. [2024-06-03 21:25:13,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4709 conditions, 624 events. 340/624 cut-off events. For 39054/39059 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2763 event pairs, 41 based on Foata normal form. 4/624 useless extension candidates. Maximal degree in co-relation 4633. Up to 517 conditions per place. [2024-06-03 21:25:13,220 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 116 selfloop transitions, 18 changer transitions 0/158 dead transitions. [2024-06-03 21:25:13,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 158 transitions, 1693 flow [2024-06-03 21:25:13,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:25:13,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:25:13,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-03 21:25:13,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38484848484848483 [2024-06-03 21:25:13,221 INFO L175 Difference]: Start difference. First operand has 155 places, 143 transitions, 1233 flow. Second operand 10 states and 127 transitions. [2024-06-03 21:25:13,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 158 transitions, 1693 flow [2024-06-03 21:25:13,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 158 transitions, 1564 flow, removed 23 selfloop flow, removed 7 redundant places. [2024-06-03 21:25:13,265 INFO L231 Difference]: Finished difference. Result has 158 places, 147 transitions, 1217 flow [2024-06-03 21:25:13,266 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1104, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1217, PETRI_PLACES=158, PETRI_TRANSITIONS=147} [2024-06-03 21:25:13,266 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 126 predicate places. [2024-06-03 21:25:13,266 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 147 transitions, 1217 flow [2024-06-03 21:25:13,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:25:13,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:25:13,266 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:25:13,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-03 21:25:13,267 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-03 21:25:13,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:25:13,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1964809664, now seen corresponding path program 3 times [2024-06-03 21:25:13,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:25:13,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156722228] [2024-06-03 21:25:13,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:25:13,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:25:13,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:25:24,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:25:24,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:25:24,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156722228] [2024-06-03 21:25:24,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156722228] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:25:24,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:25:24,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:25:24,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085362369] [2024-06-03 21:25:24,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:25:24,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:25:24,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:25:24,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:25:24,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:25:24,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 21:25:24,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 147 transitions, 1217 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:25:24,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:25:24,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 21:25:24,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:25:24,786 INFO L124 PetriNetUnfolderBase]: 338/621 cut-off events. [2024-06-03 21:25:24,786 INFO L125 PetriNetUnfolderBase]: For 38988/38993 co-relation queries the response was YES. [2024-06-03 21:25:24,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4592 conditions, 621 events. 338/621 cut-off events. For 38988/38993 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2758 event pairs, 41 based on Foata normal form. 4/621 useless extension candidates. Maximal degree in co-relation 4515. Up to 521 conditions per place. [2024-06-03 21:25:24,791 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 118 selfloop transitions, 14 changer transitions 0/156 dead transitions. [2024-06-03 21:25:24,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 156 transitions, 1503 flow [2024-06-03 21:25:24,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:25:24,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:25:24,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-03 21:25:24,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3838383838383838 [2024-06-03 21:25:24,792 INFO L175 Difference]: Start difference. First operand has 158 places, 147 transitions, 1217 flow. Second operand 9 states and 114 transitions. [2024-06-03 21:25:24,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 156 transitions, 1503 flow [2024-06-03 21:25:24,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 156 transitions, 1426 flow, removed 30 selfloop flow, removed 6 redundant places. [2024-06-03 21:25:24,834 INFO L231 Difference]: Finished difference. Result has 161 places, 147 transitions, 1173 flow [2024-06-03 21:25:24,834 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1173, PETRI_PLACES=161, PETRI_TRANSITIONS=147} [2024-06-03 21:25:24,835 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 129 predicate places. [2024-06-03 21:25:24,835 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 147 transitions, 1173 flow [2024-06-03 21:25:24,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:25:24,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:25:24,835 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:25:24,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-03 21:25:24,836 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-03 21:25:24,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:25:24,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1954681406, now seen corresponding path program 10 times [2024-06-03 21:25:24,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:25:24,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819888860] [2024-06-03 21:25:24,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:25:24,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:25:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:25:35,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-03 21:25:35,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:25:35,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819888860] [2024-06-03 21:25:35,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819888860] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:25:35,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:25:35,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:25:35,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796297102] [2024-06-03 21:25:35,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:25:35,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:25:35,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:25:35,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:25:35,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:25:35,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 21:25:35,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 147 transitions, 1173 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:25:35,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:25:35,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 21:25:35,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:25:35,888 INFO L124 PetriNetUnfolderBase]: 355/642 cut-off events. [2024-06-03 21:25:35,889 INFO L125 PetriNetUnfolderBase]: For 38489/38492 co-relation queries the response was YES. [2024-06-03 21:25:35,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4669 conditions, 642 events. 355/642 cut-off events. For 38489/38492 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2790 event pairs, 53 based on Foata normal form. 1/638 useless extension candidates. Maximal degree in co-relation 4590. Up to 437 conditions per place. [2024-06-03 21:25:35,894 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 89 selfloop transitions, 67 changer transitions 0/159 dead transitions. [2024-06-03 21:25:35,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 159 transitions, 1583 flow [2024-06-03 21:25:35,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:25:35,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:25:35,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-03 21:25:35,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2024-06-03 21:25:35,896 INFO L175 Difference]: Start difference. First operand has 161 places, 147 transitions, 1173 flow. Second operand 9 states and 117 transitions. [2024-06-03 21:25:35,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 159 transitions, 1583 flow [2024-06-03 21:25:35,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 159 transitions, 1556 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-03 21:25:35,949 INFO L231 Difference]: Finished difference. Result has 163 places, 149 transitions, 1343 flow [2024-06-03 21:25:35,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1146, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1343, PETRI_PLACES=163, PETRI_TRANSITIONS=149} [2024-06-03 21:25:35,950 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 131 predicate places. [2024-06-03 21:25:35,950 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 149 transitions, 1343 flow [2024-06-03 21:25:35,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:25:35,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:25:35,950 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:25:35,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-03 21:25:35,951 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-03 21:25:35,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:25:35,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1954681654, now seen corresponding path program 8 times [2024-06-03 21:25:35,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:25:35,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183680078] [2024-06-03 21:25:35,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:25:35,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:25:36,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:25:44,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:25:44,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:25:44,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183680078] [2024-06-03 21:25:44,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183680078] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:25:44,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:25:44,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:25:44,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161878687] [2024-06-03 21:25:44,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:25:44,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:25:44,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:25:44,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:25:44,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:25:44,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 21:25:44,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 149 transitions, 1343 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:25:44,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:25:44,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 21:25:44,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:25:44,720 INFO L124 PetriNetUnfolderBase]: 366/660 cut-off events. [2024-06-03 21:25:44,721 INFO L125 PetriNetUnfolderBase]: For 43535/43538 co-relation queries the response was YES. [2024-06-03 21:25:44,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5077 conditions, 660 events. 366/660 cut-off events. For 43535/43538 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2879 event pairs, 45 based on Foata normal form. 2/657 useless extension candidates. Maximal degree in co-relation 4997. Up to 448 conditions per place. [2024-06-03 21:25:44,726 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 109 selfloop transitions, 61 changer transitions 0/173 dead transitions. [2024-06-03 21:25:44,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 173 transitions, 2217 flow [2024-06-03 21:25:44,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:25:44,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:25:44,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 131 transitions. [2024-06-03 21:25:44,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44107744107744107 [2024-06-03 21:25:44,728 INFO L175 Difference]: Start difference. First operand has 163 places, 149 transitions, 1343 flow. Second operand 9 states and 131 transitions. [2024-06-03 21:25:44,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 173 transitions, 2217 flow [2024-06-03 21:25:44,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 173 transitions, 2036 flow, removed 25 selfloop flow, removed 7 redundant places. [2024-06-03 21:25:44,780 INFO L231 Difference]: Finished difference. Result has 166 places, 157 transitions, 1477 flow [2024-06-03 21:25:44,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1162, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1477, PETRI_PLACES=166, PETRI_TRANSITIONS=157} [2024-06-03 21:25:44,781 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 134 predicate places. [2024-06-03 21:25:44,781 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 157 transitions, 1477 flow [2024-06-03 21:25:44,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:25:44,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:25:44,782 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:25:44,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-03 21:25:44,782 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-03 21:25:44,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:25:44,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1504771490, now seen corresponding path program 4 times [2024-06-03 21:25:44,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:25:44,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004469902] [2024-06-03 21:25:44,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:25:44,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:25:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:25:54,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:25:54,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:25:54,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004469902] [2024-06-03 21:25:54,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004469902] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:25:54,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:25:54,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:25:54,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742766404] [2024-06-03 21:25:54,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:25:54,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:25:54,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:25:54,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:25:54,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:25:54,366 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 21:25:54,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 157 transitions, 1477 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:25:54,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:25:54,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 21:25:54,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:25:54,686 INFO L124 PetriNetUnfolderBase]: 345/635 cut-off events. [2024-06-03 21:25:54,687 INFO L125 PetriNetUnfolderBase]: For 42672/42679 co-relation queries the response was YES. [2024-06-03 21:25:54,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4851 conditions, 635 events. 345/635 cut-off events. For 42672/42679 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2840 event pairs, 40 based on Foata normal form. 7/638 useless extension candidates. Maximal degree in co-relation 4769. Up to 489 conditions per place. [2024-06-03 21:25:54,691 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 111 selfloop transitions, 29 changer transitions 0/167 dead transitions. [2024-06-03 21:25:54,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 167 transitions, 1785 flow [2024-06-03 21:25:54,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:25:54,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:25:54,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-03 21:25:54,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4006734006734007 [2024-06-03 21:25:54,693 INFO L175 Difference]: Start difference. First operand has 166 places, 157 transitions, 1477 flow. Second operand 9 states and 119 transitions. [2024-06-03 21:25:54,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 167 transitions, 1785 flow [2024-06-03 21:25:54,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 167 transitions, 1685 flow, removed 37 selfloop flow, removed 3 redundant places. [2024-06-03 21:25:54,744 INFO L231 Difference]: Finished difference. Result has 172 places, 157 transitions, 1440 flow [2024-06-03 21:25:54,745 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1377, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1440, PETRI_PLACES=172, PETRI_TRANSITIONS=157} [2024-06-03 21:25:54,745 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 140 predicate places. [2024-06-03 21:25:54,745 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 157 transitions, 1440 flow [2024-06-03 21:25:54,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:25:54,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:25:54,746 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:25:54,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-03 21:25:54,746 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-03 21:25:54,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:25:54,746 INFO L85 PathProgramCache]: Analyzing trace with hash -9788390, now seen corresponding path program 9 times [2024-06-03 21:25:54,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:25:54,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641263688] [2024-06-03 21:25:54,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:25:54,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:25:54,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:26:03,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:26:03,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:26:03,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641263688] [2024-06-03 21:26:03,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641263688] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:26:03,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:26:03,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:26:03,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653128874] [2024-06-03 21:26:03,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:26:03,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:26:03,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:26:03,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:26:03,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:26:04,114 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-06-03 21:26:04,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 157 transitions, 1440 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-03 21:26:04,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:26:04,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-06-03 21:26:04,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:26:04,402 INFO L124 PetriNetUnfolderBase]: 367/662 cut-off events. [2024-06-03 21:26:04,403 INFO L125 PetriNetUnfolderBase]: For 43420/43423 co-relation queries the response was YES. [2024-06-03 21:26:04,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5021 conditions, 662 events. 367/662 cut-off events. For 43420/43423 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2892 event pairs, 45 based on Foata normal form. 1/658 useless extension candidates. Maximal degree in co-relation 4937. Up to 508 conditions per place. [2024-06-03 21:26:04,408 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 123 selfloop transitions, 52 changer transitions 0/178 dead transitions. [2024-06-03 21:26:04,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 178 transitions, 2044 flow [2024-06-03 21:26:04,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:26:04,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:26:04,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2024-06-03 21:26:04,418 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-03 21:26:04,418 INFO L175 Difference]: Start difference. First operand has 172 places, 157 transitions, 1440 flow. Second operand 9 states and 108 transitions. [2024-06-03 21:26:04,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 178 transitions, 2044 flow [2024-06-03 21:26:04,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 178 transitions, 1969 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-03 21:26:04,477 INFO L231 Difference]: Finished difference. Result has 175 places, 167 transitions, 1635 flow [2024-06-03 21:26:04,477 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1365, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1635, PETRI_PLACES=175, PETRI_TRANSITIONS=167} [2024-06-03 21:26:04,478 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 143 predicate places. [2024-06-03 21:26:04,478 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 167 transitions, 1635 flow [2024-06-03 21:26:04,478 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-03 21:26:04,478 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:26:04,478 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:26:04,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-03 21:26:04,479 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-03 21:26:04,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:26:04,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1964809354, now seen corresponding path program 10 times [2024-06-03 21:26:04,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:26:04,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361818434] [2024-06-03 21:26:04,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:26:04,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:26:04,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:26:13,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:26:13,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:26:13,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361818434] [2024-06-03 21:26:13,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361818434] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:26:13,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:26:13,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:26:13,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023115230] [2024-06-03 21:26:13,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:26:13,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:26:13,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:26:13,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:26:13,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:26:13,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 21:26:13,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 167 transitions, 1635 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:13,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:26:13,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 21:26:13,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:26:14,279 INFO L124 PetriNetUnfolderBase]: 368/664 cut-off events. [2024-06-03 21:26:14,280 INFO L125 PetriNetUnfolderBase]: For 45206/45206 co-relation queries the response was YES. [2024-06-03 21:26:14,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5152 conditions, 664 events. 368/664 cut-off events. For 45206/45206 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2918 event pairs, 46 based on Foata normal form. 2/664 useless extension candidates. Maximal degree in co-relation 5065. Up to 606 conditions per place. [2024-06-03 21:26:14,285 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 156 selfloop transitions, 19 changer transitions 0/178 dead transitions. [2024-06-03 21:26:14,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 178 transitions, 2051 flow [2024-06-03 21:26:14,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:26:14,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:26:14,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-03 21:26:14,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39730639730639733 [2024-06-03 21:26:14,286 INFO L175 Difference]: Start difference. First operand has 175 places, 167 transitions, 1635 flow. Second operand 9 states and 118 transitions. [2024-06-03 21:26:14,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 178 transitions, 2051 flow [2024-06-03 21:26:14,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 178 transitions, 1969 flow, removed 28 selfloop flow, removed 3 redundant places. [2024-06-03 21:26:14,342 INFO L231 Difference]: Finished difference. Result has 181 places, 169 transitions, 1647 flow [2024-06-03 21:26:14,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1553, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1647, PETRI_PLACES=181, PETRI_TRANSITIONS=169} [2024-06-03 21:26:14,343 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 149 predicate places. [2024-06-03 21:26:14,343 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 169 transitions, 1647 flow [2024-06-03 21:26:14,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:14,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:26:14,343 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:26:14,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-03 21:26:14,344 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-03 21:26:14,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:26:14,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1733484132, now seen corresponding path program 1 times [2024-06-03 21:26:14,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:26:14,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412548654] [2024-06-03 21:26:14,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:26:14,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:26:14,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:26:23,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:26:23,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:26:23,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412548654] [2024-06-03 21:26:23,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412548654] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:26:23,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:26:23,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:26:23,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112158230] [2024-06-03 21:26:23,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:26:23,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:26:23,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:26:23,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:26:23,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:26:23,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 21:26:23,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 169 transitions, 1647 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:23,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:26:23,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 21:26:23,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:26:24,108 INFO L124 PetriNetUnfolderBase]: 371/670 cut-off events. [2024-06-03 21:26:24,109 INFO L125 PetriNetUnfolderBase]: For 45245/45245 co-relation queries the response was YES. [2024-06-03 21:26:24,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5225 conditions, 670 events. 371/670 cut-off events. For 45245/45245 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2966 event pairs, 36 based on Foata normal form. 1/669 useless extension candidates. Maximal degree in co-relation 5136. Up to 575 conditions per place. [2024-06-03 21:26:24,114 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 164 selfloop transitions, 25 changer transitions 0/192 dead transitions. [2024-06-03 21:26:24,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 192 transitions, 2145 flow [2024-06-03 21:26:24,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:26:24,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:26:24,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2024-06-03 21:26:24,115 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3878787878787879 [2024-06-03 21:26:24,116 INFO L175 Difference]: Start difference. First operand has 181 places, 169 transitions, 1647 flow. Second operand 10 states and 128 transitions. [2024-06-03 21:26:24,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 192 transitions, 2145 flow [2024-06-03 21:26:24,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 192 transitions, 2073 flow, removed 20 selfloop flow, removed 7 redundant places. [2024-06-03 21:26:24,173 INFO L231 Difference]: Finished difference. Result has 184 places, 171 transitions, 1690 flow [2024-06-03 21:26:24,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1575, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1690, PETRI_PLACES=184, PETRI_TRANSITIONS=171} [2024-06-03 21:26:24,174 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 152 predicate places. [2024-06-03 21:26:24,174 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 171 transitions, 1690 flow [2024-06-03 21:26:24,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:24,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:26:24,174 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:26:24,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-03 21:26:24,174 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-03 21:26:24,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:26:24,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1729759265, now seen corresponding path program 1 times [2024-06-03 21:26:24,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:26:24,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683264141] [2024-06-03 21:26:24,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:26:24,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:26:24,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:26:35,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:26:35,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:26:35,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683264141] [2024-06-03 21:26:35,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683264141] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:26:35,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:26:35,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:26:35,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285008169] [2024-06-03 21:26:35,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:26:35,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:26:35,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:26:35,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:26:35,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:26:35,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 21:26:35,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 171 transitions, 1690 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:35,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:26:35,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 21:26:35,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:26:35,683 INFO L124 PetriNetUnfolderBase]: 377/680 cut-off events. [2024-06-03 21:26:35,684 INFO L125 PetriNetUnfolderBase]: For 48498/48498 co-relation queries the response was YES. [2024-06-03 21:26:35,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5353 conditions, 680 events. 377/680 cut-off events. For 48498/48498 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3006 event pairs, 35 based on Foata normal form. 2/680 useless extension candidates. Maximal degree in co-relation 5263. Up to 576 conditions per place. [2024-06-03 21:26:35,689 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 161 selfloop transitions, 29 changer transitions 0/193 dead transitions. [2024-06-03 21:26:35,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 193 transitions, 2204 flow [2024-06-03 21:26:35,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:26:35,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:26:35,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2024-06-03 21:26:35,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3878787878787879 [2024-06-03 21:26:35,691 INFO L175 Difference]: Start difference. First operand has 184 places, 171 transitions, 1690 flow. Second operand 10 states and 128 transitions. [2024-06-03 21:26:35,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 193 transitions, 2204 flow [2024-06-03 21:26:35,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 193 transitions, 2105 flow, removed 26 selfloop flow, removed 8 redundant places. [2024-06-03 21:26:35,773 INFO L231 Difference]: Finished difference. Result has 186 places, 174 transitions, 1717 flow [2024-06-03 21:26:35,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1591, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1717, PETRI_PLACES=186, PETRI_TRANSITIONS=174} [2024-06-03 21:26:35,773 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 154 predicate places. [2024-06-03 21:26:35,774 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 174 transitions, 1717 flow [2024-06-03 21:26:35,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:35,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:26:35,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:26:35,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-03 21:26:35,774 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-03 21:26:35,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:26:35,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1729759482, now seen corresponding path program 2 times [2024-06-03 21:26:35,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:26:35,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835762521] [2024-06-03 21:26:35,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:26:35,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:26:35,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:26:45,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-03 21:26:45,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:26:45,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835762521] [2024-06-03 21:26:45,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835762521] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:26:45,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:26:45,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:26:45,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815618522] [2024-06-03 21:26:45,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:26:45,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:26:45,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:26:45,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:26:45,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:26:45,730 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 21:26:45,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 174 transitions, 1717 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:45,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:26:45,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 21:26:45,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:26:46,169 INFO L124 PetriNetUnfolderBase]: 380/687 cut-off events. [2024-06-03 21:26:46,169 INFO L125 PetriNetUnfolderBase]: For 49472/49472 co-relation queries the response was YES. [2024-06-03 21:26:46,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5471 conditions, 687 events. 380/687 cut-off events. For 49472/49472 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3080 event pairs, 35 based on Foata normal form. 1/686 useless extension candidates. Maximal degree in co-relation 5380. Up to 584 conditions per place. [2024-06-03 21:26:46,175 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 164 selfloop transitions, 28 changer transitions 0/195 dead transitions. [2024-06-03 21:26:46,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 195 transitions, 2243 flow [2024-06-03 21:26:46,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:26:46,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:26:46,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2024-06-03 21:26:46,176 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41515151515151516 [2024-06-03 21:26:46,176 INFO L175 Difference]: Start difference. First operand has 186 places, 174 transitions, 1717 flow. Second operand 10 states and 137 transitions. [2024-06-03 21:26:46,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 195 transitions, 2243 flow [2024-06-03 21:26:46,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 195 transitions, 2139 flow, removed 25 selfloop flow, removed 8 redundant places. [2024-06-03 21:26:46,240 INFO L231 Difference]: Finished difference. Result has 188 places, 176 transitions, 1740 flow [2024-06-03 21:26:46,241 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1613, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1740, PETRI_PLACES=188, PETRI_TRANSITIONS=176} [2024-06-03 21:26:46,241 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 156 predicate places. [2024-06-03 21:26:46,241 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 176 transitions, 1740 flow [2024-06-03 21:26:46,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:46,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:26:46,242 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:26:46,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-03 21:26:46,242 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-03 21:26:46,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:26:46,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1585868735, now seen corresponding path program 2 times [2024-06-03 21:26:46,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:26:46,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909873745] [2024-06-03 21:26:46,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:26:46,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:26:46,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:26:54,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:26:54,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:26:54,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909873745] [2024-06-03 21:26:54,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909873745] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:26:54,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:26:54,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:26:54,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607568876] [2024-06-03 21:26:54,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:26:54,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:26:54,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:26:54,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:26:54,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:26:55,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 21:26:55,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 176 transitions, 1740 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:55,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:26:55,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 21:26:55,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:26:55,474 INFO L124 PetriNetUnfolderBase]: 386/698 cut-off events. [2024-06-03 21:26:55,474 INFO L125 PetriNetUnfolderBase]: For 53088/53088 co-relation queries the response was YES. [2024-06-03 21:26:55,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5558 conditions, 698 events. 386/698 cut-off events. For 53088/53088 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3134 event pairs, 38 based on Foata normal form. 2/698 useless extension candidates. Maximal degree in co-relation 5466. Up to 582 conditions per place. [2024-06-03 21:26:55,480 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 162 selfloop transitions, 31 changer transitions 0/196 dead transitions. [2024-06-03 21:26:55,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 196 transitions, 2284 flow [2024-06-03 21:26:55,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:26:55,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:26:55,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2024-06-03 21:26:55,481 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3878787878787879 [2024-06-03 21:26:55,481 INFO L175 Difference]: Start difference. First operand has 188 places, 176 transitions, 1740 flow. Second operand 10 states and 128 transitions. [2024-06-03 21:26:55,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 196 transitions, 2284 flow [2024-06-03 21:26:55,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 196 transitions, 2173 flow, removed 29 selfloop flow, removed 8 redundant places. [2024-06-03 21:26:55,548 INFO L231 Difference]: Finished difference. Result has 190 places, 179 transitions, 1767 flow [2024-06-03 21:26:55,548 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1629, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1767, PETRI_PLACES=190, PETRI_TRANSITIONS=179} [2024-06-03 21:26:55,549 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 158 predicate places. [2024-06-03 21:26:55,549 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 179 transitions, 1767 flow [2024-06-03 21:26:55,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:26:55,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:26:55,549 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:26:55,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-03 21:26:55,550 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-03 21:26:55,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:26:55,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1585868952, now seen corresponding path program 3 times [2024-06-03 21:26:55,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:26:55,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989162107] [2024-06-03 21:26:55,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:26:55,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:26:55,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:27:06,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:27:06,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:27:06,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989162107] [2024-06-03 21:27:06,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989162107] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:27:06,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:27:06,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:27:06,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363236818] [2024-06-03 21:27:06,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:27:06,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:27:06,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:27:06,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:27:06,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:27:06,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 21:27:06,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 179 transitions, 1767 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:27:06,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:27:06,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 21:27:06,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:27:06,967 INFO L124 PetriNetUnfolderBase]: 389/705 cut-off events. [2024-06-03 21:27:06,967 INFO L125 PetriNetUnfolderBase]: For 53297/53297 co-relation queries the response was YES. [2024-06-03 21:27:06,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5666 conditions, 705 events. 389/705 cut-off events. For 53297/53297 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3195 event pairs, 38 based on Foata normal form. 1/704 useless extension candidates. Maximal degree in co-relation 5573. Up to 590 conditions per place. [2024-06-03 21:27:06,972 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 165 selfloop transitions, 30 changer transitions 0/198 dead transitions. [2024-06-03 21:27:06,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 198 transitions, 2323 flow [2024-06-03 21:27:06,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:27:06,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:27:06,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2024-06-03 21:27:06,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41515151515151516 [2024-06-03 21:27:06,974 INFO L175 Difference]: Start difference. First operand has 190 places, 179 transitions, 1767 flow. Second operand 10 states and 137 transitions. [2024-06-03 21:27:06,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 198 transitions, 2323 flow [2024-06-03 21:27:07,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 198 transitions, 2207 flow, removed 29 selfloop flow, removed 8 redundant places. [2024-06-03 21:27:07,035 INFO L231 Difference]: Finished difference. Result has 192 places, 181 transitions, 1788 flow [2024-06-03 21:27:07,035 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1651, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1788, PETRI_PLACES=192, PETRI_TRANSITIONS=181} [2024-06-03 21:27:07,035 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 160 predicate places. [2024-06-03 21:27:07,035 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 181 transitions, 1788 flow [2024-06-03 21:27:07,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:27:07,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:27:07,036 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:27:07,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-03 21:27:07,036 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-03 21:27:07,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:27:07,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1564870093, now seen corresponding path program 3 times [2024-06-03 21:27:07,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:27:07,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413159744] [2024-06-03 21:27:07,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:27:07,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:27:07,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:27:15,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:27:15,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:27:15,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413159744] [2024-06-03 21:27:15,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413159744] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:27:15,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:27:15,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:27:15,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203990884] [2024-06-03 21:27:15,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:27:15,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:27:15,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:27:15,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:27:15,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:27:15,663 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 21:27:15,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 181 transitions, 1788 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:27:15,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:27:15,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 21:27:15,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:27:16,122 INFO L124 PetriNetUnfolderBase]: 410/739 cut-off events. [2024-06-03 21:27:16,122 INFO L125 PetriNetUnfolderBase]: For 63026/63026 co-relation queries the response was YES. [2024-06-03 21:27:16,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6163 conditions, 739 events. 410/739 cut-off events. For 63026/63026 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3368 event pairs, 37 based on Foata normal form. 2/739 useless extension candidates. Maximal degree in co-relation 6069. Up to 566 conditions per place. [2024-06-03 21:27:16,128 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 158 selfloop transitions, 45 changer transitions 0/206 dead transitions. [2024-06-03 21:27:16,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 206 transitions, 2543 flow [2024-06-03 21:27:16,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:27:16,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:27:16,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions. [2024-06-03 21:27:16,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-03 21:27:16,129 INFO L175 Difference]: Start difference. First operand has 192 places, 181 transitions, 1788 flow. Second operand 10 states and 132 transitions. [2024-06-03 21:27:16,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 206 transitions, 2543 flow [2024-06-03 21:27:16,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 206 transitions, 2422 flow, removed 32 selfloop flow, removed 8 redundant places. [2024-06-03 21:27:16,198 INFO L231 Difference]: Finished difference. Result has 195 places, 186 transitions, 1905 flow [2024-06-03 21:27:16,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1667, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1905, PETRI_PLACES=195, PETRI_TRANSITIONS=186} [2024-06-03 21:27:16,199 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 163 predicate places. [2024-06-03 21:27:16,199 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 186 transitions, 1905 flow [2024-06-03 21:27:16,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:27:16,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:27:16,199 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:27:16,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-03 21:27:16,199 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-03 21:27:16,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:27:16,200 INFO L85 PathProgramCache]: Analyzing trace with hash 294005343, now seen corresponding path program 4 times [2024-06-03 21:27:16,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:27:16,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439031840] [2024-06-03 21:27:16,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:27:16,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:27:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:27:25,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-03 21:27:25,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:27:25,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439031840] [2024-06-03 21:27:25,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439031840] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:27:25,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:27:25,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:27:25,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011098482] [2024-06-03 21:27:25,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:27:25,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:27:25,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:27:25,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:27:25,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:27:25,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 21:27:25,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 186 transitions, 1905 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:27:25,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:27:25,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 21:27:25,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:27:26,208 INFO L124 PetriNetUnfolderBase]: 411/741 cut-off events. [2024-06-03 21:27:26,208 INFO L125 PetriNetUnfolderBase]: For 63403/63403 co-relation queries the response was YES. [2024-06-03 21:27:26,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6252 conditions, 741 events. 411/741 cut-off events. For 63403/63403 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3382 event pairs, 38 based on Foata normal form. 2/741 useless extension candidates. Maximal degree in co-relation 6156. Up to 569 conditions per place. [2024-06-03 21:27:26,216 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 160 selfloop transitions, 45 changer transitions 0/208 dead transitions. [2024-06-03 21:27:26,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 208 transitions, 2600 flow [2024-06-03 21:27:26,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:27:26,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:27:26,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-03 21:27:26,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403030303030303 [2024-06-03 21:27:26,218 INFO L175 Difference]: Start difference. First operand has 195 places, 186 transitions, 1905 flow. Second operand 10 states and 133 transitions. [2024-06-03 21:27:26,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 208 transitions, 2600 flow [2024-06-03 21:27:26,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 208 transitions, 2513 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-03 21:27:26,311 INFO L231 Difference]: Finished difference. Result has 199 places, 188 transitions, 1963 flow [2024-06-03 21:27:26,311 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1820, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1963, PETRI_PLACES=199, PETRI_TRANSITIONS=188} [2024-06-03 21:27:26,312 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 167 predicate places. [2024-06-03 21:27:26,313 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 188 transitions, 1963 flow [2024-06-03 21:27:26,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:27:26,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:27:26,313 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:27:26,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-03 21:27:26,313 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-03 21:27:26,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:27:26,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1585667142, now seen corresponding path program 4 times [2024-06-03 21:27:26,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:27:26,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685476354] [2024-06-03 21:27:26,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:27:26,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:27:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:27:37,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:27:37,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:27:37,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685476354] [2024-06-03 21:27:37,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685476354] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:27:37,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:27:37,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:27:37,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680940140] [2024-06-03 21:27:37,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:27:37,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:27:37,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:27:37,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:27:37,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:27:37,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 21:27:37,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 188 transitions, 1963 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:27:37,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:27:37,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 21:27:37,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:27:38,434 INFO L124 PetriNetUnfolderBase]: 414/748 cut-off events. [2024-06-03 21:27:38,434 INFO L125 PetriNetUnfolderBase]: For 63353/63353 co-relation queries the response was YES. [2024-06-03 21:27:38,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6380 conditions, 748 events. 414/748 cut-off events. For 63353/63353 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3420 event pairs, 39 based on Foata normal form. 1/747 useless extension candidates. Maximal degree in co-relation 6282. Up to 609 conditions per place. [2024-06-03 21:27:38,442 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 165 selfloop transitions, 38 changer transitions 0/206 dead transitions. [2024-06-03 21:27:38,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 206 transitions, 2517 flow [2024-06-03 21:27:38,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:27:38,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:27:38,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2024-06-03 21:27:38,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41515151515151516 [2024-06-03 21:27:38,444 INFO L175 Difference]: Start difference. First operand has 199 places, 188 transitions, 1963 flow. Second operand 10 states and 137 transitions. [2024-06-03 21:27:38,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 206 transitions, 2517 flow [2024-06-03 21:27:38,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 206 transitions, 2415 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-03 21:27:38,550 INFO L231 Difference]: Finished difference. Result has 202 places, 190 transitions, 2020 flow [2024-06-03 21:27:38,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1861, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2020, PETRI_PLACES=202, PETRI_TRANSITIONS=190} [2024-06-03 21:27:38,551 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 170 predicate places. [2024-06-03 21:27:38,551 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 190 transitions, 2020 flow [2024-06-03 21:27:38,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:27:38,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:27:38,551 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:27:38,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-03 21:27:38,552 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-03 21:27:38,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:27:38,552 INFO L85 PathProgramCache]: Analyzing trace with hash -533649658, now seen corresponding path program 5 times [2024-06-03 21:27:38,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:27:38,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665286366] [2024-06-03 21:27:38,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:27:38,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:27:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:27:50,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:27:50,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:27:50,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665286366] [2024-06-03 21:27:50,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665286366] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:27:50,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:27:50,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:27:50,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418401742] [2024-06-03 21:27:50,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:27:50,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:27:50,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:27:50,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:27:50,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:27:50,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 21:27:50,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 190 transitions, 2020 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:27:50,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:27:50,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 21:27:50,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:27:51,050 INFO L124 PetriNetUnfolderBase]: 417/755 cut-off events. [2024-06-03 21:27:51,050 INFO L125 PetriNetUnfolderBase]: For 65753/65753 co-relation queries the response was YES. [2024-06-03 21:27:51,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6464 conditions, 755 events. 417/755 cut-off events. For 65753/65753 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3482 event pairs, 43 based on Foata normal form. 1/754 useless extension candidates. Maximal degree in co-relation 6365. Up to 622 conditions per place. [2024-06-03 21:27:51,057 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 170 selfloop transitions, 33 changer transitions 0/206 dead transitions. [2024-06-03 21:27:51,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 206 transitions, 2598 flow [2024-06-03 21:27:51,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:27:51,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:27:51,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 136 transitions. [2024-06-03 21:27:51,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121212121212121 [2024-06-03 21:27:51,058 INFO L175 Difference]: Start difference. First operand has 202 places, 190 transitions, 2020 flow. Second operand 10 states and 136 transitions. [2024-06-03 21:27:51,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 206 transitions, 2598 flow [2024-06-03 21:27:51,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 206 transitions, 2455 flow, removed 35 selfloop flow, removed 8 redundant places. [2024-06-03 21:27:51,163 INFO L231 Difference]: Finished difference. Result has 204 places, 192 transitions, 2030 flow [2024-06-03 21:27:51,164 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1877, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2030, PETRI_PLACES=204, PETRI_TRANSITIONS=192} [2024-06-03 21:27:51,164 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 172 predicate places. [2024-06-03 21:27:51,164 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 192 transitions, 2030 flow [2024-06-03 21:27:51,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:27:51,164 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:27:51,165 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:27:51,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-03 21:27:51,165 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-03 21:27:51,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:27:51,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1346022827, now seen corresponding path program 5 times [2024-06-03 21:27:51,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:27:51,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349596863] [2024-06-03 21:27:51,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:27:51,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:27:51,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:27:59,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-03 21:27:59,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:27:59,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349596863] [2024-06-03 21:27:59,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349596863] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:27:59,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:27:59,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:27:59,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163133761] [2024-06-03 21:27:59,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:27:59,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:27:59,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:27:59,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:27:59,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:28:00,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 21:28:00,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 192 transitions, 2030 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:28:00,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:28:00,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 21:28:00,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:28:00,421 INFO L124 PetriNetUnfolderBase]: 429/775 cut-off events. [2024-06-03 21:28:00,422 INFO L125 PetriNetUnfolderBase]: For 74449/74449 co-relation queries the response was YES. [2024-06-03 21:28:00,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6664 conditions, 775 events. 429/775 cut-off events. For 74449/74449 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3568 event pairs, 43 based on Foata normal form. 4/777 useless extension candidates. Maximal degree in co-relation 6564. Up to 633 conditions per place. [2024-06-03 21:28:00,428 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 173 selfloop transitions, 34 changer transitions 0/210 dead transitions. [2024-06-03 21:28:00,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 210 transitions, 2638 flow [2024-06-03 21:28:00,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:28:00,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:28:00,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 138 transitions. [2024-06-03 21:28:00,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41818181818181815 [2024-06-03 21:28:00,430 INFO L175 Difference]: Start difference. First operand has 204 places, 192 transitions, 2030 flow. Second operand 10 states and 138 transitions. [2024-06-03 21:28:00,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 210 transitions, 2638 flow [2024-06-03 21:28:00,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 210 transitions, 2501 flow, removed 37 selfloop flow, removed 8 redundant places. [2024-06-03 21:28:00,541 INFO L231 Difference]: Finished difference. Result has 206 places, 195 transitions, 2061 flow [2024-06-03 21:28:00,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1893, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2061, PETRI_PLACES=206, PETRI_TRANSITIONS=195} [2024-06-03 21:28:00,541 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 174 predicate places. [2024-06-03 21:28:00,541 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 195 transitions, 2061 flow [2024-06-03 21:28:00,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:28:00,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:28:00,542 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:28:00,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-03 21:28:00,542 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-03 21:28:00,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:28:00,542 INFO L85 PathProgramCache]: Analyzing trace with hash -526290351, now seen corresponding path program 6 times [2024-06-03 21:28:00,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:28:00,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104613772] [2024-06-03 21:28:00,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:28:00,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:28:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:28:08,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:28:08,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:28:08,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104613772] [2024-06-03 21:28:08,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104613772] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:28:08,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:28:08,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:28:08,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278111071] [2024-06-03 21:28:08,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:28:08,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:28:08,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:28:08,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:28:08,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:28:09,063 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 21:28:09,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 195 transitions, 2061 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:28:09,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:28:09,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 21:28:09,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:28:09,502 INFO L124 PetriNetUnfolderBase]: 452/814 cut-off events. [2024-06-03 21:28:09,503 INFO L125 PetriNetUnfolderBase]: For 79937/79937 co-relation queries the response was YES. [2024-06-03 21:28:09,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7334 conditions, 814 events. 452/814 cut-off events. For 79937/79937 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 3820 event pairs, 41 based on Foata normal form. 1/813 useless extension candidates. Maximal degree in co-relation 7233. Up to 564 conditions per place. [2024-06-03 21:28:09,509 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 157 selfloop transitions, 65 changer transitions 0/225 dead transitions. [2024-06-03 21:28:09,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 225 transitions, 3295 flow [2024-06-03 21:28:09,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:28:09,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:28:09,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 135 transitions. [2024-06-03 21:28:09,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2024-06-03 21:28:09,511 INFO L175 Difference]: Start difference. First operand has 206 places, 195 transitions, 2061 flow. Second operand 10 states and 135 transitions. [2024-06-03 21:28:09,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 225 transitions, 3295 flow [2024-06-03 21:28:09,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 225 transitions, 3097 flow, removed 66 selfloop flow, removed 8 redundant places. [2024-06-03 21:28:09,633 INFO L231 Difference]: Finished difference. Result has 209 places, 209 transitions, 2402 flow [2024-06-03 21:28:09,633 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1923, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2402, PETRI_PLACES=209, PETRI_TRANSITIONS=209} [2024-06-03 21:28:09,633 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 177 predicate places. [2024-06-03 21:28:09,633 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 209 transitions, 2402 flow [2024-06-03 21:28:09,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:28:09,634 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:28:09,634 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:28:09,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-03 21:28:09,634 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-03 21:28:09,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:28:09,634 INFO L85 PathProgramCache]: Analyzing trace with hash -526290072, now seen corresponding path program 1 times [2024-06-03 21:28:09,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:28:09,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569365676] [2024-06-03 21:28:09,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:28:09,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:28:09,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:28:19,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:28:19,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:28:19,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569365676] [2024-06-03 21:28:19,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569365676] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:28:19,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:28:19,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:28:19,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741698607] [2024-06-03 21:28:19,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:28:19,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:28:19,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:28:19,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:28:19,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:28:19,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 21:28:19,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 209 transitions, 2402 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:28:19,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:28:19,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 21:28:19,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:28:19,830 INFO L124 PetriNetUnfolderBase]: 455/818 cut-off events. [2024-06-03 21:28:19,831 INFO L125 PetriNetUnfolderBase]: For 82049/82049 co-relation queries the response was YES. [2024-06-03 21:28:19,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7487 conditions, 818 events. 455/818 cut-off events. For 82049/82049 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 3842 event pairs, 37 based on Foata normal form. 1/817 useless extension candidates. Maximal degree in co-relation 7384. Up to 708 conditions per place. [2024-06-03 21:28:19,838 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 189 selfloop transitions, 32 changer transitions 0/224 dead transitions. [2024-06-03 21:28:19,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 224 transitions, 2928 flow [2024-06-03 21:28:19,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:28:19,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:28:19,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-03 21:28:19,840 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37575757575757573 [2024-06-03 21:28:19,841 INFO L175 Difference]: Start difference. First operand has 209 places, 209 transitions, 2402 flow. Second operand 10 states and 124 transitions. [2024-06-03 21:28:19,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 224 transitions, 2928 flow [2024-06-03 21:28:19,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 224 transitions, 2830 flow, removed 41 selfloop flow, removed 3 redundant places. [2024-06-03 21:28:19,973 INFO L231 Difference]: Finished difference. Result has 216 places, 211 transitions, 2425 flow [2024-06-03 21:28:19,973 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2304, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2425, PETRI_PLACES=216, PETRI_TRANSITIONS=211} [2024-06-03 21:28:19,974 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 184 predicate places. [2024-06-03 21:28:19,974 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 211 transitions, 2425 flow [2024-06-03 21:28:19,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:28:19,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:28:19,974 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:28:19,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-03 21:28:19,975 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-03 21:28:19,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:28:19,975 INFO L85 PathProgramCache]: Analyzing trace with hash -533440191, now seen corresponding path program 7 times [2024-06-03 21:28:19,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:28:19,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643807857] [2024-06-03 21:28:19,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:28:19,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:28:20,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:28:28,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:28:28,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:28:28,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643807857] [2024-06-03 21:28:28,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643807857] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:28:28,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:28:28,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:28:28,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524079008] [2024-06-03 21:28:28,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:28:28,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:28:28,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:28:28,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:28:28,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:28:28,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 21:28:28,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 211 transitions, 2425 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:28:28,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:28:28,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 21:28:28,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:28:29,454 INFO L124 PetriNetUnfolderBase]: 466/837 cut-off events. [2024-06-03 21:28:29,454 INFO L125 PetriNetUnfolderBase]: For 88345/88345 co-relation queries the response was YES. [2024-06-03 21:28:29,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7702 conditions, 837 events. 466/837 cut-off events. For 88345/88345 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 3947 event pairs, 43 based on Foata normal form. 2/837 useless extension candidates. Maximal degree in co-relation 7597. Up to 664 conditions per place. [2024-06-03 21:28:29,460 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 183 selfloop transitions, 47 changer transitions 0/233 dead transitions. [2024-06-03 21:28:29,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 233 transitions, 3252 flow [2024-06-03 21:28:29,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:28:29,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:28:29,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-03 21:28:29,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403030303030303 [2024-06-03 21:28:29,462 INFO L175 Difference]: Start difference. First operand has 216 places, 211 transitions, 2425 flow. Second operand 10 states and 133 transitions. [2024-06-03 21:28:29,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 233 transitions, 3252 flow [2024-06-03 21:28:29,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 233 transitions, 3149 flow, removed 20 selfloop flow, removed 8 redundant places. [2024-06-03 21:28:29,598 INFO L231 Difference]: Finished difference. Result has 218 places, 216 transitions, 2578 flow [2024-06-03 21:28:29,598 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2324, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2578, PETRI_PLACES=218, PETRI_TRANSITIONS=216} [2024-06-03 21:28:29,598 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 186 predicate places. [2024-06-03 21:28:29,598 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 216 transitions, 2578 flow [2024-06-03 21:28:29,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:28:29,599 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:28:29,599 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:28:29,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-03 21:28:29,599 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-03 21:28:29,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:28:29,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1758801846, now seen corresponding path program 6 times [2024-06-03 21:28:29,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:28:29,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004975824] [2024-06-03 21:28:29,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:28:29,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:28:29,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:28:44,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-03 21:28:44,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:28:44,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004975824] [2024-06-03 21:28:44,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004975824] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:28:44,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:28:44,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:28:44,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136908409] [2024-06-03 21:28:44,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:28:44,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:28:44,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:28:44,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:28:44,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:28:44,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 21:28:44,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 216 transitions, 2578 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:28:44,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:28:44,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 21:28:44,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:28:44,600 INFO L124 PetriNetUnfolderBase]: 469/844 cut-off events. [2024-06-03 21:28:44,601 INFO L125 PetriNetUnfolderBase]: For 89492/89492 co-relation queries the response was YES. [2024-06-03 21:28:44,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7866 conditions, 844 events. 469/844 cut-off events. For 89492/89492 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4011 event pairs, 43 based on Foata normal form. 1/843 useless extension candidates. Maximal degree in co-relation 7760. Up to 698 conditions per place. [2024-06-03 21:28:44,608 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 191 selfloop transitions, 37 changer transitions 0/231 dead transitions. [2024-06-03 21:28:44,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 231 transitions, 3154 flow [2024-06-03 21:28:44,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:28:44,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:28:44,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2024-06-03 21:28:44,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3878787878787879 [2024-06-03 21:28:44,610 INFO L175 Difference]: Start difference. First operand has 218 places, 216 transitions, 2578 flow. Second operand 10 states and 128 transitions. [2024-06-03 21:28:44,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 231 transitions, 3154 flow [2024-06-03 21:28:44,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 231 transitions, 3026 flow, removed 41 selfloop flow, removed 6 redundant places. [2024-06-03 21:28:44,748 INFO L231 Difference]: Finished difference. Result has 222 places, 218 transitions, 2619 flow [2024-06-03 21:28:44,748 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2450, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2619, PETRI_PLACES=222, PETRI_TRANSITIONS=218} [2024-06-03 21:28:44,749 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 190 predicate places. [2024-06-03 21:28:44,749 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 218 transitions, 2619 flow [2024-06-03 21:28:44,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:28:44,749 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:28:44,749 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:28:44,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-03 21:28:44,749 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-03 21:28:44,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:28:44,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1758802063, now seen corresponding path program 8 times [2024-06-03 21:28:44,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:28:44,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119521288] [2024-06-03 21:28:44,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:28:44,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:28:44,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:28:54,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:28:54,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:28:54,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119521288] [2024-06-03 21:28:54,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119521288] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:28:54,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:28:54,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:28:54,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940104906] [2024-06-03 21:28:54,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:28:54,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:28:54,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:28:54,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:28:54,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:28:54,356 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 21:28:54,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 218 transitions, 2619 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:28:54,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:28:54,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 21:28:54,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:28:54,786 INFO L124 PetriNetUnfolderBase]: 467/841 cut-off events. [2024-06-03 21:28:54,786 INFO L125 PetriNetUnfolderBase]: For 89022/89022 co-relation queries the response was YES. [2024-06-03 21:28:54,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7802 conditions, 841 events. 467/841 cut-off events. For 89022/89022 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 3994 event pairs, 42 based on Foata normal form. 1/840 useless extension candidates. Maximal degree in co-relation 7694. Up to 686 conditions per place. [2024-06-03 21:28:54,794 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 191 selfloop transitions, 41 changer transitions 0/235 dead transitions. [2024-06-03 21:28:54,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 235 transitions, 3176 flow [2024-06-03 21:28:54,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:28:54,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:28:54,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2024-06-03 21:28:54,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2024-06-03 21:28:54,796 INFO L175 Difference]: Start difference. First operand has 222 places, 218 transitions, 2619 flow. Second operand 10 states and 130 transitions. [2024-06-03 21:28:54,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 235 transitions, 3176 flow [2024-06-03 21:28:54,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 235 transitions, 3023 flow, removed 41 selfloop flow, removed 8 redundant places. [2024-06-03 21:28:54,939 INFO L231 Difference]: Finished difference. Result has 225 places, 222 transitions, 2626 flow [2024-06-03 21:28:54,939 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2466, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2626, PETRI_PLACES=225, PETRI_TRANSITIONS=222} [2024-06-03 21:28:54,940 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 193 predicate places. [2024-06-03 21:28:54,940 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 222 transitions, 2626 flow [2024-06-03 21:28:54,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:28:54,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:28:54,940 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:28:54,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-03 21:28:54,940 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-03 21:28:54,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:28:54,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1466433334, now seen corresponding path program 7 times [2024-06-03 21:28:54,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:28:54,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230835680] [2024-06-03 21:28:54,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:28:54,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:28:55,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:29:06,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:29:06,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:29:06,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230835680] [2024-06-03 21:29:06,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230835680] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:29:06,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:29:06,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:29:06,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144664188] [2024-06-03 21:29:06,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:29:06,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:29:06,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:29:06,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:29:06,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:29:06,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 21:29:06,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 222 transitions, 2626 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:29:06,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:29:06,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 21:29:06,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:29:06,707 INFO L124 PetriNetUnfolderBase]: 470/848 cut-off events. [2024-06-03 21:29:06,707 INFO L125 PetriNetUnfolderBase]: For 91433/91433 co-relation queries the response was YES. [2024-06-03 21:29:06,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7894 conditions, 848 events. 470/848 cut-off events. For 91433/91433 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4050 event pairs, 42 based on Foata normal form. 1/847 useless extension candidates. Maximal degree in co-relation 7784. Up to 657 conditions per place. [2024-06-03 21:29:06,716 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 179 selfloop transitions, 54 changer transitions 0/236 dead transitions. [2024-06-03 21:29:06,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 236 transitions, 3212 flow [2024-06-03 21:29:06,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:29:06,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:29:06,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2024-06-03 21:29:06,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41515151515151516 [2024-06-03 21:29:06,718 INFO L175 Difference]: Start difference. First operand has 225 places, 222 transitions, 2626 flow. Second operand 10 states and 137 transitions. [2024-06-03 21:29:06,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 236 transitions, 3212 flow [2024-06-03 21:29:06,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 236 transitions, 3104 flow, removed 35 selfloop flow, removed 5 redundant places. [2024-06-03 21:29:06,859 INFO L231 Difference]: Finished difference. Result has 230 places, 224 transitions, 2725 flow [2024-06-03 21:29:06,859 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2518, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2725, PETRI_PLACES=230, PETRI_TRANSITIONS=224} [2024-06-03 21:29:06,860 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 198 predicate places. [2024-06-03 21:29:06,860 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 224 transitions, 2725 flow [2024-06-03 21:29:06,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:29:06,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:29:06,860 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:29:06,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-03 21:29:06,861 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-03 21:29:06,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:29:06,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1466433117, now seen corresponding path program 9 times [2024-06-03 21:29:06,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:29:06,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573884751] [2024-06-03 21:29:06,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:29:06,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:29:06,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:29:15,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:29:15,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:29:15,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573884751] [2024-06-03 21:29:15,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573884751] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:29:15,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:29:15,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:29:15,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034462787] [2024-06-03 21:29:15,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:29:15,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:29:15,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:29:15,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:29:15,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:29:16,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 21:29:16,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 224 transitions, 2725 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:29:16,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:29:16,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 21:29:16,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:29:16,548 INFO L124 PetriNetUnfolderBase]: 468/845 cut-off events. [2024-06-03 21:29:16,549 INFO L125 PetriNetUnfolderBase]: For 90721/90721 co-relation queries the response was YES. [2024-06-03 21:29:16,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7885 conditions, 845 events. 468/845 cut-off events. For 90721/90721 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4047 event pairs, 43 based on Foata normal form. 1/844 useless extension candidates. Maximal degree in co-relation 7773. Up to 617 conditions per place. [2024-06-03 21:29:16,557 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 167 selfloop transitions, 68 changer transitions 0/238 dead transitions. [2024-06-03 21:29:16,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 238 transitions, 3388 flow [2024-06-03 21:29:16,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:29:16,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:29:16,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 131 transitions. [2024-06-03 21:29:16,558 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.396969696969697 [2024-06-03 21:29:16,558 INFO L175 Difference]: Start difference. First operand has 230 places, 224 transitions, 2725 flow. Second operand 10 states and 131 transitions. [2024-06-03 21:29:16,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 238 transitions, 3388 flow [2024-06-03 21:29:16,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 238 transitions, 3151 flow, removed 66 selfloop flow, removed 8 redundant places. [2024-06-03 21:29:16,692 INFO L231 Difference]: Finished difference. Result has 233 places, 225 transitions, 2684 flow [2024-06-03 21:29:16,692 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2488, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2684, PETRI_PLACES=233, PETRI_TRANSITIONS=225} [2024-06-03 21:29:16,692 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 201 predicate places. [2024-06-03 21:29:16,692 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 225 transitions, 2684 flow [2024-06-03 21:29:16,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:29:16,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:29:16,693 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:29:16,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-03 21:29:16,693 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-03 21:29:16,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:29:16,693 INFO L85 PathProgramCache]: Analyzing trace with hash -526030602, now seen corresponding path program 2 times [2024-06-03 21:29:16,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:29:16,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466301366] [2024-06-03 21:29:16,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:29:16,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:29:16,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:29:26,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:29:26,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:29:26,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466301366] [2024-06-03 21:29:26,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466301366] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:29:26,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:29:26,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:29:26,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928465059] [2024-06-03 21:29:26,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:29:26,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:29:26,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:29:26,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:29:26,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:29:26,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 21:29:26,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 225 transitions, 2684 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:29:26,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:29:26,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 21:29:26,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:29:27,040 INFO L124 PetriNetUnfolderBase]: 471/847 cut-off events. [2024-06-03 21:29:27,040 INFO L125 PetriNetUnfolderBase]: For 93006/93006 co-relation queries the response was YES. [2024-06-03 21:29:27,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7949 conditions, 847 events. 471/847 cut-off events. For 93006/93006 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4021 event pairs, 37 based on Foata normal form. 1/846 useless extension candidates. Maximal degree in co-relation 7835. Up to 735 conditions per place. [2024-06-03 21:29:27,049 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 202 selfloop transitions, 35 changer transitions 0/240 dead transitions. [2024-06-03 21:29:27,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 240 transitions, 3246 flow [2024-06-03 21:29:27,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:29:27,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:29:27,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-03 21:29:27,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37272727272727274 [2024-06-03 21:29:27,050 INFO L175 Difference]: Start difference. First operand has 233 places, 225 transitions, 2684 flow. Second operand 10 states and 123 transitions. [2024-06-03 21:29:27,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 240 transitions, 3246 flow [2024-06-03 21:29:27,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 240 transitions, 3144 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-03 21:29:27,190 INFO L231 Difference]: Finished difference. Result has 236 places, 227 transitions, 2713 flow [2024-06-03 21:29:27,190 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2582, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2713, PETRI_PLACES=236, PETRI_TRANSITIONS=227} [2024-06-03 21:29:27,191 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 204 predicate places. [2024-06-03 21:29:27,191 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 227 transitions, 2713 flow [2024-06-03 21:29:27,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:29:27,191 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:29:27,191 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:29:27,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-03 21:29:27,191 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-03 21:29:27,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:29:27,192 INFO L85 PathProgramCache]: Analyzing trace with hash -526030881, now seen corresponding path program 10 times [2024-06-03 21:29:27,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:29:27,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836137233] [2024-06-03 21:29:27,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:29:27,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:29:27,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:29:36,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:29:36,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:29:36,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836137233] [2024-06-03 21:29:36,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836137233] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:29:36,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:29:36,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:29:36,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138570485] [2024-06-03 21:29:36,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:29:36,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:29:36,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:29:36,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:29:36,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:29:36,211 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 21:29:36,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 227 transitions, 2713 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:29:36,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:29:36,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 21:29:36,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:29:36,625 INFO L124 PetriNetUnfolderBase]: 469/845 cut-off events. [2024-06-03 21:29:36,626 INFO L125 PetriNetUnfolderBase]: For 91792/91792 co-relation queries the response was YES. [2024-06-03 21:29:36,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7828 conditions, 845 events. 469/845 cut-off events. For 91792/91792 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4028 event pairs, 43 based on Foata normal form. 1/844 useless extension candidates. Maximal degree in co-relation 7713. Up to 620 conditions per place. [2024-06-03 21:29:36,635 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 162 selfloop transitions, 74 changer transitions 0/239 dead transitions. [2024-06-03 21:29:36,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 239 transitions, 3215 flow [2024-06-03 21:29:36,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:29:36,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:29:36,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2024-06-03 21:29:36,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2024-06-03 21:29:36,636 INFO L175 Difference]: Start difference. First operand has 236 places, 227 transitions, 2713 flow. Second operand 10 states and 130 transitions. [2024-06-03 21:29:36,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 239 transitions, 3215 flow [2024-06-03 21:29:36,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 239 transitions, 3072 flow, removed 38 selfloop flow, removed 8 redundant places. [2024-06-03 21:29:36,802 INFO L231 Difference]: Finished difference. Result has 238 places, 227 transitions, 2723 flow [2024-06-03 21:29:36,802 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2570, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2723, PETRI_PLACES=238, PETRI_TRANSITIONS=227} [2024-06-03 21:29:36,803 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 206 predicate places. [2024-06-03 21:29:36,803 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 227 transitions, 2723 flow [2024-06-03 21:29:36,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:29:36,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:29:36,803 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:29:36,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-03 21:29:36,804 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-03 21:29:36,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:29:36,804 INFO L85 PathProgramCache]: Analyzing trace with hash -526021302, now seen corresponding path program 3 times [2024-06-03 21:29:36,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:29:36,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112199650] [2024-06-03 21:29:36,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:29:36,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:29:36,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:29:46,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:29:46,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:29:46,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112199650] [2024-06-03 21:29:46,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112199650] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:29:46,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:29:46,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:29:46,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364004483] [2024-06-03 21:29:46,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:29:46,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:29:46,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:29:46,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:29:46,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:29:46,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 21:29:46,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 227 transitions, 2723 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:29:46,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:29:46,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 21:29:46,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:29:47,100 INFO L124 PetriNetUnfolderBase]: 467/843 cut-off events. [2024-06-03 21:29:47,100 INFO L125 PetriNetUnfolderBase]: For 90933/90933 co-relation queries the response was YES. [2024-06-03 21:29:47,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7782 conditions, 843 events. 467/843 cut-off events. For 90933/90933 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4018 event pairs, 37 based on Foata normal form. 1/842 useless extension candidates. Maximal degree in co-relation 7666. Up to 714 conditions per place. [2024-06-03 21:29:47,108 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 193 selfloop transitions, 44 changer transitions 0/240 dead transitions. [2024-06-03 21:29:47,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 240 transitions, 3233 flow [2024-06-03 21:29:47,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:29:47,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:29:47,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-03 21:29:47,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37575757575757573 [2024-06-03 21:29:47,110 INFO L175 Difference]: Start difference. First operand has 238 places, 227 transitions, 2723 flow. Second operand 10 states and 124 transitions. [2024-06-03 21:29:47,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 240 transitions, 3233 flow [2024-06-03 21:29:47,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 240 transitions, 3096 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-06-03 21:29:47,268 INFO L231 Difference]: Finished difference. Result has 239 places, 227 transitions, 2679 flow [2024-06-03 21:29:47,268 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2586, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2679, PETRI_PLACES=239, PETRI_TRANSITIONS=227} [2024-06-03 21:29:47,269 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 207 predicate places. [2024-06-03 21:29:47,269 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 227 transitions, 2679 flow [2024-06-03 21:29:47,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:29:47,269 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:29:47,269 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:29:47,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-03 21:29:47,269 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-03 21:29:47,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:29:47,270 INFO L85 PathProgramCache]: Analyzing trace with hash -526020961, now seen corresponding path program 1 times [2024-06-03 21:29:47,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:29:47,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906086307] [2024-06-03 21:29:47,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:29:47,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:29:47,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:29:56,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:29:56,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:29:56,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906086307] [2024-06-03 21:29:56,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906086307] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:29:56,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:29:56,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:29:56,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39189259] [2024-06-03 21:29:56,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:29:56,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:29:56,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:29:56,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:29:56,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:29:56,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-03 21:29:56,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 227 transitions, 2679 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:29:56,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:29:56,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-03 21:29:56,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:29:56,622 INFO L124 PetriNetUnfolderBase]: 445/820 cut-off events. [2024-06-03 21:29:56,623 INFO L125 PetriNetUnfolderBase]: For 97387/97388 co-relation queries the response was YES. [2024-06-03 21:29:56,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7611 conditions, 820 events. 445/820 cut-off events. For 97387/97388 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 3995 event pairs, 35 based on Foata normal form. 3/821 useless extension candidates. Maximal degree in co-relation 7494. Up to 676 conditions per place. [2024-06-03 21:29:56,631 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 189 selfloop transitions, 17 changer transitions 0/242 dead transitions. [2024-06-03 21:29:56,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 242 transitions, 3153 flow [2024-06-03 21:29:56,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:29:56,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:29:56,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 138 transitions. [2024-06-03 21:29:56,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41818181818181815 [2024-06-03 21:29:56,633 INFO L175 Difference]: Start difference. First operand has 239 places, 227 transitions, 2679 flow. Second operand 10 states and 138 transitions. [2024-06-03 21:29:56,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 242 transitions, 3153 flow [2024-06-03 21:29:56,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 242 transitions, 2951 flow, removed 23 selfloop flow, removed 11 redundant places. [2024-06-03 21:29:56,822 INFO L231 Difference]: Finished difference. Result has 238 places, 228 transitions, 2541 flow [2024-06-03 21:29:56,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2477, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2541, PETRI_PLACES=238, PETRI_TRANSITIONS=228} [2024-06-03 21:29:56,823 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 206 predicate places. [2024-06-03 21:29:56,823 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 228 transitions, 2541 flow [2024-06-03 21:29:56,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:29:56,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:29:56,823 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:29:56,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-03 21:29:56,823 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-03 21:29:56,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:29:56,824 INFO L85 PathProgramCache]: Analyzing trace with hash 474796629, now seen corresponding path program 2 times [2024-06-03 21:29:56,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:29:56,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109563785] [2024-06-03 21:29:56,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:29:56,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:29:56,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:30:07,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-03 21:30:07,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:30:07,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109563785] [2024-06-03 21:30:07,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109563785] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:30:07,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:30:07,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:30:07,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52511012] [2024-06-03 21:30:07,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:30:07,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:30:07,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:30:07,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:30:07,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:30:07,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 21:30:07,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 228 transitions, 2541 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:30:07,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:30:07,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 21:30:07,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:30:07,962 INFO L124 PetriNetUnfolderBase]: 449/827 cut-off events. [2024-06-03 21:30:07,962 INFO L125 PetriNetUnfolderBase]: For 99832/99835 co-relation queries the response was YES. [2024-06-03 21:30:07,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7524 conditions, 827 events. 449/827 cut-off events. For 99832/99835 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4050 event pairs, 39 based on Foata normal form. 3/826 useless extension candidates. Maximal degree in co-relation 7409. Up to 688 conditions per place. [2024-06-03 21:30:07,969 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 186 selfloop transitions, 18 changer transitions 0/240 dead transitions. [2024-06-03 21:30:07,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 240 transitions, 3001 flow [2024-06-03 21:30:07,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:30:07,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:30:07,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-03 21:30:07,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38484848484848483 [2024-06-03 21:30:07,970 INFO L175 Difference]: Start difference. First operand has 238 places, 228 transitions, 2541 flow. Second operand 10 states and 127 transitions. [2024-06-03 21:30:07,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 240 transitions, 3001 flow [2024-06-03 21:30:08,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 240 transitions, 2937 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-03 21:30:08,145 INFO L231 Difference]: Finished difference. Result has 240 places, 229 transitions, 2545 flow [2024-06-03 21:30:08,145 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2477, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2545, PETRI_PLACES=240, PETRI_TRANSITIONS=229} [2024-06-03 21:30:08,146 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 208 predicate places. [2024-06-03 21:30:08,146 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 229 transitions, 2545 flow [2024-06-03 21:30:08,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:30:08,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:30:08,146 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:30:08,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-03 21:30:08,146 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-03 21:30:08,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:30:08,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1326882317, now seen corresponding path program 11 times [2024-06-03 21:30:08,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:30:08,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962448256] [2024-06-03 21:30:08,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:30:08,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:30:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:30:17,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:30:17,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:30:17,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962448256] [2024-06-03 21:30:17,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962448256] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:30:17,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:30:17,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:30:17,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76010372] [2024-06-03 21:30:17,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:30:17,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:30:17,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:30:17,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:30:17,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:30:17,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 21:30:17,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 229 transitions, 2545 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:30:17,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:30:17,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 21:30:17,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:30:18,029 INFO L124 PetriNetUnfolderBase]: 501/900 cut-off events. [2024-06-03 21:30:18,029 INFO L125 PetriNetUnfolderBase]: For 115035/115038 co-relation queries the response was YES. [2024-06-03 21:30:18,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8549 conditions, 900 events. 501/900 cut-off events. For 115035/115038 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4354 event pairs, 53 based on Foata normal form. 2/897 useless extension candidates. Maximal degree in co-relation 8433. Up to 672 conditions per place. [2024-06-03 21:30:18,038 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 192 selfloop transitions, 54 changer transitions 0/249 dead transitions. [2024-06-03 21:30:18,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 249 transitions, 3460 flow [2024-06-03 21:30:18,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:30:18,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:30:18,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 136 transitions. [2024-06-03 21:30:18,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121212121212121 [2024-06-03 21:30:18,040 INFO L175 Difference]: Start difference. First operand has 240 places, 229 transitions, 2545 flow. Second operand 10 states and 136 transitions. [2024-06-03 21:30:18,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 249 transitions, 3460 flow [2024-06-03 21:30:18,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 249 transitions, 3402 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-03 21:30:18,232 INFO L231 Difference]: Finished difference. Result has 243 places, 234 transitions, 2789 flow [2024-06-03 21:30:18,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2487, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2789, PETRI_PLACES=243, PETRI_TRANSITIONS=234} [2024-06-03 21:30:18,232 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 211 predicate places. [2024-06-03 21:30:18,232 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 234 transitions, 2789 flow [2024-06-03 21:30:18,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:30:18,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:30:18,233 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:30:18,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-03 21:30:18,233 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-03 21:30:18,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:30:18,234 INFO L85 PathProgramCache]: Analyzing trace with hash 217697951, now seen corresponding path program 3 times [2024-06-03 21:30:18,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:30:18,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350532711] [2024-06-03 21:30:18,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:30:18,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:30:18,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:30:27,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:30:27,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:30:27,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350532711] [2024-06-03 21:30:27,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350532711] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:30:27,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:30:27,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:30:27,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700915911] [2024-06-03 21:30:27,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:30:27,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:30:27,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:30:27,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:30:27,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:30:27,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-03 21:30:27,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 234 transitions, 2789 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:30:27,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:30:27,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-03 21:30:27,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:30:27,837 INFO L124 PetriNetUnfolderBase]: 478/878 cut-off events. [2024-06-03 21:30:27,837 INFO L125 PetriNetUnfolderBase]: For 120342/120346 co-relation queries the response was YES. [2024-06-03 21:30:27,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8606 conditions, 878 events. 478/878 cut-off events. For 120342/120346 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 4353 event pairs, 42 based on Foata normal form. 5/879 useless extension candidates. Maximal degree in co-relation 8488. Up to 727 conditions per place. [2024-06-03 21:30:27,846 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 191 selfloop transitions, 20 changer transitions 0/247 dead transitions. [2024-06-03 21:30:27,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 247 transitions, 3271 flow [2024-06-03 21:30:27,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:30:27,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:30:27,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2024-06-03 21:30:27,847 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41515151515151516 [2024-06-03 21:30:27,847 INFO L175 Difference]: Start difference. First operand has 243 places, 234 transitions, 2789 flow. Second operand 10 states and 137 transitions. [2024-06-03 21:30:27,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 247 transitions, 3271 flow [2024-06-03 21:30:28,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 247 transitions, 3147 flow, removed 32 selfloop flow, removed 6 redundant places. [2024-06-03 21:30:28,044 INFO L231 Difference]: Finished difference. Result has 247 places, 235 transitions, 2739 flow [2024-06-03 21:30:28,044 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2665, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2739, PETRI_PLACES=247, PETRI_TRANSITIONS=235} [2024-06-03 21:30:28,044 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 215 predicate places. [2024-06-03 21:30:28,044 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 235 transitions, 2739 flow [2024-06-03 21:30:28,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:30:28,045 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:30:28,045 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:30:28,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-03 21:30:28,045 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-03 21:30:28,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:30:28,045 INFO L85 PathProgramCache]: Analyzing trace with hash 790986399, now seen corresponding path program 4 times [2024-06-03 21:30:28,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:30:28,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14274923] [2024-06-03 21:30:28,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:30:28,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:30:28,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:30:37,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:30:37,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:30:37,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14274923] [2024-06-03 21:30:37,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14274923] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:30:37,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:30:37,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:30:37,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650369886] [2024-06-03 21:30:37,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:30:37,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:30:37,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:30:37,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:30:37,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:30:37,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-03 21:30:37,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 235 transitions, 2739 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:30:37,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:30:37,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-03 21:30:37,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:30:38,094 INFO L124 PetriNetUnfolderBase]: 486/894 cut-off events. [2024-06-03 21:30:38,094 INFO L125 PetriNetUnfolderBase]: For 129311/129314 co-relation queries the response was YES. [2024-06-03 21:30:38,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8866 conditions, 894 events. 486/894 cut-off events. For 129311/129314 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 4472 event pairs, 41 based on Foata normal form. 3/893 useless extension candidates. Maximal degree in co-relation 8746. Up to 732 conditions per place. [2024-06-03 21:30:38,104 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 194 selfloop transitions, 21 changer transitions 0/251 dead transitions. [2024-06-03 21:30:38,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 251 transitions, 3421 flow [2024-06-03 21:30:38,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 21:30:38,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 21:30:38,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 149 transitions. [2024-06-03 21:30:38,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41046831955922863 [2024-06-03 21:30:38,106 INFO L175 Difference]: Start difference. First operand has 247 places, 235 transitions, 2739 flow. Second operand 11 states and 149 transitions. [2024-06-03 21:30:38,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 251 transitions, 3421 flow [2024-06-03 21:30:38,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 251 transitions, 3357 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-03 21:30:38,333 INFO L231 Difference]: Finished difference. Result has 250 places, 237 transitions, 2783 flow [2024-06-03 21:30:38,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2675, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2783, PETRI_PLACES=250, PETRI_TRANSITIONS=237} [2024-06-03 21:30:38,333 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 218 predicate places. [2024-06-03 21:30:38,333 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 237 transitions, 2783 flow [2024-06-03 21:30:38,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:30:38,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:30:38,334 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:30:38,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-03 21:30:38,334 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-03 21:30:38,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:30:38,334 INFO L85 PathProgramCache]: Analyzing trace with hash -271981827, now seen corresponding path program 5 times [2024-06-03 21:30:38,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:30:38,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760037641] [2024-06-03 21:30:38,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:30:38,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:30:38,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:30:48,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:30:48,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:30:48,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760037641] [2024-06-03 21:30:48,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760037641] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:30:48,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:30:48,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 21:30:48,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250080098] [2024-06-03 21:30:48,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:30:48,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 21:30:48,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:30:48,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 21:30:48,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-03 21:30:48,794 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-03 21:30:48,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 237 transitions, 2783 flow. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:30:48,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:30:48,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-03 21:30:48,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:30:49,144 INFO L124 PetriNetUnfolderBase]: 484/890 cut-off events. [2024-06-03 21:30:49,144 INFO L125 PetriNetUnfolderBase]: For 125560/125563 co-relation queries the response was YES. [2024-06-03 21:30:49,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8672 conditions, 890 events. 484/890 cut-off events. For 125560/125563 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 4451 event pairs, 42 based on Foata normal form. 3/889 useless extension candidates. Maximal degree in co-relation 8551. Up to 745 conditions per place. [2024-06-03 21:30:49,154 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 193 selfloop transitions, 18 changer transitions 0/247 dead transitions. [2024-06-03 21:30:49,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 247 transitions, 3229 flow [2024-06-03 21:30:49,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:30:49,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:30:49,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 125 transitions. [2024-06-03 21:30:49,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4208754208754209 [2024-06-03 21:30:49,156 INFO L175 Difference]: Start difference. First operand has 250 places, 237 transitions, 2783 flow. Second operand 9 states and 125 transitions. [2024-06-03 21:30:49,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 247 transitions, 3229 flow [2024-06-03 21:30:49,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 247 transitions, 3151 flow, removed 27 selfloop flow, removed 7 redundant places. [2024-06-03 21:30:49,411 INFO L231 Difference]: Finished difference. Result has 252 places, 237 transitions, 2747 flow [2024-06-03 21:30:49,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2705, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2747, PETRI_PLACES=252, PETRI_TRANSITIONS=237} [2024-06-03 21:30:49,411 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 220 predicate places. [2024-06-03 21:30:49,411 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 237 transitions, 2747 flow [2024-06-03 21:30:49,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:30:49,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:30:49,412 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:30:49,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-03 21:30:49,412 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-03 21:30:49,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:30:49,413 INFO L85 PathProgramCache]: Analyzing trace with hash -845153715, now seen corresponding path program 12 times [2024-06-03 21:30:49,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:30:49,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797476691] [2024-06-03 21:30:49,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:30:49,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:30:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:30:58,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:30:58,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:30:58,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797476691] [2024-06-03 21:30:58,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797476691] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:30:58,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:30:58,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:30:58,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180477714] [2024-06-03 21:30:58,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:30:58,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:30:58,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:30:58,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:30:58,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:30:58,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 21:30:58,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 237 transitions, 2747 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:30:58,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:30:58,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 21:30:58,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:30:59,217 INFO L124 PetriNetUnfolderBase]: 521/937 cut-off events. [2024-06-03 21:30:59,218 INFO L125 PetriNetUnfolderBase]: For 126522/126525 co-relation queries the response was YES. [2024-06-03 21:30:59,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9065 conditions, 937 events. 521/937 cut-off events. For 126522/126525 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 4600 event pairs, 53 based on Foata normal form. 1/933 useless extension candidates. Maximal degree in co-relation 8942. Up to 739 conditions per place. [2024-06-03 21:30:59,228 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 205 selfloop transitions, 53 changer transitions 0/261 dead transitions. [2024-06-03 21:30:59,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 261 transitions, 3902 flow [2024-06-03 21:30:59,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:30:59,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:30:59,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 135 transitions. [2024-06-03 21:30:59,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2024-06-03 21:30:59,229 INFO L175 Difference]: Start difference. First operand has 252 places, 237 transitions, 2747 flow. Second operand 10 states and 135 transitions. [2024-06-03 21:30:59,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 261 transitions, 3902 flow [2024-06-03 21:30:59,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 261 transitions, 3864 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-03 21:30:59,479 INFO L231 Difference]: Finished difference. Result has 256 places, 248 transitions, 3090 flow [2024-06-03 21:30:59,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2709, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3090, PETRI_PLACES=256, PETRI_TRANSITIONS=248} [2024-06-03 21:30:59,480 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 224 predicate places. [2024-06-03 21:30:59,480 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 248 transitions, 3090 flow [2024-06-03 21:30:59,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:30:59,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:30:59,480 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:30:59,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-03 21:30:59,481 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-03 21:30:59,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:30:59,481 INFO L85 PathProgramCache]: Analyzing trace with hash 217421121, now seen corresponding path program 13 times [2024-06-03 21:30:59,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:30:59,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785470778] [2024-06-03 21:30:59,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:30:59,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:30:59,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:31:09,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:31:09,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:31:09,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785470778] [2024-06-03 21:31:09,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785470778] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:31:09,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:31:09,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:31:09,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783509589] [2024-06-03 21:31:09,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:31:09,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:31:09,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:31:09,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:31:09,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:31:09,297 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 21:31:09,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 248 transitions, 3090 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:31:09,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:31:09,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 21:31:09,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:31:09,741 INFO L124 PetriNetUnfolderBase]: 527/947 cut-off events. [2024-06-03 21:31:09,741 INFO L125 PetriNetUnfolderBase]: For 133351/133354 co-relation queries the response was YES. [2024-06-03 21:31:09,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9383 conditions, 947 events. 527/947 cut-off events. For 133351/133354 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 4653 event pairs, 55 based on Foata normal form. 2/944 useless extension candidates. Maximal degree in co-relation 9257. Up to 710 conditions per place. [2024-06-03 21:31:09,751 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 200 selfloop transitions, 62 changer transitions 0/265 dead transitions. [2024-06-03 21:31:09,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 265 transitions, 4132 flow [2024-06-03 21:31:09,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:31:09,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:31:09,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 138 transitions. [2024-06-03 21:31:09,753 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41818181818181815 [2024-06-03 21:31:09,753 INFO L175 Difference]: Start difference. First operand has 256 places, 248 transitions, 3090 flow. Second operand 10 states and 138 transitions. [2024-06-03 21:31:09,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 265 transitions, 4132 flow [2024-06-03 21:31:09,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 265 transitions, 3978 flow, removed 56 selfloop flow, removed 4 redundant places. [2024-06-03 21:31:09,995 INFO L231 Difference]: Finished difference. Result has 262 places, 252 transitions, 3182 flow [2024-06-03 21:31:09,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2936, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3182, PETRI_PLACES=262, PETRI_TRANSITIONS=252} [2024-06-03 21:31:09,996 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 230 predicate places. [2024-06-03 21:31:09,996 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 252 transitions, 3182 flow [2024-06-03 21:31:09,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:31:09,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:31:09,996 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:31:09,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-03 21:31:09,997 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-03 21:31:09,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:31:09,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1585170287, now seen corresponding path program 14 times [2024-06-03 21:31:09,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:31:09,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750519233] [2024-06-03 21:31:09,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:31:09,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:31:10,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:31:20,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:31:20,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:31:20,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750519233] [2024-06-03 21:31:20,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750519233] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:31:20,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:31:20,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 21:31:20,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319105926] [2024-06-03 21:31:20,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:31:20,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 21:31:20,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:31:20,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 21:31:20,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-03 21:31:20,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 21:31:20,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 252 transitions, 3182 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:31:20,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:31:20,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 21:31:20,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:31:21,066 INFO L124 PetriNetUnfolderBase]: 530/952 cut-off events. [2024-06-03 21:31:21,067 INFO L125 PetriNetUnfolderBase]: For 133465/133465 co-relation queries the response was YES. [2024-06-03 21:31:21,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9498 conditions, 952 events. 530/952 cut-off events. For 133465/133465 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 4692 event pairs, 48 based on Foata normal form. 1/951 useless extension candidates. Maximal degree in co-relation 9370. Up to 893 conditions per place. [2024-06-03 21:31:21,077 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 245 selfloop transitions, 16 changer transitions 0/264 dead transitions. [2024-06-03 21:31:21,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 264 transitions, 3786 flow [2024-06-03 21:31:21,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:31:21,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:31:21,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2024-06-03 21:31:21,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3515151515151515 [2024-06-03 21:31:21,081 INFO L175 Difference]: Start difference. First operand has 262 places, 252 transitions, 3182 flow. Second operand 10 states and 116 transitions. [2024-06-03 21:31:21,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 264 transitions, 3786 flow [2024-06-03 21:31:21,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 264 transitions, 3635 flow, removed 30 selfloop flow, removed 6 redundant places. [2024-06-03 21:31:21,343 INFO L231 Difference]: Finished difference. Result has 266 places, 254 transitions, 3130 flow [2024-06-03 21:31:21,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3031, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3130, PETRI_PLACES=266, PETRI_TRANSITIONS=254} [2024-06-03 21:31:21,344 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 234 predicate places. [2024-06-03 21:31:21,344 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 254 transitions, 3130 flow [2024-06-03 21:31:21,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:31:21,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:31:21,345 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:31:21,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-03 21:31:21,345 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-03 21:31:21,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:31:21,346 INFO L85 PathProgramCache]: Analyzing trace with hash 465849688, now seen corresponding path program 4 times [2024-06-03 21:31:21,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:31:21,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498548858] [2024-06-03 21:31:21,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:31:21,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:31:21,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:31:32,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:31:32,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:31:32,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498548858] [2024-06-03 21:31:32,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498548858] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:31:32,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:31:32,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:31:32,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967325779] [2024-06-03 21:31:32,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:31:32,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:31:32,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:31:32,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:31:32,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:31:32,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 21:31:32,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 254 transitions, 3130 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:31:32,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:31:32,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 21:31:32,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:31:32,701 INFO L124 PetriNetUnfolderBase]: 528/949 cut-off events. [2024-06-03 21:31:32,701 INFO L125 PetriNetUnfolderBase]: For 132160/132163 co-relation queries the response was YES. [2024-06-03 21:31:32,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9295 conditions, 949 events. 528/949 cut-off events. For 132160/132163 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 4682 event pairs, 47 based on Foata normal form. 1/945 useless extension candidates. Maximal degree in co-relation 9166. Up to 723 conditions per place. [2024-06-03 21:31:32,712 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 191 selfloop transitions, 70 changer transitions 0/264 dead transitions. [2024-06-03 21:31:32,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 264 transitions, 3680 flow [2024-06-03 21:31:32,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 21:31:32,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 21:31:32,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2024-06-03 21:31:32,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40404040404040403 [2024-06-03 21:31:32,713 INFO L175 Difference]: Start difference. First operand has 266 places, 254 transitions, 3130 flow. Second operand 9 states and 120 transitions. [2024-06-03 21:31:32,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 264 transitions, 3680 flow [2024-06-03 21:31:32,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 264 transitions, 3560 flow, removed 43 selfloop flow, removed 8 redundant places. [2024-06-03 21:31:32,972 INFO L231 Difference]: Finished difference. Result has 267 places, 254 transitions, 3157 flow [2024-06-03 21:31:32,972 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3010, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3157, PETRI_PLACES=267, PETRI_TRANSITIONS=254} [2024-06-03 21:31:32,972 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 235 predicate places. [2024-06-03 21:31:32,973 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 254 transitions, 3157 flow [2024-06-03 21:31:32,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:31:32,973 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:31:32,973 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:31:32,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-03 21:31:32,973 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-03 21:31:32,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:31:32,974 INFO L85 PathProgramCache]: Analyzing trace with hash 217420904, now seen corresponding path program 8 times [2024-06-03 21:31:32,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:31:32,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737421328] [2024-06-03 21:31:32,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:31:32,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:31:33,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:31:47,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:31:47,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:31:47,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737421328] [2024-06-03 21:31:47,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737421328] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:31:47,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:31:47,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 21:31:47,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141339115] [2024-06-03 21:31:47,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:31:47,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 21:31:47,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:31:47,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 21:31:47,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 21:31:47,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 21:31:47,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 254 transitions, 3157 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:31:47,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:31:47,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 21:31:47,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:31:48,201 INFO L124 PetriNetUnfolderBase]: 536/966 cut-off events. [2024-06-03 21:31:48,201 INFO L125 PetriNetUnfolderBase]: For 140489/140492 co-relation queries the response was YES. [2024-06-03 21:31:48,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9708 conditions, 966 events. 536/966 cut-off events. For 140489/140492 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4805 event pairs, 54 based on Foata normal form. 1/962 useless extension candidates. Maximal degree in co-relation 9578. Up to 789 conditions per place. [2024-06-03 21:31:48,212 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 222 selfloop transitions, 45 changer transitions 0/270 dead transitions. [2024-06-03 21:31:48,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 270 transitions, 4125 flow [2024-06-03 21:31:48,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 21:31:48,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 21:31:48,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 140 transitions. [2024-06-03 21:31:48,214 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-03 21:31:48,214 INFO L175 Difference]: Start difference. First operand has 267 places, 254 transitions, 3157 flow. Second operand 10 states and 140 transitions. [2024-06-03 21:31:48,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 270 transitions, 4125 flow [2024-06-03 21:31:48,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 270 transitions, 3963 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-06-03 21:31:48,485 INFO L231 Difference]: Finished difference. Result has 268 places, 258 transitions, 3288 flow [2024-06-03 21:31:48,486 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2997, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3288, PETRI_PLACES=268, PETRI_TRANSITIONS=258} [2024-06-03 21:31:48,486 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 236 predicate places. [2024-06-03 21:31:48,486 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 258 transitions, 3288 flow [2024-06-03 21:31:48,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:31:48,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:31:48,487 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:31:48,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-03 21:31:48,487 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-03 21:31:48,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:31:48,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1319473007, now seen corresponding path program 15 times [2024-06-03 21:31:48,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:31:48,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837779303] [2024-06-03 21:31:48,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:31:48,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:31:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15